Typechecking for Semistructured Data

  • Dan Suciu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2397)


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.


Regular Expression Regular Language Unit Type Output Type Type Inference 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. ABS99.
    S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 1999.Google Scholar
  2. AMN+01a.
    N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. Typechecking XML views of relational databases. In LICS, pages 421–430, 2001.Google Scholar
  3. AMN+01b.
    N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. XML with data values: Typechecking revisited. In PODS, pages 138–149, 2001.Google Scholar
  4. BDFS97.
    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.Google Scholar
  5. BFRW84.
    A. Brown, M. Fuchs, J. Robie, and P. Wadler. MSL: a model for W3C XML Schema. In Proceedings of WWW10, Hong Kong, May 1984.Google Scholar
  6. BKMW98.
    A. Bruggemann-Klein, M. Murata, and D. Wood. Regular tree languages over non-ranked alphabets, 1998. Available at
  7. BLM+99.
    D. Beech, S. Lawrence, M. Maloney, N. Mendelsohn, and H. Thompson. Xml schema part 1: Structures, May 1999.
  8. BM99.
    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.Google Scholar
  9. BMN00a.
    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.Google Scholar
  10. BMN00b.
    G. J. Bex, S. Maneth, and F. Neven. A formal model for an expressive fragment of XSLT, 2000. To appear in Information Systems.Google Scholar
  11. Con98.
    World Wide Web Consortium. Extensible markup language (xml) 1.0, 1998.
  12. FFM+01.
    P. Fankhauser, M. Fernandez, A. Malhotra, M. Rys, J. Simeon, and P. Wadler. XQuery 1.0 formal semantics, 2001. available from the W3C,
  13. FST00.
    M. Fernandez, D. Suciu, and W. Tan. SilkRoute: trading between relations and XML. In Proceedings of the WWW9, pages 723–746, Amsterdam, 2000.Google Scholar
  14. GW97.
    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.Google Scholar
  15. HP00.
    Haruo Hosoya and Benjamin C. Pierce. XDuce: An XML processing language (preliminary report). In WebDB’2000, pages 226–244, 2000.
  16. HP01.
    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.Google Scholar
  17. Mit96.
    John C. Mitchell. Foundations for Programmng Languages. MIT Press, 1996.Google Scholar
  18. MSV00.
    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.Google Scholar
  19. Mur96.
    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.Google Scholar
  20. PV00.
    Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In Proceedings of PODS, pages 35–46, Dallas, TX, 2000.Google Scholar
  21. Sei90.
    Helmut Seidl. Deciding equivalence of finite tree automata. SIAM J. Comput, 19(3):424–437, 1990.zbMATHCrossRefMathSciNetGoogle Scholar
  22. SSB+00.
    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.Google Scholar
  23. Tan01.
    Val Tannen. Personal communication, 2001.Google Scholar
  24. Tho90.
    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.Google Scholar
  25. Wad01.
    Phil Wadler. Personal communication, 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Dan Suciu
    • 1
  1. 1.University of WashingtonUSA

Personalised recommendations