Querying data sources that export infinite sets of views

ACM International Conference Proceeding Series

Volumn 361, Issue , 2009, Pages 84-97

  Cautis, Bogdan ^a   Deutsch, Alin ^b   Onose, Nicola ^b  

^a TELECOM PARISTECH   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUNCTIVE QUERIES; DATA SOURCE; DATALOG PROGRAMS; EXPRESSIBILITY; FINITE SET; INTEGRITY CONSTRAINTS;

SET THEORY;

EID: 70349155860     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1514894.1514905     Document Type: Conference Paper

References (23)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. F. N. Afrati, R. Chirkova, M. Gergatsoulis, and V. Pavlaki. Finding equivalent rewritings in the presence of arithmetic comparisons. In EDBT, pages 942-960, 2006.
3. F. N. Afrati, C. Li, and P. Mitra. Answering queries using views with arithmetic comparisons. In PODS, 2002.
4. B. Cautis, A. Deutsch, and N. Onose. Querying data sources that export infinite sets of views. Technical Report CS2007-0886, UCSD, 2007. Available at http://db.ucsd.edu/index.jsp?pageStr=publications.
5. S. Cohen, W. Nutt, and Y. Sagiv. Rewriting queries with arbitrary aggregation functions using views. ACM Trans. Database Syst. (TODS), 31(2):672-715, 2006.
6. S. Cosmadakis, H. Gaifman, P. Kanellakis, and M. Vardi. Decidable optimization problems for database logic programs. In STOC, pages 477-490, New York, NY, USA, 1988. ACM Press.
7. A. Deutsch, B. Ludaescher, and A. Nash. Rewriting queries using views with access patterns under integrity constraints. In ICDT, 2005.
8. A. Deutsch, L. Popa, and V. Tannen. Query reformulation with constraints. SIGMOD Record, 35(1):65-73, 2006.
9. A. Deutsch and V. Tannen. Reformulation of XML queries and constraints. In ICDT, 2003.
10. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. In ICDT, 2003.
11. D. Florescu, A. Y. Levy, I. Manolescu, and D. Suciu. Query optimization in the presence of limited access patterns. In SIGMOD, pages 311-322, 1999.
12. H. Gaifman, H. G. Mairson, Y. Sagiv, and M. Y. Vardi. Undecidable optimization problems for database logic programs. Journal of the ACM (JACM), 40(3):683-713, 1993.
13. A. Y. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In PODS, pages 95-104, 1995.
14. A. Y. Levy, A. Rajaraman, and J. D. Ullman. Answering queries using limited external processors. In PODS, pages 227-237, 1996.
15. A. Y. Levy, A. Rajaraman, and J. D. Ullman. Answering queries using limited external query processors. J. Comput. Syst. Sci., 58(1):69-82, 1999.
16. C. Li and E. Y. Chang. Query planning with limited source capabilities. In ICDE, pages 401-412, 2000.
17. A. Maier, A. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. In PODS, 1979.
18. A. Motro. An access authorization model for relational databases based on algebraic manipulation of view definitions. In ICDE, pages 339-347. IEEE Computer Society, 1989.
19. A. Nash and B. Ludäscher. Processing first-order queries under limited access patterns. In PODS, 2004.
20. Y. Papakonstantinou, A. Gupta, H. Garcia-Molina, and J. D. Ullman. A query translation scheme for rapid implementation of wrappers. In DOOD, pages 161-186, 1995.
21. S. Rizvi, A. O. Mendelzon, S. Sudarshan, and P. Roy. Extending query rewriting techniques for fine-grained access control. In SIGMOD, pages 551-562, 2004.
22. V. Vassalos and Y. Papakonstantinou. Describing and using query capabilities of heterogeneous sources. In VLDB, pages 256-265, 1997.
23. V. Vassalos and Y. Papakonstantinou. Expressive capabilities description languages and query rewriting algorithms. J. Log. Program., 43(1):75-122, 2000.