Views and queries: Determinacy and rewriting

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

Volumn , Issue , 2005, Pages 49-60

  Segoufin, Luc ^a   Vianu, Victor ^b  

^a INRIA   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUNCTIVE QUERIES; REWRITING LANGUAGE;

INFORMATION THEORY;

QUERY LANGUAGES;

EID: 33244493126     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065167.1065174     Document Type: Conference Paper

References (27)

1. S. Abiteboul and O. Duschka. Complexity of answering queries using materialized views. PODS 1998, 254-263.
2. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison Wesley, 1995.
3. F. Afrati, C. Li, and P. Mitra. Answering queries using views with arithmetic comparisons. PODS 2002, 209-220.
4. S. Agrawal, S. Chaudhuri, and V. Narasayya. Automated selection of materialized views and indexes in Microsoft SQL Server. VLDB 2000, 496-505.
5. Egon Börger, Erich Gräel, and Yuri Gurevich. The Classical Decision Problem. Springer, 1997.
6. D. Calvanese, G. De Giacomo, M. Lenzerini, and M.Y. Vardi. Rewriting of regular expressions and regular path queries. PODS 1999, 194-204.
7. D. Calvanese, G. De Giacomo, M. Lenzerini, and M.Y. Vardi. View-based query processing for regular path queries with inverse. PODS 2000, 58-66.
8. D. Calvanese, G. De Giacomo, M. Lenzerini, and M.Y. Vardi. Lossless regular views. PODS 2002, 247-258.
9. A.K. Chandra and P.M. Merlin. Optimal implementation of conjunctive queries in relational databases. STOC 1977, 77-90.
10. C. C. Chang and H. J. Keisler. Model Theory. North-Holland, 1977.
11. C. Chekuri and A. Rajaraman. Conjunctive query containment revisited. ICDT 1997, 56-70.
12. S. Dar, M.J. Franklin, B. Jonsson, D. Srivastava and M. Tan. Semantic data caching and replacement. VLDB 1996, 330-341.
13. A. Deutsch, L. Popa, and V. Tannen. Physical data independence, constraints and optimization with universal plans. VLDB 1999, 459-470.
14. O. Duschka and M.R. Genesereth. Answering recursive queries using views. PODS 1997, 109-116.
15. H-D Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.
16. S. Grumbach, Z. Lacroix, and S. Lindell. Generalized implicit definitions on finite structures. In Computer Science Logic, 1995, 252-265.
17. S. Grumbach, M. Rafanelli, and L. Tininini. Querying aggregate data. PODS 1999, 174-184.
18. S. Grumbach and L. Tininini. On the content of materialized aggregate views. PODS 2000, 47-57.
19. Yuri Gurevich. The word problem for some classes of semigroups. Algebra and Logic, 5(4):25-35, 1966. (Russian).
20. Leonid Libkin. Elements of finite model theory. Springer, 2004.
21. S. Lindell. The Logical Complexity of Queries on Unordered Graphs. PhD thesis, University of California at Los Angeles, 1987.
22. Alon Y. Levy, Alberto O. Mendelzon, Yehoshua Sagiv, and Divesh Srivastava. Answering queries using views. PODS 1995, 95-104.
23. Emil L. Post. Recursive unsolvability of a problem of Thue. Journal on Symbolic Logic, 12(1):1-11, 1947.
24. A. Rajaraman, Y. Sagiv, and J.D. Ullman. Answering queries using templates with binding patterns. PODS 1995, 105-112.
25. O.G. Tsatalos, M.H. Solomon and Y.E. Ioannidis. Describing and using query capabilities of heterogeneous sources. VLDB 1997, 256-265.
26. J.D. Ullman. Information integration using logical views. ICDT 1997, 19-40.
27. H.Z. Yang and P.A. LArson. Query transformation for PSJ-queries. VLDB 1987, 245-254.