Efficient queries over web views
Identifieur interne : 000E78 ( Istex/Checkpoint ); précédent : 000E77; suivant : 000E79Efficient queries over web views
Auteurs : Giansalvatore Mecca [Italie] ; Alberto O. Mendelzon [Canada] ; Paolo Merialdo [Italie]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1998.
Abstract
Abstract: Large web sites are becoming repositories of structured information that can benefit from being viewed and queried as relational databases. However, querying these views efficiently requires new techniques. Data usually resides at a remote site and is organized as a set of related HTML documents, with network access being a primary cost factor in query evaluation. This cost can be reduced by exploiting the redundancy often found in site design. We use a simple data model, a subset of the Araneus data model, to describe the structure of a web site. We augment the model with link and inclusion constraints that capture the redundancies in the site. We map relational views of a site to a navigational algebra and show how to use the constraints to rewrite algebraic expressions, reducing the number of network accesses.
Url:
DOI: 10.1007/BFb0100978
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
ISTEX:378C44FCABEB2D0696455F8664CEC976156383F9Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Efficient queries over web views</title><author><name sortKey="Mecca, Giansalvatore" sort="Mecca, Giansalvatore" uniqKey="Mecca G" first="Giansalvatore" last="Mecca">Giansalvatore Mecca</name></author><author><name sortKey="Mendelzon, Alberto O" sort="Mendelzon, Alberto O" uniqKey="Mendelzon A" first="Alberto O." last="Mendelzon">Alberto O. Mendelzon</name></author><author><name sortKey="Merialdo, Paolo" sort="Merialdo, Paolo" uniqKey="Merialdo P" first="Paolo" last="Merialdo">Paolo Merialdo</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:378C44FCABEB2D0696455F8664CEC976156383F9</idno><date when="1998" year="1998">1998</date><idno type="doi">10.1007/BFb0100978</idno><idno type="url">https://api.istex.fr/document/378C44FCABEB2D0696455F8664CEC976156383F9/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001422</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001422</idno><idno type="wicri:Area/Istex/Curation">001310</idno><idno type="wicri:Area/Istex/Checkpoint">000E78</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000E78</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Efficient queries over web views</title><author><name sortKey="Mecca, Giansalvatore" sort="Mecca, Giansalvatore" uniqKey="Mecca G" first="Giansalvatore" last="Mecca">Giansalvatore Mecca</name><affiliation wicri:level="1"><country xml:lang="fr">Italie</country><wicri:regionArea>DIFA, Università della Basilicata, Potenza</wicri:regionArea><wicri:noRegion>Potenza</wicri:noRegion></affiliation></author><author><name sortKey="Mendelzon, Alberto O" sort="Mendelzon, Alberto O" uniqKey="Mendelzon A" first="Alberto O." last="Mendelzon">Alberto O. Mendelzon</name><affiliation wicri:level="4"><country xml:lang="fr">Canada</country><wicri:regionArea>Dept. of Computer Science, University of Toronto</wicri:regionArea><placeName><settlement type="city">Toronto</settlement><region type="state">Ontario</region></placeName><orgName type="university">Université de Toronto</orgName></affiliation></author><author><name sortKey="Merialdo, Paolo" sort="Merialdo, Paolo" uniqKey="Merialdo P" first="Paolo" last="Merialdo">Paolo Merialdo</name><affiliation wicri:level="3"><country xml:lang="fr">Italie</country><wicri:regionArea>Dip. Informatica e Automazione, Università di Roma Tre, Roma</wicri:regionArea><placeName><settlement type="city">Rome</settlement><region nuts="2">Latium</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1998</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">378C44FCABEB2D0696455F8664CEC976156383F9</idno><idno type="DOI">10.1007/BFb0100978</idno><idno type="ChapterID">6</idno><idno type="ChapterID">Chap6</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Large web sites are becoming repositories of structured information that can benefit from being viewed and queried as relational databases. However, querying these views efficiently requires new techniques. Data usually resides at a remote site and is organized as a set of related HTML documents, with network access being a primary cost factor in query evaluation. This cost can be reduced by exploiting the redundancy often found in site design. We use a simple data model, a subset of the Araneus data model, to describe the structure of a web site. We augment the model with link and inclusion constraints that capture the redundancies in the site. We map relational views of a site to a navigational algebra and show how to use the constraints to rewrite algebraic expressions, reducing the number of network accesses.</div></front></TEI><affiliations><list><country><li>Canada</li><li>Italie</li></country><region><li>Latium</li><li>Ontario</li></region><settlement><li>Rome</li><li>Toronto</li></settlement><orgName><li>Université de Toronto</li></orgName></list><tree><country name="Italie"><noRegion><name sortKey="Mecca, Giansalvatore" sort="Mecca, Giansalvatore" uniqKey="Mecca G" first="Giansalvatore" last="Mecca">Giansalvatore Mecca</name></noRegion><name sortKey="Merialdo, Paolo" sort="Merialdo, Paolo" uniqKey="Merialdo P" first="Paolo" last="Merialdo">Paolo Merialdo</name></country><country name="Canada"><region name="Ontario"><name sortKey="Mendelzon, Alberto O" sort="Mendelzon, Alberto O" uniqKey="Mendelzon A" first="Alberto O." last="Mendelzon">Alberto O. Mendelzon</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000E78 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 000E78 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Checkpoint
|type= RBID
|clé= ISTEX:378C44FCABEB2D0696455F8664CEC976156383F9
|texte= Efficient queries over web views
}}
| This area was generated with Dilib version V0.6.31. |  |