Querying graph databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1777, Issue , 2000, Pages 510-524

  Flesca, Sergio ^a   Greco, Sergio ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; GRAPH THEORY; HYPERTEXT SYSTEMS; OBJECT ORIENTED PROGRAMMING; QUERY PROCESSING; RELATIONAL DATABASE SYSTEMS;

EXTENDED REGULAR EXPRESSIONS; GRAPH DATA; GRAPH TRAVERSALS; LOW PRIORITIES; PARTIAL ORDER; PATH QUERIES; RELATIONAL DATABASE; TEXT DATA;

OBJECT-ORIENTED DATABASES;

EID: 84937406552     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46439-5_35     Document Type: Conference Paper

References (21)

1. Abiteboul S. Querying Semi-structured Data. In Proc. Int. Conf. on Database Theory (ICDT), pages 1-18, 1997.
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.
3. Abiteboul S., R. Hull, V. Vianu. Foundations of Databases. Addison-Wesley. 1994.
4. Abiteboul S., V. Vianu. Queries and Computation on the Web. In Proc. Int. Conf. on Database Theory (ICDT), pages 262-275, 1997.
5. Abiteboul S., V. Vianu. Regular Path Queries with Constraints. In Proc. Sixteenth Int. Symposium on Database Systems (PODS), pages 122-133, 1997.
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.
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.
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.
9. Carey M., D. Kossmann, On Saying “Enough Already!" in SQL. In Proc. ACM SIGMOD Conf., pages 219-230, 1997.
10. Consens M, Mendelzon A., GraphLog: a visual formalism for real life recursion. In Proc. PODS Conf., pages 404-416, 1990.
11. Christophides V., S Cluet, G Moerkotte, Evaluating Queries with Generalized Path Expressions, in Proc. of the ACM SIGMOD Conf., pages 413-422, 1996.
12. Fernandez M.F., D. Florescu, J. Kang, A. Y. Levy, D. Suciu, STRUDEL: A Website Management System. in Proc. ACM SIGMOD Conf., pages 549-552, 1997.
13. Greco S., D. Saccá, C. Zaniolo. Datalog with choice and stratified negation: from P to Dp. In Proc. 2nd Int. Conf. on Database Theory (ICDT), pages 82-96, 1995.
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.
15. Hopcroft J., J Ullman. Introduction to Automata Theory, Languages and Computation. Addison Wesley, 1980.
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.
17. Mendelzon A., P.T. Wood, Finding Regular Simple Path in Graph Databases, in SIAM Journal on Computing, 24(6), pages 1235-1258, 1995.
18. Mendelzon A., G. Mihaila, T. Milo, Querying the World Wide Web, in Journal of Digital Libraries, pages 54-67, 1997.
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.
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.
21. Yannakakis M., Graph-theoretic methods in database theory, in Proc. of the Ninth Symposium on Principles of Database Systems, pages 230-242, 1990.