A logic-based approach to data integration

Theory and Practice of Logic Programming

Volumn 2, Issue 3, 2002, Pages 323-368

  Grant, John ^a   Minker, Jack ^b  

^a TOWSON UNIVERSITY   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Clark completion; Data integration; Materialized views; Query folding; Resolution method; Stratified databases

Indexed keywords

EID: 0346672703     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068401001375     Document Type: Article

References (58)

1. Apt, K. R., Blair, H. A. and Walker, A. (1988) Towards a theory of declarative knowledge. In: J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pp. 89-148. Morgan Kaufmann.
2. Abiteboul, S. and Duschka, O. M. (1998) Complexity of answering queries using materialized views. Proceedings Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 98), pp. 254-263. Seattle, WA. ACM.
3. Afrati, F. N., Gergatsoulis, M. and Kavalieros, T. (1998) Answering queries using materialized views with disjunctions. In: C. Beeri and P. Buneman, editors, ICDT'99: LNCS 1540, pp. 435-452. Springer-Verlag.
4. Afrati, F. N., Li, C. and Ullman, J. D. (2001) Generating efficient plans for queries using views. Proceedings ACM SIGMOD 2001, pp. 319-330. Santa Barbara, CA. ACM.
5. Aho, A. V., Sagiv, Y. and Ullman, J. (1979a) Efficient optimization of a class of relational expressions. IEEE Transactions on Database Systems, 4(3), 434-454.
6. Aho, A. V., Sagiv, Y. and Ullman, J. (1979b) Equivalence of relational expressions. SIAM Journal of Computing, 8(2), 218-246.
7. Boolos, G. S. and Jeffrey, R. C. (1989) Computability and Logic, 3rd ed. Cambridge University Press.
8. Bry, F. (1990) Query evaluation in recursive databases: bottom-up and top-down reconciled. Data & Knowledge Engineering, 5(4), 289-312.
9. Chakravarthy, U. S. (1985) Semantic Query Optimization in Deductive Databases. PhD thesis, University of Maryland.
10. Chakravarthy, U. S., Grant, J. and Minker, J. (1988) Foundations of semantic query optimization for deductive databases. In: J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pp. 243-273. Morgan Kaufmann.
11. Chakravarthy, U. S, Grant, J. and Minker, J. (1990) Logic-based approach to semantic query optimization. ACM Transactions on Database Systems, 15(2), 162-207.
12. Chandra, A. and Merlin, P. (1977) Optimal implementation of conjunctive queries in relational databases. Proceedings Ninth ACM Symposium on the Theory of Computing, pp. 77-90.
13. Chang, C. L. and Lee, R. C. T. (1973) Symbolic Logic and Mechanical Theorem Proving. Academic Press.
14. Chaudhuri, S., Krishnamurthy, R., Potamianos, S. and Shim, K. (1995) Optimizing queries with materialized views. Proceedings Eleventh ICDE, pp. 190-200.
15. Chekuri, C. and Rajaraman, A. (1997) Conjunctive Query Containment Revisited, pp. 56-70. Springer-Verlag.
16. Clark, K. L. (1978) Negation as Failure. In: H. Gallaire and J. Minker, editors, Logic and Data Bases, pp. 293-322. Plenum Press.
17. Das, S. K. (1992) Deductive Databases and Logic Programming. Addison-Wesley.
18. Dawson, S., Gryz, J. and Qian, X. (1996) Query folding with functional dependencies. Technical report, Computer Science Laboratory, SRI International, Menlo Park, CA.
19. Duschka, O. M. (1997a) Query optimization using local completeness. In: L. M. Pereira and E. Orlowska, editors, Proceedings Fourteenthth National Conference on AI and 9th Innovative Applications of AI Conference, pp. 249-255. Menlo Park, CA. AAAI Press.
20. Duschka, O. M. (1997b) Query Planning and Optimization in Information Integration. PhD thesis, Stanford University, Stanford, CA.
21. Duschka, O. M. and Genesereth, M. R. (1997a) Answering recursive queries using views. Proceedings Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 97), pp. 109-116. Tucson, AZ. ACM.
22. Duschka, O. M. and Genesereth, M. R. (1997b) Query planning in Infomaster. Proceedings 1997 Symposium on Applied Computing, pp. 109-111. San Jose, CA. ACM.
23. Duschka, O. M. and Genesereth, M. R. (1998) Query planning with disjunctive sources. Proceedings AAAI-98 Workshop on AI and Information Integration, Menlo Park, CA. AAAI Press.
24. Duschka, O. M., Genesereth, M. R. and Levy, A. Y. (2000) Recursive query plans for data integration. Journal of Logic Programming, 43(1), 49-73.
25. Duschka, O. and Levy, A. (1997) Recursive plans for information gathering. Proceedings 15th IJCAI, pp. 778-784. Nagoya, Japan.
26. Deutsch, A., Popa, L. and Tannen, V. (1999) Physical data independence, constraints, and optimization with universal plans. Proceedings VLDB'99, pp. 459-470.
27. Eiter, T., Gottlob, G. and Mannila, H. (1997) Disjunctive datalog. ACM Transactions on Database Systems, 22(3), 364-418.
28. Fages, F. (1991) A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics. New Generation Computing, 9, 425-443.
29. Flesca, S. and Greco, S. (2001) Rewriting queries using views. IEEE Transactions on Knowledge & Data Engineering, 13(6), 980-995.
30. Garcia-Molina, H., Papakonstantinou, Y., Quass, D., Rajaraman, A., Sagiv, Y., Ullman, J. and Widom, J. (1995) The TSIMMIS approach to mediation: data models and languages. Second Workshop on Next-Generation Information Technologies and Systems, Neharia, Israel.
31. Gelfond, M. and Lifschitz, V. (1988) The stable model semantics for logic programming. In: R. A. Kowalski and K. A. Bowen, editors, Proceedings Fifth International Conference and Symposium on Logic Programming, pp. 1070-1080. Seattle, WA.
32. Gryz, J. (1998) Query folding with inclusion dependencies. Proceedings Fourteenth ICDE, pp. 126-133. Orlando, FL.
33. Halevy, A. Y. (2001) Answering queries using views: A survey. VLDB Journal, 10(4), 270-294.
34. Johnson, D. S. and Klug, A. (1983) Optimizing conjunctive queries that contain untyped variables. SIAM Journal of Computing, 12(4), 616-640.
35. Larson, P.-Å. and Yang, H. Z. (1985) Computing queries from derived relations. Proceedings VLDB'85, pp. 259-269.
36. Levy, A. Y. (2000) Logic-based techniques in data integration. In: J. Minker, editor, Logic-Based Artificial Intelligence, pp. 575-595. Kluwer Academic.
37. Levy, A. Y., Mendelzon, A. O., Sagiv, Y. and Srivastava, D. (1995) Answering queries using views. Proceedings Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS-95, pp. 95-104.
38. Levy, A. Y., Rajaraman, A. and Ordille, J. J. (1996a) Query-answering algorithms for information agents. Proceedings Thirteenth National Conference on Artificial Intelligence (AAAI), pp. 40-47.
39. Levy, A. Y., Rajaraman, A. and Ordille, J. J. (1996b) Querying heterogeneous information sources using source-descriptions. Proceedings Twenty-Second International Conference on Very Large Databases, pp. 251-262. Bombay, India.
40. Lloyd, J. W. (1987) Foundations of Logic Programming, 2nd ed. Springer-Verlag.
41. Lobo, J., Minker, J. and Rajasekar, A. (1992) Foundations of Disjunct ire Logic Programming. MIT Press.
42. Minker, J. (1996) Logic and databases: a 20 year retrospective. In: D. Pedreschi and C. Zaniolo, editors, Logic in Databases, pp. 3-57. Springer-Verlag.
43. Minker, J. and Nicolas, J.-M. (1982) On recursive axioms in deductive databases. Information Systems, 7(4), 1-15.
44. Melton, J. and Simon, A. R. (1993) Understanding the New SQL: A Complete Guide. Morgan Kaufmann.
45. Naughton, J. F. and Sagiv, Y. (1987) A decidable class of bounded recursions. Proceedings Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 227-236.
46. Popa, L., Deutsch, A., Sahuguet, A. and Tannen, V. (2000) A chase too far? Proceedings ACM SIGMOD 2000, pp. 273-284.
47. Pottinger, R. and Levy, A. (2000) A scalable algorithm for answering queries using views. Proceedings 26th VLDB Conference, pp. 484-495. Cairo, Egypt.
48. Qian, X. (1996) Query folding. Proceedings Twelfth International Conference on Data Engineering, pp. 48-55.
49. Rajaraman, A., Sagiv, Y. and Ullman, J. D. (1995) Answering queries using templates with binding patterns. Proceedings Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 95), pp. 105-112. ACM.
50. Reiter, R. (1978a) Deductive question-answering on relational data bases. In: H. Gallaire and J. Minker, editors, Logic and Data Bases, pp. 149-177. Plenum Press.
51. Reiter, R. (1978b) On Closed World Data Bases. In: H. Gallaire and J. Minkcr, editors, Logic and Data Bases, pp. 55-76. Plenum Press.
52. Robinson, J. A. (1965) A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1), 23-41.
53. Tsatalos, O. G., Solomon, M. H. and Ioannidis, Y. E. (1994) The GMAP: a versatile tool for physical data independence. Proceedings VLDB'94, pp. 367-378.
54. Ullman, J. D. (1988) Principles of Database and Knowledge-Base Systems. Volumes I & II. Computer Science Press.
55. Ullman, J. D. (1997) Information integration using logical views. Proceedings of ICDT, pp. 19-40.
56. Van Gelder, A. (1988) Negation as failure using tight derivations for general logic programs. In: J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pp. 149-176. Morgan Kaufmann.
57. Van Gelder, A., Ross, K. A. and Schlipf, J. (1991) Unfounded sets and well-founded semantics for general logic programs. Journal of the ACM, 38(3), 620-650.
58. Yang, H. Z. and Larson, P.-Å. (1987) Query transformation for PSJ-queries. Proceedings Thirteenth International Conference on Very Large Data Bases, pp. 245-254.