On containment of conjunctive queries with arithmetic comparisons

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

Volumn 2992, Issue , 2004, Pages 459-476

  Afrati, Foto ^a   Li, Chen ^b   Mitra, Prasenjit ^c  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MAPPING;

ANSWERING QUERIES; CONJUNCTIVE QUERIES; CONTAINMENT MAPPING; DATABASE APPLICATIONS; DOMAIN KNOWLEDGE; FOLLOWING PROBLEM; LOGICAL IMPLICATIONS; PROBLEM COMPLEXITY;

QUERY LANGUAGES;

EID: 35048867454     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24741-8_27     Document Type: Article

References (19)

1. Chaudhuri, S., Krishnamurthy, R., Potamianos, S., Shim, K.: Optimizing queries with materialized views. In: ICDE. (1995) 190-200
2. Theodoratos, D., Sellis, T.: Data warehouse configuration. In: Proc. of VLDB. (1997)
3. Ullman, J.D.: Information integration using logical views. In: ICDT. (1997) 19-40
4. Halevy, A.: Answering queries using views: A survey. In: Very Large Database Journal. (2001)
5. Gupta, A., Sagiv, Y., Ullman, J.D., Widom, J.: Constraint checking with partial information. In: PODS. (1994) 45-55
6. Klug, A.: On conjunctive queries containing inequalities. Journal of the ACM 35 (1988) 146-160
7. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. STOC (1977) 77-90
8. van der Meyden, R.: The complexity of querying indefinite data about linearly ordered domains. In: PODS. (1992)
9. Levy, A., Mendelzon, A.O., Sagiv, Y., Srivastava, D.: Answering queries using views. In: PODS. (1995) 95-104
10. Afrati, F., Li, G., Mitra, P.: Answering queries using views with arithmetic comparisons. In: PODS. (2002)
11. Afrati, F., Li, C., Mitra, P.: On containment of conjunctive queries with arithmetic comparisons (extended version). Technical report, UC Irvine (2003)
12. Saraiya, Y.: Subtree elimination algorithms in deductive databases. Ph.D. Thesis, Computer Science Dept., Stanford Univ. (1991)
13. Qian, X.: Query folding. In: ICDE. (1996) 48-55
14. Kolaitis, P.G., Martin, D.L., Thakur, M.N.: On the complexity of the containment problem for conjunctive queries with built-in predicates. In: PODS. (1998) 197-204
15. Chandra, A., Lewis, H., Makowsky, J.: Embedded implication dependencies and their inference problem. In: STOC. (1981) 342-354
16. Cosmadakis, S.S., Kanellakis, P.: Parallel evaluation of recursive queries. In: PODS. (1986) 280-293
17. Chaudhuri, S., Vardi, M.Y.: On the equivalence of recursive and nonrecursive datalog programs. In: PODS. (1992) 55-66
18. Shmueli, O.: Equivalence of datalog queries is undecidable. Journal of Logic Programming 15 (1993) 231-241
19. Wang, J., Maher, M., Toper, R.: Rewriting general conjunctive queries using views. In: 13th Australasian Database Conf. (ADC), Melbourne, Australia, ACS (2002) 2u. TPC-H: http://www.tpc.org/tpch/ (2003)