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.
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul and V. Vianu. Regular path queries with constraints. In PODS'97.
G. O. Arocena and A. O. Mendelzon. WebOQL: Restructuring documents, databases and Webs. In ICDE'98, 1998.
P. Atzeni and G. Mecca. Cut and Paste. In PODS'97.
P. Atzeni, G. Mecca, and P. Merialdo. To Weave the Web. In VLDB'97.
C. Beeri and Y. Kornatzky. Algebraic optimization of object-oriented query languages. In ICDT'90.
S. Cluet and C. Delobel. A general framework for the optimization of object-oriented queries. In SIGMOD'82.
B. P. Jenq, D. Woelk, W. Kim, and W. Lee. Query processing in distributed ORION. In EDBT'90.
A. Kemper and G. Moerkotte. Access support relations: An indexing method for object bases. Information Systems, 17(2):117–145, 1992.
M. Ley. Database systems and logic programming bibliography site, http://-www.informatik.uni-trier.de/~ley/db/index.html.
G. Mecca, A. Mendelzon, and P. Merialdo. Efficient queries over Web views. Technical Report n. RT-DIA-31-1998, Dipartimento di Informatica e Automazione, Università di Roma Tre, 1998. http://poincare.dia.uniroma3.it:8080/Araneus/.
A. Mendelzon, G. Mihaila, and T. Milo. Querying the World Wide Web. Journal of Digital Libraries, 1(1):54–67, April 1997.
C. Mohan, D. Haderle, Y. Wang, and J. Cheng. Single table access using multiple indexes: Optimization, execution, and concurrency control techniques. In EDBT'90.
S. Navathe. An intuitive view to normalize network structured data. In VLDB'80.
M. T. özsu and J. A. Blakeley. Query processing in object-oriented database systems. In W. Kim, editor, Modern Database Management — Object-Oriented and Multidatabase Technologies, pages 146–174. Addison Wesley-ACM Press, 1994.
A. Rosenthal and D. S. Reiner. An architecture for query optimization. In SIGMOD, 1982.
A. Rosenthal and D. S. Reiner. Querying relational views of networks. In W. Kim, D. S. Reiner, and D. S. Batory, editors, Query Processing in Database Systems, pages 109–124. Springer-Verlag, 1985.
M.A. Roth, H.F. Korth, and A. Silberschatz. Extended algebra and calculus for 1NF relational databases. ACM TODS, 13(4):389–417, December 1988.
G. M. Shaw and S. B. Zdonik. An object-oriented query algebra. In DBPL'89.
P. Valduriez. Join indices. ACM TODS, 12(2):218–246, 1987.
Xie Z. and Han J. Join index hierarchies for supporting efficient navigations in object-oriented databases. In VLDB'94.
C. Zaniolo. Design of relational views over network schemas. In SIGMOD 1979.
C. Zaniolo. The database language GEM. In SIGMOD 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mecca, G., Mendelzon, A.O., Merialdo, P. (1998). Efficient queries over web views. In: Schek, HJ., Alonso, G., Saltor, F., Ramos, I. (eds) Advances in Database Technology — EDBT'98. EDBT 1998. Lecture Notes in Computer Science, vol 1377. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0100978
Download citation
DOI: https://doi.org/10.1007/BFb0100978
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64264-0
Online ISBN: 978-3-540-69709-1
eBook Packages: Springer Book Archive