Rewriting of regular expressions and regular path queries

Journal of Computer and System Sciences

Volumn 64, Issue 3, 2002, Pages 443-465

  Calvanese, Diego ^a   De Giacomo, Giuseppe ^a   Lenzerini, Maurizio ^a   Vardi, Moshe Y ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b Rice University   (United States)

Author keywords

Computational complexity; Query rewriting; Regular expressions; Regular path queries; Semistructured data

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; DATABASE SYSTEMS; MOTION PLANNING; PROBLEM SOLVING; QUERY LANGUAGES; RECURSIVE FUNCTIONS;

QUERY REWRITING; REGULAR EXPRESSIONS; REGULAR PATH QUERIES; SEMISTRUCTURED DATA;

QUEUEING NETWORKS;

EID: 10644261399     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1805     Document Type: Article

References (46)

1. [Abi97] S. Abiteboul, Querying semi-structured data, in "Proc. of the 6th Int. Conf. on Database Theory (ICDT'97)," pp. 1-18, 1997.
2. [ACPS96] S. Adali, K. S. Candan, Y. Papakonstantinou, and V. S. Subrahmanian, Query caching and optimization in distributed mediator systems, in "Proc. of the ACM SIGMOD Int. Conf. on Management of Data," pp. 137-148, 1996.
3. [AD98] S. Abiteboul and O. Duschka, Complexity of answering queries using materialized views, in "Proc. of the 17th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'98)," pp. 254-265, 1998.
4. [AGK99] F. N. Afrati, M. Gergatsoulis, and T. Kavalieros, Answering queries using materialized views with disjunction, in "Proc. of the 7th Int. Conf. on Database Theory (ICDT'99)," Lecture Notes in Computer Science, Vol. 1540, pp. 435-452. Springer-Verlag, Berlin, 1999.
5. [AQM + 97] S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. L. Wiener, The Lorel query language for semistructured data, Int. J. Digital Libraries 1 (1997), 68-88.
6. [AV97] S. Abiteboul and V. Vianu, Regular path queries with constraints, in "Proc. of the 16th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'97)," pp. 122-133, 1997.
7. [BDFS97] P. Buneman, S. Davidson, M. F. Fernandez, and D. Suciu, Adding structure to unstructured data, in "Proc. of the 6th Int. Conf. on Database Theory (ICDT'97)," pp. 336-350, 1997.
8. [BDHS96] P. Buneman, S. Davidson, G. Hillebrand, and D. Suciu, A query language and optimization technique for unstructured data, in "Proc. of the ACM SIGMOD Int. Conf. on Management of Data," pp. 505-516, 1996.
9. [Ber66] R. Berger, The undecidability of the dominoe problem, Mem. Amer. Math. Soc. 66 (1966), 1-72.
10. [BFW98] P. Buneman, W. Fan, and S. Weinstein, Path constraints on semistructured and structured data, in "Proc. of the 17th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'98)," pp. 129-138, 1998.
11. [BLR97] C. Beeri, A. Y. Levy, and M.-C. Rousset, Rewriting queries using views in description logics, in "Proc. of the 16th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'97)," pp. 99-108, 1997.
12. [Bun97] P. Buneman, Semistructured data, in "Proc. of the 16th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'97)," pp. 117-121, 1997.
13. [CACS94] V. Christophides, S. Abiteboul, S. Cluet, and M. Scholl, From structured documents to novel query facilities, in "Proc. of the ACM SIGMOD Int. Conf. on Management of Data" (R. T. Snodgrass and M. Winslett, Eds.), Minneapolis, MI, pp. 313-324, 1994.
14. [CDGL98] D. Calvanese, G. De Giacomo, and M. Lenzerini, On the decidability of query containment under constraints, in "Proc. of the 17th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'98)," pp. 149-158, 1998.
15. [CDGLV00a] D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi, Answering regular path queries using views, in "Proc. of the 16th IEEE Int. Conf. on Data Engineering (ICDE 2000)," pp. 389-398, 2000.
16. [CDGLV00b] D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi, Containment of conjunctive regular path queries with inverse, in "Proc. of the 7th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'2000)," pp. 176-185, 2000.
17. [CDGLV00c] D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi, Query processing using views for regular path queries with inverse, in "Proc. of the 19th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS 2000)," pp. 58-66, 2000.
18. [CDGLV00d] D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi, View-based query processing and constraint satisfaction, in "Proc. of the 15th IEEE Symp. on Logic in Computer Science (LICS 2000)," pp. 361-371, 2000.
19. [CKPS95] S. Chaudhuri, S. Krishnamurthy, S. Potarnianos, and K. Shim, Optimizing queries with materialized views, in "Proc. of the 11th IEEE Int. Conf. on Data Engineering (ICDE'95)," Taipei (Taiwan), 1995.
20. [CM90] M. P. Consens and A. O. Mendelzon, Graphlog: a visual formalism for real life recursion, in "Proc. of the 9th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'90)," Atlantic City, NJ, pp. 404-416, 1990.
21. [CMW87] I. F. Cruz, A. O. Mendelzon, and P. T. Wood, A graphical query language supporting recursion, in "Proc. of the ACM SIGMOD Int. Conf. on Management of Data," San Francisco, CA, pp. 323-330, 1987.
22. [CNS99] S. Cohen, W. Nutt, and A. Serebrenik, Rewriting aggregate queries using views, in "Proc. of the 18th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'99)," pp. 155-166, 1999.
23. [Con71] J. H. Conway, "Regular Algebra and Finite Machines," Chapman and Hall, London, 1971.
24. [DG97] O. M. Duschka and M. R. Genesereth, Answering recursive queries using views, in "Proc. of the 16th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'97)," pp. 109-116, 1997.
25. [DG98] O. M. Duschka and M. R. Genesereth, Query planning with disjunctive sources, in "Proc. of the AAAI-98 Workshop on AI and Information Integration," AAAI Press/The MIT Press, Cambridge, MA, 1998.
26. [DGL00] O. M. Duschka, M. R. Genesereth, and A. Y. Levy, Recursive query plans for data integration, J. Logic Program. 43 (2000), 49-73.
27. [FFK + 98] M. F. Fernandez, D. Florescu, J. Kang, A. Y. Levy, and D. Suciu, Catching the boat with Strudel: Experiences with a web-site management system, in "Proc. of the ACM SIGMOD Int. Conf. on Management of Data, " pp. 414-425, 1998.
28. [FFLS97] M. F. Fernandez, D. Florescu, A. Y. Levy, and D. Suciu, A query language for a web-site management system, SIGMOD Recorded (1997), 4-11.
29. [FLS98] D. Florescu, A. Levy, and D. Suciu, Query containment for conjunctive queries with regular expressions, in "Proc. of the 17th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'98)," pp. 139-148, 1998.
30. [FS98] M. F. Fernandez and D. Suciu, Optimizing regular path expressions using graph schemas, in "Proc. of the 14th IEEE Int. Conf. on Data Engineering (ICDE'98)," pp. 14-23, 1998.
31. [Ha100] A. Y. Halevy, Theory of answering queries using views, SIGMOD Record 29 (2000), 40-47.
32. [HU79] J. E. Hopcroft and J. D. Ullman, "Introduction to Automata Theory, Languages, and Computation," Addison-Wesley, Reading, MA, 1979.
33. [Jon75] N. D. Jones, Space-bounded reducibility among combinatorial problems, J. of Computer and System Sciences 11 (1975), 68-75.
34. [LMSS95] A. Y. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava, Answering queries using views, in "Proc. of the 14th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'95)," pp. 95-104, 1995.
35. [MMM97] A. Mendelzon, G. A. Mihaila, and T. Milo, Querying the World Wide Web, Int. J. on Digital Libraries 1 (1997), 54-67.
36. [MS99] T. Milo and D. Suciu, Index structures for path expressions, in "Proc. of the 7th Int. Conf. on Database Theory (ICDT'99)," Lecture Notes in Computer Science, Vol. 1540, pp. 277-295, Springer-Verlag, Berlin, 1999.
37. [PV99] Y. Papakonstantinou and V. Vassalos, Query rewriting using semistructured views, in "Proc. of the ACM SIGMOD Int. Conf. on Management of Data," 1999.
38. [QRS + 95] D. Quass, A. Rajaraman, I. Sagiv, J. Ullman, and J. Widom, Querying semistructured heterogeneous information, in "Proc. of the 4th Int. Conf. on Deductive and Object-Oriented Databases (DOOD'95)," pp. 319-344, Springer-Verlag, Berlin, 1995.
39. [RS59] M. O. Rabin and D. Scott, Finite automata and their decision problems, IBM J. Res. Develop. 3 (1959), 115-125.
40. [RSU95] A. Rajaraman, Y. Sagiv, and J. D. Ullman, Answering queries using templates with binding patterns, in "Proc. of the 14th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'95)," 1995.
41. [Sav70] W. J. Savitch, Relationship between nondeterministic and deterministic tape complexities, J. Comp. System Sci. 4 (1970), 177-192.
42. [SDJL96] D. Srivastava, S. Dar, H. V. Jagadish, and A. Levy, Answering queries with aggregation using views, in "Proc. of the 22nd Int. Conf. on Very Large Data Bases (VLDB'96)," pp. 318-329, 1996.
43. [TSI96] O. G. Tsatalos, M. H. Solomon, and Y. E. Ioannidis, The GMAP: A versatile tool for phyisical data independence, Very Large Database J. 5 (1996), 101-118.
44. [Ull97] J. D. Ullman, Information integration using logical views, in "Proc. of the 6th Int. Conf. on Database Theory (ICDT'97)," Lecture Notes in Computer Science, Vol. 1186, pp. 19-40, Springer-Verlag, Berlin, 1997.
45. [vEB82] P. van Emde Boas, Dominoes are forever, in "Proc. of 1st GTI Workshop, Rheie Theoretische Informatik UGH Paderborn," pp. 75-95, Paderborn, Germany, 1982.
46. [vEB97] P. van Emde Boas, The convenience of tilings, in "Complexity, Logic, and Recursion Theory" (A. Sorbi, Ed.), Lecture Notes in Pure and Applied Mathematics, Vol. 187, pp. 331-363, Marcel Dekker, 1997.