Query Containment and Rewriting Using Views for Regular Path Queries under Constraints

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn 22, Issue , 2003, Pages 111-122

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

^a Gina Cody School of Engineering and Computer Science   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DATA STRUCTURES; DATABASE SYSTEMS; DIGITAL LIBRARIES; MATHEMATICAL MODELS; OBJECT ORIENTED PROGRAMMING; PROBLEM SOLVING; XML;

DATA REPOSITORIES; SUBGRAPHS;

QUERY LANGUAGES;

EID: 1142275489     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773153.773165     Document Type: Conference Paper

References (26)

1. S. Abiteboul, P. Buneman and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 1999.
2. S. Abiteboul, V. Vianu. Regular Path Queries with Constraints. Journal of Computing and System Sciences 58(3) 1999, pp. 428-452
3. L. Boasson, M. Nivat. Centers of Languages. Proc. of Theoretical Computer Science, 5th GI-Conference 1981, LNCS 104, pp. 245-251.
4. R. Book, F. Otto String Rewriting Systems. Springer Verlag, 1993.
5. P. Buneman. W. Fan, S. Weinstein. Path Constraints in Semistructured and Structured Databases. Proc. of PODS 1998, pp. 129-138.
6. P. Buneman. W. Fan, S. Weinstein. Query Optimization for Semistructured Data Using Path Constraints in a Deterministic Data Model. Proc. of DBPL 1999, pp. 208-223.
7. D. Calvanese, G. Giacomo, M. Lenzerini and M. Y. Vardi. Rewriting of Regular Expressions and Regular Path Queries. Proc. of PODS 1999, pp. 194-204.
8. D. Calvanese, G. Giacomo, M. Lenzerini and M. Y. Vardi. Answering Regular Path Queries Using Views. Proc. of ICDE 2000, pp. 389-398.
9. D. Calvanese, G. Giacomo, M. Lenzerini and M. Y. Vardi. View-Based Query Processing for Regular Path Queries with Inverse. Proc. of PODS 2000, pp. 58-66.
10. D. Caucal. On the Transition Graphs of Turing Machines. Proc. of Machines, Computations, and Universality, Third Int'l Conf. 2001, pp. 177-189
11. A. Deutsch, V. Tannen. Optimization Properties for Classes of Conjunctive Regular Path Queries. Proc. of DBPL 2001, pp. 21-39.
12. D. Florescu, A. Y. Levy, D. Suciu Query Containment for Conjunctive Queries with Regular Expressions Proc. of PODS 1998, pp. 139-148.
13. G. Grahne and A. O. Mendelzon. Tableau Techniques for Querying Information Sources through Global Schemas. Proc. of ICDT 1999, pp. 332-347.
14. G. Grahne and A. Thomo. An Optimization Technique for Answering Regular Path Queries, Proc. of WebDB 2000, and Lecture Notes in Computer Science 1997, Springer 2001, pp. 215-225.
15. G. Grahne and A. Thomo. Algebraic Rewritings for Optimizing Regular Path Queries. Proc. of ICDT 2001 pp. 301-315.
16. G. Grahne and A. Thomo. New Rewritings and Optimizations for Regular Path Queries. Proc. of ICDT 2003. pp. 242-258.
17. J. E. Hopcroft and J. D. Ullman Introduction to Automata Theory, Languages, and Computation. Addison-Wesley 1979.
18. A. Y. Levy. Answering queries using views: a survey. Technical Report, Comp. Sci. Dept., Washington Univ., 2000.
19. A. Y. Levy, A. O. Mendelzon, Y. Sagiv, D. Srivastava. Answering Queries Using Views. Proc. of PODS 1995, pp. 95-104.
20. A. O. Mendelzon and P. T. Wood, Finding Regular Simple Paths in Graph Databases. SIAM J. Comp. 24:6, (December 1995).
21. A. O. Mendelzon, G. A. Mihaila and T. Milo. Querying the World Wide Web. Int. J. on Digital Libraries 1(1), 1997 pp. 54-67.
22. T. Milo and D. Suciu. Index Structures for Path Expressions. Proc. of ICDT, 1999, pp. 277-295.
23. Y. Papakonstantinou, V. Vassalos. Query Rewriting for Semistructured Data. proc. of SIGMOD 1999, pp. 455-466
24. G. Senizergues. Some Decision Problems about Controlled Rewriting Systems. Theoretical Computer Science 71(3), 1990, pp. 281-346
25. M. Sipser. Introduction to the Theory of Computation PWS Pub. Co., 1996.
26. S. Yu, Regular Languages. In: Handbook of Formal Languages. G. Rozenberg and A. Salomaa (Eds.). Springer Verlag 1997, pp. 41-110