Abstract
Semistructured data is used in data exchange applications, like B2B and EAI, and represents data in a flexible format. Every data item has a unique tag (also called label), and data items can be nested. Formally, a semistructured data instance is a tree whose nodes are labeled with tags and leaves are labeled with data values. XML [Con98] is a standard syntax for describing such trees; Fig. 1 shows a tree representing a semistructured data instance and its XML syntax. We will refer interchangeably to semistructured data instances as trees or XML trees.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 1999.
N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. Typechecking XML views of relational databases. In LICS, pages 421–430, 2001.
N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. XML with data values: Typechecking revisited. In PODS, pages 138–149, 2001.
Peter Buneman, Susan Davidson, Mary Fernandez, and Dan Suciu. Adding structure to unstructured data. In Proceedings of the International Conference on Database Theory, pages 336–350, Deplhi, Greece, 1997. Springer Verlag.
A. Brown, M. Fuchs, J. Robie, and P. Wadler. MSL: a model for W3C XML Schema. In Proceedings of WWW10, Hong Kong, May 1984.
A. Bruggemann-Klein, M. Murata, and D. Wood. Regular tree languages over non-ranked alphabets, 1998. Available at ftp://ftp11.informatik.tu-muenchen.de/pub/misc/caterpillars/.
D. Beech, S. Lawrence, M. Maloney, N. Mendelsohn, and H. Thompson. Xml schema part 1: Structures, May 1999. http://www.w3.org/TR/xmlschema-1/.
Catriel Beeri and Tova Milo. Schemas for integration and translation of structured and semi-structured data. In Proceedings of the International Conference on Database Theory, pages 296–313, 1999.
G. J. Bex, S. Maneth, and F. Neven. A formal model for an expressive fragment of XSLT. In Lloyd et al., editor, Computational Logic-CL 2000, volume 1861 of Lecture Notes in Artificial Intelligence, pages 1137–1151. Springer, 2000.
G. J. Bex, S. Maneth, and F. Neven. A formal model for an expressive fragment of XSLT, 2000. To appear in Information Systems.
World Wide Web Consortium. Extensible markup language (xml) 1.0, 1998. http://www.w3.org/TR/REC-xml.
P. Fankhauser, M. Fernandez, A. Malhotra, M. Rys, J. Simeon, and P. Wadler. XQuery 1.0 formal semantics, 2001. available from the W3C, http://www.w3.org/TR/query-semantics.
M. Fernandez, D. Suciu, and W. Tan. SilkRoute: trading between relations and XML. In Proceedings of the WWW9, pages 723–746, Amsterdam, 2000.
Roy Goldman and Jennifer Widom. DataGuides: enabling query formulation and optimization in semistructured databases. In Proceedings of Very Large Data Bases, pages 436–445, September 1997.
Haruo Hosoya and Benjamin C. Pierce. XDuce: An XML processing language (preliminary report). In WebDB’2000, pages 226–244, 2000. http://www.research.att.com/conf/webdb2000/.
Haruo Hosoya and Benjamin C. Pierce. Regular expression pattern matching for xml. In ACM SIGPLAN, SIGACT Symposium on Principles of Programming Languages (POPL), pages 67–80, January 2001.
John C. Mitchell. Foundations for Programmng Languages. MIT Press, 1996.
T. Milo, D. Suciu, and V. Vianu. Typechecking for XML transformers. In Proceedings of the ACM Symposium on Principles of Database Systems, pages 11–22, Dallas, TX, 2000.
Makoto Murata. Transformation of documents and schemas by patterns and contextual conditions. In C. Nicholas and D. Wood, editors, Proceedings of Third International Workshop on Principles of Document Processing (PODP), pages 153–169, Palo Alto, CA, September 1996.
Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In Proceedings of PODS, pages 35–46, Dallas, TX, 2000.
Helmut Seidl. Deciding equivalence of finite tree automata. SIAM J. Comput, 19(3):424–437, 1990.
J. Shanmugasundaram, E. Shekita, R. Barr, M. Carey, B. Lindsay, H. Pirahesh, and B. Reinwald. Efficiently publishing relational data as xml documents. In Proceedings of VLDB, pages 65–76, Cairo, Egipt, September 2000.
Val Tannen. Personal communication, 2001.
W. Thomas. Automata on infinite objects. In Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, chapter 4, pages 133–192. Elsevier, Amsterdam, 1990.
Phil Wadler. Personal communication, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suciu, D. (2002). Typechecking for Semistructured Data. In: Ghelli, G., Grahne, G. (eds) Database Programming Languages. DBPL 2001. Lecture Notes in Computer Science, vol 2397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46093-4_1
Download citation
DOI: https://doi.org/10.1007/3-540-46093-4_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44080-2
Online ISBN: 978-3-540-46093-0
eBook Packages: Springer Book Archive