View-based query answering and query containment over semistructured data

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

Volumn 2397, Issue , 2002, Pages 40-61

  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

[No Author keywords available]

Indexed keywords

FORESTRY; INVERSE PROBLEMS; QUERY LANGUAGES;

CERTAIN ANSWERS; INVERSE OPERATORS; QUERY CONTAINMENT; QUERYING MECHANISMS; REGULAR EXPRESSIONS; REGULAR PATH QUERIES; SEMI STRUCTURED DATA; TWO-WAY AUTOMATA;

QUERY PROCESSING;

EID: 84943621119     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46093-4_3     Document Type: Conference Paper

References (58)

1. S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: from Relations to Semistructured Data and XML. Morgan Kaufmann, Los Altos, 2000.
2. S. Abiteboul and O. Duschka. Complexity of answering queries using materialized views. In Proc. Of PODS’98, pages 254–265, 1998.
3. S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. L. Wiener. The Lorel query language for semistructured data. Int. J. on Digital Libraries, 1(1):68–88, 1997.
4. F. N. Afrati, M. Gergatsoulis, and T. Kavalieros. Answering queries using materialized views with disjunction. In Proc. Of ICDT’99, volume 1540 of LNCS, pages 435–452. Springer, 1999.
5. A. V. Aho, Y. Sagiv, and J. D. Ullman. Equivalence among relational expressions. SIAM J. on Computing, 8:218–246, 1979.
6. D. Barbara and T. Imielinski. Sleepers and workaholics: Caching strategies in mobile environments. In Proc. Of ACM SIGMOD, pages 1–12, 1994.
7. C. Beeri, A. Y. Levy, and M.-C. Rousset. Rewriting queries using views in description logics. In Proc. Of PODS’97, pages 99–108, 1997.
8. J.-C. Birget. State-complexity of finite-state devices, state compressibility and incompressibility. Mathematical Systems Theory, 26(3):237–269, 1993.
9. J. A. Brzozowski and E. Leiss. Finite automata and sequential networks. Theor. Comp. Sci., 10:19–35, 1980.
10. P. Buneman. Semistructured data. In Proc. Of PODS’97, pages 117–121, 1997.
11. P. Buneman, S. Davidson, G. Hillebrand, and D. Suciu. A query language and optimization technique for unstructured data. In Proc. Of ACM SIGMOD, pages 505–516, 1996.
12. D. Calvanese, G. De Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In Proc. Of PODS’98, pages 149–158, 1998.
13. D. Calvanese, G. De Giacomo, and M. Lenzerini. Answering queries using views over description logics knowledge bases. In Proc. Of AAAI 2000, pages 386–391, 2000.
14. D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi. Rewriting of regular expressions and regular path queries. In Proc. Of PODS’99, pages 194–204, 1999.
15. D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi. Answering regular path queries using views. In Proc. Of ICDE 2000, pages 389–398, 2000.
16. D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi. Containment of conjunctive regular path queries with inverse. In Proc. Of KR 2000, pages 176–185, 2000.
17. D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi. Query processing using views for regular path queries with inverse. In Proc. Of PODS 2000, pages 58–66, 2000.
18. D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi. View-based query processing and constraint satisfaction. In Proc. Of LICS 2000, pages 361–371, 2000.
19. D. Chamberlin, D. Florescu, J. Robie, J. Simeon, and M. Stefanescu. XQuery: A query language for XML. W3C Working Draft, Feb. 2001. Available at http://www.w3.org/TR/xquery.
20. E. P. F. Chan. Containment and minimization of positive conjunctive queries in oodb’s. In Proc. Of PODS’92, pages 202–211, 1992.
21. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. J. Of the ACM, 28(1):114–133, 1981.
22. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proc. Of STOC’77, pages 77–90, 1977.
23. S. Chaudhuri, S. Krishnamurthy, S. Potarnianos, and K. Shim. Optimizing queries with materialized views. In Proc. Of ICDE’95, Taipei (Taiwan), 1995.
24. S. Chaudhuri and M. Y. Vardi. On the equivalence of recursive and nonrecursive Datalog programs. In Proc. Of PODS’92, pages 55–66, 1992.
25. C. Chekuri and A. Rajaraman. Conjunctive query containment revisited. In Proc. Of ICDT’97, pages 56–70, 1997.
26. J. Clark and S. DeRose. XML Path Language (XPath) version 1.0 – W3C recommendation 16 november 1999. Technical report, World Wide Web Consortium, 1999. Available at http://www.w3.org/TR/1999/REC-xpath-19991116.
27. S. Cohen, W. Nutt, and A. Serebrenik. Rewriting aggregate queries using views. In Proc. Of PODS’99, pages 155–166, 1999.
28. A. C. K. David S. Johnson. Testing containment of conjunctive queries under functional and inclusion dependencies. J. of Computer and System Sciences, 28(1):167–189, 1984.
29. A. Deutsch, M. F. Fernandez, D. Florescu, A. Levy, and D. Suciu. XML-QL: A query language for XML. Submission to the World Wide Web Consortium, Aug. 1998. Available at http://www.w3.org/TR/NOTE-xml-ql.
30. A. Deutsch and V. Tannen. Optimization properties for classes of conjunctive regular path queries. In Proc. Of DBPL 2001, 2001.
31. O. M. Duschka and M. R. Genesereth. Answering recursive queries using views. In Proc. Of PODS’97, pages 109–116, 1997.
32. 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 ACM SIGMOD, pages 414–425, 1998.
33. D. Florescu, A. Levy, and D. Suciu. Query containment for conjunctive queries with regular expressions. In Proc. Of PODS’98, pages 139–148, 1998.
34. G. Grahne and A. O. Mendelzon. Tableau techniques for querying information sources through global schemas. In Proc. Of ICDT’99, volume 1540 of LNCS, pages 332–347. Springer, 1999.
35. S. Grumbach, M. Rafanelli, and L. Tininini. Querying aggregate data. In Proc. Of PODS’99, pages 174–184, 1999.
36. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison Wesley Publ. Co., Reading, Massachussetts, 1979.
37. A. C. Klug. On conjunctive queries containing inequalities. J. of the ACM, 35(1):146–160, 1988.
38. O. Kupferman, N. Piterman, and M. Y. Vardi. Extended temporal logic revisited. In Proc. Of CONCUR 2001, volume 2154 of LNCS, pages 519–535. Springer, 2001.
39. R. E. Ladner, R. J. Lipton, and L. J. Stockmeyer. Alternating pushdown and stack automata. SIAM J. on Computing, 13(1):135–155, 1984.
40. A. Y. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In Proc. Of PODS’95, pages 95–104, 1995.
41. A. Y. Levy and M.-C. Rousset. Combining Horn rules and description logics in CARIN. Artificial Intelligence, 104(1–2):165–209, 1998.
42. A. Y. Levy and D. Suciu. Deciding containment for queries with complex objects. In Proc. Of PODS’97, pages 20–31, 1997.
43. J. McHugh and J. Widom. Optimizing branching path expressions. Technical report, Stanford University, 1999. Available at http://www-db.stanford.edu\penalty-\@M/pub/papers/mp.ps.
44. T. Milo and D. Suciu. Index structures for path expressions. In Proc. Of ICDT’99, volume 1540 of LNCS, pages 277–295. Springer, 1999.
45. Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In Proc. Of PODS 2000, pages 35–46, 2000.
46. A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In Proc. Of PODS’95, 1995.
47. Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and difference operators. J. of the ACM, 27(4):633–655, 1980.
48. H. Seidl. Deciding equivalence of finite tree automata. SIAM J. On Computing, 19(3):424–437, 1990.
49. O. Shmueli. Equivalence of Datalog queries is undecidable. J. Of Logic Programming, 15(3):231–241, 1993.
50. D. Srivastava, S. Dar, H. V. Jagadish, and A. Levy. Answering queries with aggregation using views. In Proc. of VLDB’96, pages 318–329, 1996.
51. O. G. Tsatalos, M. H. Solomon, and Y. E. Ioannidis. The GMAP: A versatile tool for phyisical data independence. VLDB Journal, 5(2):101–118, 1996.
52. J. D. Ullman. Information integration using logical views. In Proc. Of ICDT’97, volume 1186 of LNCS, pages 19–40. Springer, 1997.
53. R. van der Meyden. The Complexity of Querying Indefinite Information. PhD thesis, Rutgers University, 1992.
54. M. Y. Vardi. A note on the reduction of two-way automata to one-way automata. Information Processing Letters, 30(5):261–264, 1989.
55. V. Vianu. A web odyssey: From Codd to XML. In Proc. Of PODS 2001, 2001. Invited talk.
56. J. Widom (ed.). Special issue on materialized views and data warehousing. IEEE Bull. on Data Engineering, 18(2), 1995.
57. J. Widom (ed.). Special issue on materialized views and data warehousing. IEEE Bull. on Data Engineering, 22(3), 1999.
58. M. Yannakakis. Algorithms for acyclic database schemes. In Proc. Of VLDB’81, pages 82–94, 1981.