Rewriting queries using views in the presence of arithmetic comparisons

Theoretical Computer Science

Volumn 368, Issue 1-2, 2006, Pages 88-123

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

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b Irvine   (United States)

^c PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Databases; Query languages; Query rewriting

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTER PROGRAMMING; DATABASE SYSTEMS; PROBLEM SOLVING;

ARITHMETIC COMPARISONS; QUERY CONTAINMENT; QUERY REWRITING;

QUERY LANGUAGES;

EID: 33750731959     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.08.020     Document Type: Article

References (40)

1. Abiteboul S., and Duschka O.M. Complexity of answering queries using materialized views. PODS (1998) 254-263
2. Afrati F., Chirkova R., Gergatsoulis M., and Pavlaki V. Finding equivalent rewritings in the presence of arithmetic comparisons. EDBT (2006)
3. Afrati F.N., Gergatsoulis M., and Kavalieros T.G. Answering queries using materialized views with disjunctions. ICDT (1999) 435-452
4. Afrati F., Li C., and Mitra P. Answering queries using views with arithmetic comparisons. PODS (2002)
5. Afrati F., Li C., and Mitra P. On containment of conjunctive queries with arithmetic comparisons. EDBT (2004)
6. Afrati F., Li C., and Ullman J.D. Generating efficient plans using views. SIGMOD (2001) 319-330
7. Bayardo Jr. R.J., et al. Infosleuth: semantic integration of information in open and dynamic environments (experience paper). SIGMOD (1997) 195-206
8. Beeri C., Levy A.Y., and Rousset M.-C. Rewriting queries using views in description logics. PODS (July-August 1997), ACM Press, New York 99-108
9. Calvanese D., De Giacomo G., and Lenzerini M. Answering queries using views over description logics knowledge bases. PODS (2000) 386-391
10. Chandra A.K., Lewis H.R., and Makowsky J.A. Embedded implication dependencies and their inference problem. STOC (1981) 342-354
11. Chandra A.K., and Merlin P.M. Optimal implementation of conjunctive queries in relational data bases. STOC (1977) 77-90
12. Chaudhuri S., Krishnamurthy R., Potamianos S., and Shim K. Optimizing queries with materialized views. ICDE (1995) 190-200
13. Chaudhuri S., and Vardi M.Y. On the equivalence of recursive and nonrecursive datalog programs. PODS (1992) 55-66
14. Chawathe S.S., et al. The TSIMMIS project: integration of heterogeneous information sources. IPSJ (1994) 7-18
15. JC. Chekuri, A. Rajaraman, Conjunctive query containment revisited, in: F.N. Afrati, Ph.G. Kolaitis (Eds.), ICDT, Lecture Notes in Computer Science, Vol. 1186, Springer, Berlin, 1997, pp. 56-70.
16. Cosmadakis S.S., and Kanellakis P. Parallel evaluation of recursive queries. PODS (1986) 280-293
17. O.M. Duschka, Query planning and optimization in information integration, Ph.D. Thesis, Computer Science Department, Stanford University, 1997.
18. Duschka O.M., and Genesereth M.R. Answering recursive queries using views. PODS (1997) 109-116
19. Florescu D., Levy A., Suciu D., and Yagoub K. Optimization of run-time management of data intensive web-sites. Proc. of VLDB (1999) 627-638
20. Gupta A., Sagiv Y., Ullman J.D., and Widom J. Constraint checking with partial information. PODS (1994) 45-55
21. Grahne G., and Mendelzon A.O. Tableau techniques for querying information sources through global schemas. ICDT (1999) 332-347
22. Haas L.M., Kossmann D., Wimmers E.L., and Yang J. Optimizing queries across diverse data sources. Proc. of VLDB (1997) 276-285
23. Ives Z., Florescu D., Friedman M., Levy A., and Weld D. An adaptive query execution engine for data integration. SIGMOD (1999) 299-310
24. Klug A. On conjunctive queries containing inequalities. J. ACM 35 1 (1988) 146-160
25. Kolaitis P.G., Martin D.L., and Thakur M.N. On the complexity of the containment problem for conjunctive queries with built-in predicates. PODS (1998) 197-204
26. A. Levy, Answering queries using views: a survey, Technical Report, Computer Science Department, Washington University, 2000.
27. Levy A., Mendelzon A.O., Sagiv Y., and Srivastava D. Answering queries using views. PODS (1995) 95-104
28. Levy A., Rajaraman A., and Ordille J.J. Querying heterogeneous information sources using source descriptions. Proc. of VLDB (1996) 251-262
29. Levy A., and Sagiv Y. Queries independent of updates. Proc. of VLDB (1993) 171181
30. P. Mitra, An algorithm for answering queries efficiently using views, in: Proc. of the Australasian Database Conf., 2001.
31. Pottinger R., and Levy A. A scalable algorithm for answering queries using views. Proc. of VLDB (2000)
32. X. Qian, Query folding, in: 12th Internat. Conf. on Data Engineering, 1996.
33. Y. Sagiv, Optimizing datalog programs, Foundations of Deductive Databases and Logic Programming, 1988, pp. 659-698.
34. Y. Saraiya, Subtree elimination algorithms in deductive databases, Ph.D. Thesis, Computer Science Department, Stanford University, 1991.
35. Theodoratos D., and Sellis T. Data warehouse configuration. Proc. of VLDB (1997)
36. J.D. Ullman, Principles of Database and Knowledge-base Systems, Vol. II: The New Technologies, Computer Science Press, New York, 1989.
37. Ullman J.D. Information integration using logical views. ICDT (1997) 19-40
38. van der Meyden R. The complexity of querying indefinite data about linearly ordered domains. PODS (1992)
39. van der Meyden R. The complexity of querying infinite data about linearly ordered domains. J. Comput. System Sci. 54 1 (1997) 113-135
40. X. Zhang, Z.M. Ozsoyoglu, Some results on the containment and minimization of (in) equality queries, Inform. Process. Lett. (1994).