Chen Li
Skip Abstract Section
Abstract
In information-integration systems, sources may have diverse and limited query capabilities. To obtain maximum information from these restrictive sources to answer a query, one can access sources that are not specified in the query (i.e., off-query sources). In this article, we propose a query-planning framework to answer queries in the presence of limited access patterns. In the framework, a query and source descriptions are translated to a recursive datalog program. We then solve optimization problems in this framework, including how to decide whether accessing off-query sources is necessary, how to choose useful sources for a query, and how to test query containment. We develop algorithms to solve these problems, and thus construct an efficient program to answer a query.
- 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.]] Google Scholar
Digital Library
- AHO,A.V.,HOPCROFT,J.E.,AND ULLMAN, J. D. 1983. Data Structures and Algorithms. Addison-Wesley, Reading, Mass.]] Google ScholarDigital Library
- BANCILHON,F.AND RAMAKRISHNAN, R. 1986. An amateur's introduction to recursive query processing strategies. In Proceedings of ACM SIGMOD, 16-52.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- CHANDRA,A.K.AND MERLIN, P. M. 1977. Optimal implementations of conjunctive queries in relational data bases. In Proceedings of the Ninth ACMSymposium on Theory of Computing (STOC), ACM, New York, 77-90.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]]Google Scholar
- CLUET, S., DELOBEL, C., SIMEON,J.,AND SMAGA, K. 1998. Your mediators need data conversion! In Proceedings of ACM SIGMOD, 177-188.]] Google ScholarDigital Library
- 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 ACMSymposium on Theory of Computing, 477-490.]] Google ScholarDigital Library
- DUSCHKA, O. M. 1998. Query planning and optimization in information integration. PhD thesis, Stanford University, Stanford, Calif.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]]Google Scholar
- 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.]] Google ScholarDigital Library
- GAIFMAN, H., MAIRSON, H., SAGIV,Y.,AND VARDI, M. Y. 1993. Undecidable optimization problems for database logic programs. J. ACM 40, 3, 683-713.]] Google ScholarDigital Library
- GENESERETH, M. R., KELLER,A.M.,AND DUSCHKA, O. M. 1997. Infomaster: An information integration system. In Proceedings of ACM SIGMOD, 539-542.]] Google ScholarDigital Library
- HAAS, L. M., KOSSMANN, D., WIMMERS,E.L.,AND YANG, J. 1997. Optimizing queries across diverse data sources. In Proceedings of VLDB, 276-285.]] Google ScholarDigital Library
- HAMMER, J., GARCYA-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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- LEVY,A.Y.,RAJARAMAN, A., AND ORDILLE, J. J. 1996. Querying heterogeneous information sources using source descriptions. In Proceedings of VLDB, 251-262.]] Google ScholarDigital Library
- LI,C.AND CHANG, E. 1999. Testing query containment in the presence of limited access patterns. Tech. Rep., Computer Science Dept., Stanford University.]]Google Scholar
- LI,C.AND CHANG, E. 2000. Query planning with limited source capabilities. In Proceedings of the International Conference on Data Engineering (ICDE), 401-412.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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 ACMSIGMOD, 564-566.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- 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).]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- QIAN, X. 1996. Query folding. In Proceedings of the International Conference on Data Engineering (ICDE), 48-55.]] Google ScholarDigital Library
- RAJARAMAN, A., SAGIV,Y.,AND ULLMAN, J. D. 1995. Answering queries using templates with binding patterns. In Proceedings of the ACMSymposium on Principles of Database Systems (PODS), 105- 112.]] Google ScholarDigital Library
- SAGIV,Y.AND YANNAKAKIS, M. 1980. Equivalences among relational expressions with the union and difference operators. J. ACM 27, 4, 633-655.]] Google ScholarDigital Library
- SHMUELI, O. 1993. Equivalence of datalog queries is undecidable. J. Logic Program. 15, 3, 231- 241.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- ULLMAN, J. D. 1989. Principles of Database and Knowledge-base Systems, Vol. II: The New Technologies. Computer Science Press, New York.]] Google ScholarDigital Library
- ULLMAN, J. D. 1997. Information integration using logical views. In Proceedings of the International Conference on Database Theory (ICDT), 19-40.]] Google ScholarDigital Library
- VASSALOS,V.AND PAPAKONSTANTINOU, Y. 1997. Describing and using query capabilities of heterogeneous sources. In Proceedings of VLDB, 256-265.]] Google ScholarDigital Library
- WIEDERHOLD, G. 1992. Mediators in the architecture of future information systems. IEEE Comput. 25, 3, 38-49.]] Google ScholarDigital Library
- YERNENI, R., LI, C., GARCIA-MOLINA, H., AND ULLMAN, J. D. 1999. Computing capabilities of mediators. In Proceedings of ACM SIGMOD, 443-454.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
Index Terms
- Answering queries with useful bindings
Recommendations
Query Planning with Limited Source Capabilities
ICDE '00: Proceedings of the 16th International Conference on Data EngineeringIn information-integration systems, sources may have diverse and limited query capabilities. In this paper we show that because sources have restrictions on retrieving their information, sources not mentioned in a query can contribute to the query ...
Decidable containment of recursive queries
Database theoryOne of the most important reasoning tasks on queries is checking containment, i.e., verifying whether one query yields necessarily a subset of the result of another one. Query containment is crucial in several contexts, such as query optimization, query ...
Rewriting general conjunctive queries using views
The problem of rewriting queries using views has important applications in data integration, query optimization, and physical data independence maintenance. Previous researchers have proposed rewriting algorithms for queries and views that are Datalog ...
Comments