Graph grammars for querying graph-like data

Electronic Notes in Theoretical Computer Science

Volumn 50, Issue 3, 2001, Pages 247-256

  Flesca, S ^a   Furfaro, F ^a   Greco, S ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; DATABASE SYSTEMS; JAVA PROGRAMMING LANGUAGE; MATHEMATICAL MODELS; OBJECT ORIENTED PROGRAMMING; XML;

ABSTRACT MODEL; GRAPH GRAMMAR; GRAPH QUERIES; PATH QUERIES;

GRAPH THEORY;

EID: 19344372785     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00176-8     Document Type: Conference Paper

References (24)

1. Abiteboul, S. Semistructured Data. Proc. Int. Conf. on Database Theory, 1997.
2. Abiteboul S., Buneman P., Suciu D. Data on the Web: From Relations to Semistructured Data and XML. 1999;Morgan Kauffman
3. Abiteboul S., Hull R., Vianu V. Foundations of Databases. 1994;Addison-Wesley
4. Abiteboul S., Vianu V. Regular Path Queries with Constraints. In Proc. PODS, pages 122-133, 1997.
5. Abiteboul S., Quass D., McHugh J., Widom J., Wiener J.L. The Lorel Query Language for Semistructured Data. Journal of Digital Libraries. 1:(1):1997;68-88
6. Buneman P. Semistructured Data. Proc. PODS. 1997.
7. Buneman P., Fan W., Weinstein S. Path Constraints in Semistructured and Structured Databases. In Proc. PODS, pages 129-138, 1998.
8. Ceri S., Comai S., Damiani E., Fraternali P., Paraboschi S., Tanca L. XML-GL: A Graphical Language for Querying and Restructuring XML Documents. Computer Networks. 31:(11-16):1999;1171-1187
9. Christophides V., S. Cluet, G. Moerkotte, Evaluating Queries with Generalized Path Expressions, in Proc. of the ACM SIGMOD Conf., pages 413-422, 1996.
10. Consens M, Mendelzon A., GraphLog: a Visual Formalism for Real Life Recursion. Proc. Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 404-416, 1990.
11. +: Recursive Queries Without Recursion. Proc. 2nd Int. Conf. on Expert Database Systems, pages 355-368, 1988.
12. Engelfriet J. Context-Free Graph Grammars. Rozenberg G., Salomaa A. Handbook of Formal Languages, Volume 3: Beyond Words. 1997;125-213 Springer-Verlag
13. 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.
14. Flesca, S, and Greco, S. Querying Graph Databases. Proc. Int. Conf. on Extending Database Technology (EDBT) 2000, pp. 510-524.
15. Flesca S., and Greco S. Partially Ordered Regular Languages for Graph Queries. Proc. Int. Colloquium on Automata, Languages and Programming (ICALP) 1999, pp. 321-330.
16. Grahne G., Thomo A. An Optimization Technique for Answering Regular Path Queries. In Proc. of the Third International Workshop on the Web and Databases (WebDB), pp. 99-104, 2000.
17. Immerman N. Descriprive Complexity. 1999;Springer-Verlag
18. Kifer M., W. Kim, Y. Sagiv, Querying Object-Oriented Databases, Proc. ACM-SIGMOD International Conference on Management of Data, pages 393-402, 1992.
19. 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.
20. Lakshmanan L., F. Sadri, I. Subramanian, A declarative language for querying and restructuring the web, Proc. 6th Int. Work. on Research Issues in Data Engineering, RIDE'96, 1996.
21. Mecca G., Atzeni P., Masci A., Merialdo P. and Sindoni G. The Araneus Web-Base Management System. In Proc. of SIGMOD Conference, pp. 544-546, 1998.
22. Mendelzon A., Mihaila G., Milo T. Querying the World Wide Web. Journal of Digital Libraries. 1997
23. Mendelzon A., Wood P. Finding Regular Simple Paths in Graph Databases. SIAM Journal on Computing. 24:(6):1995;1235-1258
24. Yannakakis M., Graph-theoretic methods in database theory, In Proc. Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 230-242, 1990.