Abstract
Semi-structured data are commonly represented by labelled graphs. The labels may be strings, integers, . . . Thus their type is atomic. They are carried by edges and/or nodes. In this paper, we investigate a nested graph representation of semi-structured data. Some nodes of our graphs may be labelled by graphs. Our motivation is to bring the data model in use closer to the natural presentation of data, in particular closer to the Web presentation. The main purpose of the paper is to provide query languages of reasonable expressive power for querying nested db-graphs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Abiteboul and N. Bidoit. Non first normal form relations: An algebra allowing data restructuring. Journal of Computer and System Sciences, Academic, 33, 1986.
S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. L. Wiener. The lorel query language for semistructured data. International Journal on Digital Libraries, 1(1):68–88, April 1997.
Serge Abiteboul. Querying semistructured Data. In ICDT, pages 1–18, 1997.
Nicole Bidoit and Mourad Ykhlef. Fixpoint Path Queries. In International Workshop on the Web and Databases WebDB’98 In Conjunction with EDBT’98, pages 56–62, Valencia, Spain, 27–28 March 1998. http://www.dia.uniroma3.it/webdb98/papers.html/.
Nicole Bidoit and Mourad Ykhlef. Fixpoint Calculus for Querying Semistructured Data. Lecture Notes in Computer Science, 1590:78–98, 1999.
P. Buneman, S. B. Davidson, M. Fernandez, and D. Suciu. Adding Structure to Unstructured Data. In Proceedings of International Conference on Database Theory (ICDT), Delphi, Greece, January 1997.
P. Buneman, S. B. Davidson, G. Hillebrand, and D. Suciu. A query language and optimization techniques for unstructured data. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 505–516, Montreal, Canada, June 1996.
M. Fernandez, D. Florescu, J. Kang, A. Y. Levy, and D. Suciu. System demonstration-strudel: A web-site management system. In Proceedings of ACM SIGMOD Conference on Management of Data, Tucson, Arizona, May 1997. Exhibition Program.
A. Mendelzon, G. Mihaila, and T. Milo. Querying the World Wide Web. International Journal on Digital Libraries, 1(1):54–67, 1997.
A. Mendelzon, and P. Wood. Finding Regular Simple Paths in Graph Databases. SIAM Journal on Computing, 24, 1995.
R. Milner. Communication and concurrency. Prentice Hall, 1989.
Y. Papakonstantinou, H. Garcia-Molina, and J. Widom. Object exchange across heterogeneous information sources. In Proceedings of IEEE International Conference on Data Engineering (ICDE), pages 251–260, Taipei, Taiwan, March 1995.
J. Paredaens and D. Van Gucht. Possibilities and limitations of using flat operators in nested algebra expressions. In Proceedings of PODS conference, 1988.
M. Ykhlef. Interrogation des données semistructurées. PhD thesis, Univ. of Bordeaux, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bidoit, N., Maabout, S., Ykhlef, M. (2000). A Family of Nested Query Languages for Semi-structured Data. In: Schewe, KD., Thalheim, B. (eds) Foundations of Information and Knowledge Systems. FoIKS 2000. Lecture Notes in Computer Science, vol 1762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46564-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-46564-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67100-8
Online ISBN: 978-3-540-46564-5
eBook Packages: Springer Book Archive