Answering Queries with Useful Bindings

ACM Transactions on Database Systems

Volumn 26, Issue 3, 2001, Pages 313-343

  Li, Chen ^a   Chang, Edward ^b,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c University of California   (United States)

Author keywords

Algorithms; Datalog programs; H.2.4 Information Systems : Systems query processing; H.2.5 Information Systems : Heterogeneous Databases; Information integration systems; Limited source capabilities; Performance; Query containment

Indexed keywords

DATALOG PROGRAMS; INFORMATION INTEGRATION SYSTEMS; QUERY CONTAINMENT;

ALGORITHMS; COMPUTER PROGRAM LISTINGS; INFORMATION MANAGEMENT; INFORMATION RETRIEVAL; INTERNET;

DATABASE SYSTEMS;

EID: 0142228522     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/502030.502032     Document Type: Article

References (40)

1. ABITEBOUL, S. AND DUSCHKA, O. M. 1998. Complexity of answering queries using materialized views. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS) 254-263.
2. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1983. Data Structures and Algorithms. Addison-Wesley, Reading, Mass.
3. BANCILHON, F. AND RAMAKRISHNAN, R. 1986. An amateur's introduction to recursive query processing strategies. In Proceedings of ACM SIGMOD, 16-52.
4. BAYARDO, JR., R. J. ET AL. 1997. Infosleuth: Semantic integration of information in open and dynamic environments (experience paper). In Proceedings of ACM SIGMOD, 195-206.
5. BEERI, C. AND RAMAKRISHNAN, R. 1987. On the power of magic. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS), 269-283.
6. CAREY, M. J., HAAS, L. M., SCHWARZ, P. M., ARYA, M., CODY, W. F., FAGIN, R., FLICKNER, M., LUNIEWSKI, A., NIBLACK, W., PETKOVIC, D. II, J. T., WILLIAMS, J. H., AND WIMMERS, E. L. 1995. Towards heterogeneous multimedia information systems: The garlic approach. In Proceedings of RIDE-DOM, 124-131.
7. CHANDRA, A. K. AND MERLIN, P. M. 1977. Optimal implementations of conjunctive queries in relational data bases. In Proceedings of the Ninth ACM Symposium on Theory of Computing (STOC), ACM, New York, 77-90.
8. CHAUDHURI, S. AND VARDI, M. Y. 1992. On the equivalence of recursive and nonrecursive datalog programs. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS), 55-66.
9. CHAWATHE, S., GARCIA-MOLINA, H., HAMMER, J., IRELAND, K., PAPAKONSTANTINOU, Y., ULLMAN, J. D., AND WIDOM, J. 1994. The TSIMMIS project: Integration of heterogeneous information sources. In Proceedings of the Sixteenth Meeting of the Information Processing Society of Japan (Tokyo), 7-18.
10. CLUET, S., DELOBEL, C., SIMEON, J., AND SMAGA, K. 1998. Your mediators need data conversion! In Proceedings of ACM SIGMOD, 177-188.
11. COSMADAKIS, S. S., GAIFMAN, H., KANELLAKIS, P. C., AND VARDI, M. Y. 1988. Decidable optimization problems for database logic programs. In Proceedings of the Twentieth ACM Symposium on Theory of Computing, 477-490.
12. DUSCHKA, O. M. 1998. Query planning and optimization in information integration. PhD thesis, Stanford University, Stanford, Calif.
13. DUSCHKA, O. M. AND GENESERETH, M. R. 1997. Answering recursive queries using views. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS), 109-116.
14. DUSCHKA, O. M. AND LEVY, A. Y. 1997. Recursive plans for information gathering. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (Nagoya, Japan), 778-784.
15. FLORESCU, D., LEVY, A., MANOLESCU, I., AND SUCIU, D. 1999. Query optimization in the presence of limited access patterns. In Proceedings of ACM SIGMOD, 311-322.
16. GAIFMAN, H., MAIRSON, H., SAGIV, Y., AND VARDI, M. Y. 1993. Undecidable optimization problems for database logic programs. J. ACM 40, 3, 683-713.
17. GENESERETH, M. R., KELLER, A. M., AND DUSCHKA, O. M. 1997. Infomaster: An information integration system. In Proceedings of ACM SIGMOD, 539-542.
18. HAAS, L. M., KOSSMANN, D., WIMMERS, E. L., AND YANG, J. 1997. Optimizing queries across diverse data sources. In Proceedings of VLDB, 276-285.
19. HAMMER, J., GARCÍA-MOLINA, H., NESTOROV, S., YERNENI, R., BREUNIG, M., AND VASSALOS, V. 1997. Template-based wrappers in the TSIMMIS system. In Proceedings of ACM SIGMOD, 532-535.
20. IVES, Z., FLORESCU, D., FRIEDMAN, M., LEVY, A., AND WELD, D. 1999. An adaptive query execution engine for data integration. In Proceedings of ACM SIGMOD, 299-310.
21. LEVY, A. Y., MENDELZON, A. O., SAGIV, Y., AND SRIVASTAVA, D. 1995. Answering queries using views. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS), 95-104.
22. LEVY, A. Y., RAJARAMAN, A., AND ORDILLE, J. J. 1996. Querying heterogeneous information sources using source descriptions. In Proceedings of VLDB, 251-262.
23. LI, C. AND CHANG, E. 1999. Testing query containment in the presence of limited access patterns. Tech. Rep., Computer Science Dept., Stanford University.
24. LI, C. AND CHANG, E. 2000. Query planning with limited source capabilities. In Proceedings of the International Conference on Data Engineering (ICDE), 401-412.
25. LI, C. AND CHANG, E. 2001. On answering queries in the presence of limited access patterns. In Proceedings of the International Conference on Database Theory (ICDT), 99-113.
26. LI, C., YERNENI, R., VASSALOS, V., GARCIA-MOLINA, H., PAPAKONSTANTINOU, Y., ULLMAN, J. D., AND VALIVETI, M. 1998. Capability based mediation in TSIMMIS. In Proceedings of ACM SIGMOD, 564-566.
27. MALUF, D. A. AND WIEDERHOLD, G. 1997. Abstraction of representation for interoperation. In Proceedings of the International Symposium on Methodologies for Intelligent Systems (ISMIS), 441-455.
28. MILLSTEIN, T., LEVY, A., AND FRIEDMAN, M. 2000. Query containment for data integration systems. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS).
29. PAPAKONSTANTINOU, Y., GARCIA-MOLINA, H., AND WIDOM, J. 1995. Object exchange across heterogeneous information sources. In Proceedings of the Eleventh. Conference on Data Engineering (Taipei, Taiwan), P. S. Yu and A. L. P. Chen, Eds., IEEE Computer Society, Los Alamitos, Calif., 251-260.
30. QIAN, X. 1996. Query folding. In Proceedings of the International Conference on Data Engineering (ICDE), 48-55.
31. RAJARAMAN, A., SAGIV, Y., AND ULLMAN, J. D. 1995. Answering queries using templates with binding patterns. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS), 105-112.
32. SAGIV, Y. AND YANNAKAKIS, M. 1980. Equivalences among relational expressions with the union and difference operators. J. ACM 27, 4, 633-655.
33. SHMUELI, O. 1993. Equivalence of datalog queries is undecidable. J. Logic Program. 15, 3, 231-241.
34. TOMASIC, A., RASCHID, L., AND VALDURIEZ, P. 1998. Scaling access to heterogeneous data sources with DISCO. IEEE Trans. Knowl. Data Eng. 10, 5, 808-823.
35. ULLMAN, J. D. 1989. Principles of Database and Knowledge-base Systems, Vol. II: The New Technologies. Computer Science Press, New York.
36. ULLMAN, J. D. 1997. Information integration using logical views. In Proceedings of the International Conference on Database Theory (ICDT), 19-40.
37. VASSALOS, V. AND PAPAKONSTANTINOU, Y. 1997. Describing and using query capabilities of heterogeneous sources. In Proceedings of VLDB, 256-265.
38. WIEDERHOLD, G. 1992. Mediators in the architecture of future information systems. IEEE Comput. 25, 3, 38-49.
39. YERNENI, R., LI, C., GARCIA-MOLINA, H., AND ULLMAN, J. D. 1999. Computing capabilities of mediators. In Proceedings of ACM SIGMOD, 443-454.
40. YERNENI, R., LI, C., ULLMAN, J. D., AND GARCIA-MOLINA, H. 1999. Optimizing large join queries in mediation systems. In Proceedings of the International Conference on Database Theory (ICDT), 348-364.