Algebraic rewritings for optimizing regular path queries

Theoretical Computer Science

Volumn 296, Issue 3, 2003, Pages 453-471

  Grahne, Gösta ^a   Thomo, Alex ^a  

^a Dept of Electrical and Computer Engineering   (Canada)

Author keywords

Automata; Cached views; Query optimization; Query rewriting; Regular path queries; Semistructured data; Transducers

Indexed keywords

ALGEBRA; ALGORITHMS; DATA WAREHOUSES; OPTIMIZATION; RELATIONAL DATABASE SYSTEMS;

ALGEBRAIC REWRITINGS;

QUERY LANGUAGES;

EID: 0037436785     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00739-9     Document Type: Article

References (29)

1. S. Abiteboul, Querying semistructured data, Proc. Internat. Conf. on Database Theory (ICDT), Delpli, Greece, 1997, pp. 1-18.
2. Abiteboul S., Buneman P., Suciu D. Data on the Web. From Relations to Semistructured Data and Xml:1999;Morgan Kaufmann, San Francisco.
3. S. Abiteboul, O.M. Duschka, Complexity of answering queries using materialized views, Proc. 17th ACM Symp. on Principles of Database Systems (PODS), Seattle, WA, 1998, pp. 254-263.
4. Abiteboul S., Hull R., Vianu V. Foundations of Databases. 1995;Addison-Wesley, Boston.
5. Abiteboul S., Quass D., McHugh J., Widom J., Wiener J.L. The lorel query language for semistructured data. Internat. J. Digital Libraries. 1(1):1997;68-88.
6. P. Buneman, Semistructured data, Proc. 16th ACM Symp. on Principles of Database Systems (PODS), Tucson, AZ, 1997, pp. 117-121.
7. P. Buneman, S.B. Davidson, M.F. Fernandez, D. Suciu, Adding structure to unstructured data. Proc. Internat. Conf. on Database Theory (ICDT), Delpli, Greece, 1997, pp. 336-350.
8. D. Calvanese, G. Giacomo, M. Lenzerini, M.Y. Vardi, Rewriting of regular expressions and regular path queries. Proc. 18th ACM Symp. on Principles of Database Systems (PODS), Philadelphia, PA, 1999, pp. 194-204.
9. D. Calvanese, G. Giacomo, M. Lenzerini, M.Y. Vardi, Answering regular path queries using views. Proc. Internat. Conf. on Data Engineering (ICDE), San Diego, CA, 2000, pp. 389-398.
10. D. Calvanese, G. Giacomo, M. Lenzerini, M.Y. Vardi, View-based query processing for regular path queries with inverse, Proc. 19th ACM Symp. on Principles of Database Systems (PODS), Dallas, TX, 2000, pp. 58-66.
11. Conway J.H. Regular Algebra and Finite Machines. 1971;Chapman & Hall, London.
12. Deutsch A., Fernandez M.F., Florescu D., Levy A.Y., Suciu D. A query language for XML. WWW8/Comput. Networks. 31(11-16):1999;1155-1169.
13. O. Duschka, M.R. Genesereth, Answering recursive queries using views, Proc. 16th ACM Symp. on Principles of Database Systems (PODS), Tucson, AZ, 1997, pp. 109-116.
14. M.F. Fernandez, D. Suciu, Optimizing regular path expressions using graph schemas, Proc. Internat. Conf. on Data Engineering (ICDE), Orlando, FL, 1998, pp. 14-23.
15. D. Florescu, A.Y. Levy, D. Suciu, Query containment for conjunctive queries with regular expressions, Proc. 17th ACM Symp. on Principles of Database Systems (PODS), Seattle, WA, 1998, pp. 139-148.
16. G. Grahne, A.O. Mendelzon, Tableau techniques for querying information sources through global schemas, Proc. Internat. Conf. on Database Theory (ICDT), Jerusalem, Israel, 1999, pp. 332-347.
17. G. Grahne, A. Thomo, An optimization technique for answering regular path queries, Proc. WebDB, Dallas, TX, 2000.
18. Hopcroft J.E., Ullman J.D. Introduction to Automata Theory, Languages, and Computation. 1979;Addison-Wesley, Boston.
19. Hunt H.B., Rosenkrantz D.J., Szymanski T.G. On the equivalence, containment, and covering problems for the regular and context-free languages. J. Comput. System Sci. 12(2):1976;222-268.
20. L. Kari, On Insertion and deletion in formal languages, Ph.D. Thesis, 1991, Department of Mathematics, University of Turku, Finland.
21. Levy A.Y. Answering queries using views. a survey SIGMOD Record. 29(4):2000;40-47.
22. A.Y. Levy, A.O. Mendelzon, Y. Sagiv, D. Srivastava, Answering queries using views, Proc. 14th ACM Symp. on Principles of Database Systems (PODS), San Jose, CA, 1995, pp. 95-104.
23. Mendelzon A.O., Mihaila G.A., Milo T. Querying the world wide web. Internat. J. Digital Libraries. 1(1):1997;54-67.
24. Mendelzon A.O., Wood P.T. Finding regular simple paths in graph databases. SIAM J. Comput. 246:1995;1235-1258.
25. T. Milo, D. Suciu, Index structures for path expressions, Proc. Internat. Conf. on Database Theory (ICDT), Jerusalem, Israel, 1999, pp. 277-295.
26. S. Nestorov, J.D. Ullman, J.L. Wiener, S.S. Chawathe, Representative objects: concise representations of semistructured, Hierarchical Data. Proc. Internat. Conf. on Data Engineering (ICDE), Birmingham, UK, 1997, pp. 79-90.
27. Y. Papakonstantinou, V. Vassalos, Query rewriting for semistructured data, Proc. SIGMOD, Philadelphia, PA, 1999, pp. 455-466.
28. Sipser M. Introduction to the Theory of Computation. 1996;PWS Pub. Co. Boston, MA.
29. J.D. Ullman, Information integration ising logical views, Proc. Internat. Conf. on Database Theory (ICDT) 1997, pp. 19-40.