Finding equivalent rewritings in the presence of arithmetic comparisons

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

Volumn 3896 LNCS, Issue , 2006, Pages 942-960

  Afrati, Foto ^a   Chirkova, Rada ^b   Gergatsoulis, Manolis ^c   Pavlaki, Vassia ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b North Carolina State University   (United States)

^c IONIAN UNIVERSITY   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ARITHMETIC COMPARISONS (ACS); DATA-MANAGEMENT PROBLEMS; ENUMERATION ALGORITHMS; SQL;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; INFORMATION MANAGEMENT; PROBLEM SOLVING;

QUERY LANGUAGES;

EID: 33745595859     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11687238_55     Document Type: Conference Paper

References (25)

1. F. Afrati, M. Gergatsoulis, and T. Kavalieros. Answering queries using materialized views with disjunctions. In ICDT, pages 435-452, 1999.
2. F. Afrati, C. Li, and P. Mitra. Answering queries using views with arithmetic comparisons. In PODS, pages 209-220, 2002.
3. F. Afrati, C. Li, and P. Mitra. Rewriting queries using views in the presence of arithmetic comparisons. Technical report, UC Irvine, 2002.
4. F. Afrati, C. Li, and P. Mitra. On containment of conjunctive queries with arithmetic comparisons. In EDBT, pages 459-476, 2004.
5. F. Afrati, C. Li, and J. D. Ullman. Generating efficient plans for queries using views. In SIGMOD, pages 319-330, 2001.
6. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In STOC, pages 77-90, 1977.
7. A. Deutsch. XML Query Reformulation over Mixed and Redundant Storage. PhD thesis, University of Pennsylvania, 2002.
8. O. M. Duschka and M. R. Genesereth. Answering recursive queries using views. In PODS, pages 109-116, 1997.
9. G. Grahne and A. O. Mendelzon. Tableau techniques for querying information sources through global schemas. In ICDT, pages 332-347, 1999.
10. A. Gupta, Y. Sagiv, J. D. Ullman, and J. Widom. Constraint checking with partial information. In PODS, pages 45-55, 1994.
11. A. Y. Halevy. Answering queries using views: A survey. VLDB Journal, 10(4):270-294, 2001.
12. A. Klug. On conjunctive queries containing inequalities. Journal of the ACM, 35(1):146-160, 1988.
13. P. G. Kolaitis, D. L. Martin, and M. N. Thakur. On the complexity of the containment problem for conjunctive queries with built-in predicates. In PODS, pages 197-204, 1998.
14. A. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In PODS, pages 95-104, 1995.
15. A. Levy, A. Rajaraman, and J. J. Ordille. Querying heterogeneous information sources using source descriptions. In VLDB, pages 251-262, 1996.
16. A. Levy, A. Rajaraman, and J. Ullman. Answering queries using limited external processors. In PODS, pages 227-234, 1996.
17. A. Levy and Y. Sagiv. Queries independent of updates. In VLDB, pages 171-181, 1993.
18. P. Mitra. An algorithm for answering queries efficiently using views. In Proceedings of the Australasian Database Conference, pages 99-106, 2001.
19. L. Popa. Object/Relational Query Optimization with Chase and Backchase. PhD thesis, University of Pennsylvania, 2000.
20. R. Pottinger and A. Halevy. A scalable algorithm for answering queries using views. VLDB Journal, 10(2-3):182-198, 2001.
21. X. Qian. Query folding. In ICDE, pages 48-55, 1996.
22. Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and difference operators. Journal of the ACM, 27(4):633-655, 1980.
23. L. J. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3:1-22, 1977.
24. R. van der Meyden. The complexity of querying indefinite data about linearly ordered domains. In PODS, pages 331-345, 1992.
25. X. Zhang and M. Z. Ozsoyoglu. On efficient reasoning with implication constraints. In DOOD, pages 236-252, 1993.