Skip to main content
SpringerLink
Log in

Managing Schemata for Semistructured Databases Using Constraints

  • Conference paper
  • First Online:
Current Issues in Databases and Information Systems (ADBIS 2000, DASFAA 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1884))

  • 263 Accesses

Abstract

Managing semistructured data requires more flexibility than traditional database systems provide. Recently we proposed a query language for semistructured data represented as labeled directed graphs. This language is based on matching a partial schema into the database. In this paper we describe how we achieve this matching using constraints. We show how to match a schema into a database without using any additional information. In order to match schemata more efficiently, we are able to incorporate results of previously matched schemata. To this end, we formulate a sufficient condition for schema containment and describe how to test this condition, again, using constraints. We show how the knowledge of schema containment can be used for optimization. As a theoretical contribution we prove that, under some circumstances, schema matches can be found without any backtracking and in polynomial time.

This research was done while André Bergholz was at Humboldt-University Berlin. It was supported by the German Research Society, Berlin-Brandenburg Graduate School in Distributed Information Systems (DFG grant no. GRK 316). André Bergholz is now supported by the German Academic Exchange Service (DAAD program HSP III).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul. Querying semi-structured data. In Proceedings of the International Conference on Database Theory (ICDT), pages 1–18, Delphi, Greece, January 1997.

    Google Scholar 

  2. P. Atzeni, G. Mecca, and P. Merialdo. To weave the web. In Proceedings of the International Conference on Very Large Databases (VLDB), pages 206–215, Athens, Greece, August 1997.

    Google Scholar 

  3. AQM+97._S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. Wiener. The Lorel query language for semistructured data. Journal of Digital Libraries, 1(1):68–88, 1997.

    Google Scholar 

  4. A. Aho, Y. Sagiv, and J. D. Ullman. Equivalence of relational expressions. SIAM Journal on Computing, 8(2):218–246, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. Bartak. Constraint programming: In pursuit of the holy grail. In Proceedings of the Week of Doctoral Students (WDS), Prague, Czech Republic, June 1999.

    Google Scholar 

  6. P. Buneman, S. Davidson, G. Hillebrand, and D. Suciu. A query language and optimization techniques for unstructured data. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 505–516, Montreal, Canada, June 1996.

    Google Scholar 

  7. A. Bergholz and J. C. Freytag. Querying semistructured data based on schema matching. In Proceedings of the International Workshop on Database Programming Languages (DBPL), Kinloch Rannoch, Scotland, UK, September 1999.

    Google Scholar 

  8. P. Buneman. Semistructured data. In Proceedings of the Symposium on Principles of Database Systems (PODS), pages 117–121, Tucson, AZ, USA, May 1997.

    Google Scholar 

  9. M. J. Carey and D. Kossmann. On saying “Enough Already!” in SQL. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 219–230, Tucson, AZ, USA, May 1997.

    Google Scholar 

  10. S. A. Cook. The complexity of theorem-proving procedures. In Proceedings of the ACM Symposium on Theory of Computing, pages 151–158, Shaker Heights, OH, USA, May 1971.

    Google Scholar 

  11. ECLiPSe-The ECRC Constraint Logic Parallel System, http://www.ecrc.de/eclipse/.

  12. FFK+98._M. Fernandez, D. Florescu, J. Kang, A. Levy, and D. Suciu. Catching the boat with Strudel: Experiences with a web-site management system. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 414–425, Seattle, WA, USA, June 1998.

    Google Scholar 

  13. D. Florescu, A. Levy, and D. Suciu. Query containment for conjunctive queries with regular expressions. In Proceedings of the Symposium on Principles of Database Systems (PODS), pages 139–148, Seattle, WA, USA, June 1998.

    Google Scholar 

  14. E. Freuder. A sufficient condition for backtrack-free search. Journal of the ACM, 29(1):24–32, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  15. A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99–118, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  16. J. McHugh, and J. Widom. Query optimization for XML. In Proceedings of the International Conference on Very Large Databases (VLDB), pages 315–326, Edinburgh, Scotland, UK, September 1999.

    Google Scholar 

  17. M. Rudolf. Utilizing constraint satisfaction techniques for efficient graph pattern matching. In Proceedings of the International Workshop on Theory and Application of Graph Transformations (TAGT), Paderborn, Germany, November 1998.

    Google Scholar 

  18. A. Zuendorf. A heuristic for the subgraph isomorphism problem in executing PROGRES. Technical Report AIB 93-5, RWTH Aachen, Aachen, Germany, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stanford University, Stanford, CA, 94305, USA

    André Bergholz

  2. Humboldt-Universität zu Berlin, Unter den Linden 6, 10099, Berlin, Germany

    Johann Christoph Freytag

Authors
  1. André Bergholz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Johann Christoph Freytag
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, Academy of Sciences of the Czech Republic, Pod Vodárenskou věží 2, 182 07, Prague 8, Czech Republic

    Július Štuller

  2. Faculty of Mathematics and Physics, Charles University, Malostranské nám. 25, 118 00, Prague 1, Czech Republic

    Jaroslav Pokorný

  3. Computer Science Institute, Brandenburg University of Technology, P.O. Box 101344, 03013, Cottbus, Germany

    Bernhard Thalheim

  4. Faculty of Science, Department of Information Science, Ochanomizu University, 2-1-1 Otsuka, Bunkyo-ku, Tokyo, 112-8610, Japan

    Yoshifumi Masunaga

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bergholz, A., Freytag, J.C. (2000). Managing Schemata for Semistructured Databases Using Constraints. In: Štuller, J., Pokorný, J., Thalheim, B., Masunaga, Y. (eds) Current Issues in Databases and Information Systems. ADBIS DASFAA 2000 2000. Lecture Notes in Computer Science, vol 1884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44472-6_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-44472-6_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67977-6

  • Online ISBN: 978-3-540-44472-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation