Queries and Constraints on Semi-structured Data

  • Diego Calvanese
  • Giuseppe De Giacomo
  • Maurizio Lenzerini
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1626)


We extend the model for semi-structured data proposed in [4], where both databases and schemas are represented as graphs, with the possibility of expressing different types of constraints on the nodes of the graphs, and defining queries which are used to select graphs from a database. We show that reasoning tasks at the basis of query optimization, such as schema subsumption, query-schema comparison, query containment, and query satisfiability, are decidable.


Digital Library Query Language Reasoning Task Query Optimization Graph Schema 
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.


  1. [1]
    S. Abiteboul. Querying semi-structured data. In Proc. of ICDT-97, pages 1–18, 1997.Google Scholar
  2. [2]
    S. Abiteboul, S. Cluet, V. Christophides, T. Milo, and J. S. Guido Moerkotte. Querying documents in object databases. Int. J. on Digital Libraries, 1(1):5–19, 1997.CrossRefGoogle Scholar
  3. [3]
    S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. L. Wiener. The Lorel query language for semistructured data. Int. J. on Digital Libraries, 1(1):68–88, 1997.Google Scholar
  4. [4]
    P. Buneman, S. Davidson, M. Fernandez, and D. Suciu. Adding structure to unstructured data. In Proc. of ICDT-97, pages 336–350, 1997.Google Scholar
  5. [5]
    P. Buneman, S. Davidson, G. Hillebrand, and D. Suciu. A query language and optimization technique for unstructured data. In Proc. of ACM SIGMOD, pages 505–516, 1996.Google Scholar
  6. [6]
    D. Calvanese, G. De Giacomo, and M. Lenzerini. Queries and constraints on semi-structured data. Technical Report 13-98, Dip. di Inf. e Sist., Univ. di Roma “La Sapienza”, 1998.Google Scholar
  7. [7]
    D. Calvanese, G. De Giacomo, and M. Lenzerini. What can knowledge representation do for semi-structured data? In Proc. of AAAI-98, pages 205–210, 1998.Google Scholar
  8. [8]
    M. F. Fernandez, D. Florescu, J. Kang, A. Y. Levy, and D. Suciu. Catching the boat with strudel: Experiences with a web-site management system. In Proc. of ACM SIGMOD, pages 414–425, 1998.Google Scholar
  9. [9]
    M. F. Fernandez, D. Florescu, A. Y. Levy, and D. Suciu. A query language for a web-site management system. SIGMOD Record, 26(3):4–11, 1997.CrossRefGoogle Scholar
  10. [10]
    R. Goldman and J. Widom. DataGuides: Enabling query formulation and optimization in semistructured databases. In Proc. of VLDB-97, pages 436–445, 1997.Google Scholar
  11. [11]
    D. Kozen. Results on the propositional μ-calculus. Theor. Comp. Sci., 27:333–354, 1983.zbMATHCrossRefMathSciNetGoogle Scholar
  12. [12]
    A. Mendelzon, G. A. Mihaila, and T. Milo. Querying the World Wide Web. Int. J. on Digital Libraries, 1(1):54–67, 1997.Google Scholar
  13. [13]
    D. Quass, A. Rajaraman, I. Sagiv, J. Ullman, and J. Widom. Querying semistructured heterogeneous information. In Proc. of DOOD-95, pages 319–344. Springer-Verlag, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Diego Calvanese
    • 1
  • Giuseppe De Giacomo
    • 1
  • Maurizio Lenzerini
    • 1
  1. 1.Dipartimento di Informatica e SistemisticaUniversità di Roma “La Sapienza”RomaItaly

Personalised recommendations