Skip to main content
SpringerLink
Log in

Querying Graph Databases

  • Conference paper
  • First Online:
Advances in Database Technology — EDBT 2000 (EDBT 2000)

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

Included in the following conference series:

Abstract

Graph data is an emerging model for representing a variety of database contexts ranging from object-oriented databases to hypertext data. Also many of the recursive queries that arise in relational databases are, in practice, graph traversals. In this paper we present a language for searching graph-like databases. The language permits us to express paths in a graph by means of extended regular expressions. The proposed extension is based on the introduction of constructs which permit us i) to de_ne a partial order on the paths used to search the graph and, consequently, on the answers of queries, and ii) to cut off, nondeterministically, tuples with low priority. We present an algebra for partially ordered relations and an algorithm for the computation of path queries. Finally, we present applications to hypertext databases such as the Web.

Work partially supported by a MURST grant under the projects “Interdata”, Telcal and Contact. The second author is also supported by ISI-CNR.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Abiteboul S. Querying Semi-structured Data. In Proc. Int. Conf. on Database Theory (ICDT), pages 1–18, 1997.

    Google Scholar 

  2. Abiteboul S., E. Simon, V. Vianu. Non-Deterministic Language to Express Deterministic Transformation. In Proc. of the Ninth ACM Symposium on Principles of Database Systems (PODS), pages 215–229, 1990.

    Google Scholar 

  3. Abiteboul S., R. Hull, V. Vianu. Foundations of Databases. Addison-Wesley. 1994.

    Google Scholar 

  4. Abiteboul S., V. Vianu. Queries and Computation on the Web. In Proc. Int. Conf. on Database Theory (ICDT), pages 262–275, 1997.

    Google Scholar 

  5. Abiteboul S., V. Vianu. Regular Path Queries with Constraints. In Proc. Sixteenth Int. Symposium on Database Systems (PODS), pages 122–133, 1997.

    Google Scholar 

  6. Abiteboul S., D. Quass, J. McHugh, J. Widom, J. L. Wiener, The Lorel Query Language for Semistructured Data. in Journal on Digital Libraries 1(1), pages 68–88, 1997.

    Google Scholar 

  7. Beeri C, Y. Kornatzky, A logical query language for hypertext systems. In Proc. European Conf. on Hypertexts, pages 67–80, Cambridge University Press, 1990.

    Google Scholar 

  8. Buneman P., S. Davinson, G. Hillebrand, D. Suciu, A query language and optimization techniques for unstructured data. In Proc. ACM SIGMOD Conf. on Management of Data, pages 505–516, 1996.

    Google Scholar 

  9. Carey M., D. Kossmann, On Saying “Enough Already!” in SQL. In Proc. ACM SIGMOD Conf., pages 219–230, 1997.

    Google Scholar 

  10. Consens M, Mendelzon A., GraphLog: a visual formalism for real life recursion. In Proc. PODS Conf., pages 404–416, 1990.

    Google Scholar 

  11. Christophides, V., S. Cluet, G. Moerkotte, Evaluating Queries with Generalized Path Expressions, in Proc. of the ACM SIGMOD Conf., pages 413–422, 1996.

    Google Scholar 

  12. Fernandez M.F., D. Florescu, J. Kang, A. Y. Levy, D. Suciu, STRUDEL: A Web-site Management System. in Proc. ACM SIGMOD Conf., pages 549–552, 1997.

    Google Scholar 

  13. Greco S., D. Saccà, C. Zaniolo. Datalog with choice and stratified negation: from \( \mathcal{P} \) to \( \mathcal{D}^p \). In Proc. 2nd Int. Conf. on Database Theory (ICDT), pages 82–96, 1995.

    Google Scholar 

  14. Gyssens, M., J. Paradaens, D. Van Gucht, A Graph-Oriented Object Database Model, in Proc. of the Ninth Symposium on Principles of Database Systems, pages 417–424, 1990.

    Google Scholar 

  15. Hopcroft J., J. Ullman. Introduction to Automata Theory, Languages and Computation. Addison Wesley, 1980.

    Google Scholar 

  16. Konopnicki, D., O. Shmueli, W3QS: A Query System for the World-Wide-Web, in Proc. Int. Conf. on Very Large Data Bases (VLDB), pages 54–65, 1995.

    Google Scholar 

  17. Mendelzon A., P.T. Wood, Finding Regular Simple Path in Graph Databases, in SIAM Journal on Computing, 24(6), pages 1235–1258, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  18. Mendelzon A., G. Mihaila, T. Milo, Querying the World Wide Web, in Journal of Digital Libraries, pages 54–67, 1997.

    Google Scholar 

  19. Mendelzon A., T. Milo, Formal models of web queries, in Proc. on the Symp. on Principles of Database Systems (PODS), pages 134–143, 1997.

    Google Scholar 

  20. Van den Bussche J, G. Vossen. An extension of path expression to simplify navigation in objects. In Proc. Int. Conf. on Deductive and Object-Oriented Databases (DOOD), pages 267–282, 1993.

    Google Scholar 

  21. Yannakakis M., Graph-theoretic methods in database theory, in Proc. of the Ninth Symposium on Principles of Database Systems, pages 230–242, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEIS, Univ. della Calabria, 87030, Rende, Italy

    Sergio Flesca & Sergio Greco

Authors
  1. Sergio Flesca
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergio Greco
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, University of California, Los Angeles, CA, 90095, USA

    Carlo Zaniolo

  2. Computer Science Department, University of Karlsruhe, P.O. Box 6980, 76128, Karlsruhe, Germany

    Peter C. Lockemann

  3. University of Konstanz, P.O. Box D188, 78457, Konstanz, Germany

    Marc H. Scholl  & Torsten Grust  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Flesca, S., Greco, S. (2000). Querying Graph Databases. In: Zaniolo, C., Lockemann, P.C., Scholl, M.H., Grust, T. (eds) Advances in Database Technology — EDBT 2000. EDBT 2000. Lecture Notes in Computer Science, vol 1777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46439-5_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-46439-5_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67227-2

  • Online ISBN: 978-3-540-46439-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation