IMPROVING VIEW SELECTION IN QUERY REWRITING USING DOMAIN SEMANTICS

Qingyuan Bai, Jun Hong, Michael F. McTear

2004

Abstract

Query rewriting using views is an important issue in data integration. Several algorithms have been proposed, such as the bucket algorithm, the inverse rules algorithm, the SVB algorithm, and the MiniCon algorithm. These algorithms can be divided into two categories. The algorithms of the first category are based on use of buckets while the ones of the second category are based on use of inverse rules. The bucket-based algorithms have not considered the effects of integrity constraints, such as domain semantics, functional and inclusion dependencies. As a result, they might miss query rewritings or generate redundant query rewritings in the presence of these constraints. A bucket-based algorithm consists of two steps. The first step is called view selection that selects views relevant to a given query and puts the views into the corresponding buckets. The second step is to generate all the possible query rewritings by combining a view from each bucket. In this paper, we consider an improvement of view selection in the bucket-based algorithms using domain semantics. We use the resolution method to generate a pseudo residue for each view given a set of domain semantics. Given a query, the pseudo residue of each view is compared with it and any conflict that exists can be found. As a result, irrelevant views can be removed even before a bucket-based algorithm is used.

References

  1. Arens, Y., Knoblock, C.A., Shen, W., 1996. Query Reformulation for Dynamic Information Integration. In Journal of Intelligent Information Systems, Special Issue on Intelligent Information Integration, 6(2/3):99- -130.
  2. Cali, A., Calvanese, D., Giacomo, G. D., Lenzerini, M., 2002. On the Role of Integrity Constraints in Data Integration. In IEEE Data Engineering Bulletin, 25(3), Special Issue on Organizing and Discovering the Semantic Web, 39-45.
  3. Chakravarthy, U.S., Grant, J., Minker, J., 1990. Logic based approach to semantic query optimization. In ACM Transactions on Database Systems, 15(2): 162- 207.
  4. Chaudhuri, S., Krishnamurthy, R., Potamianos, S., Shim, K., 1995. Optimizing Queries with Materialized Views. In Proceeding of the 11th International Conference on Data Engineering, IEEE Computer Soc. Press, 190-200.
  5. Duschka, O.M., Genesereth, M.R., Levy, A.Y., 2000. Recursive Query Plans for Data Integration. In Journal of Logic Programming, special issue on Logic Based Heterogeneous Information Systems, 43(1), 49- 73.
  6. Florescu, D., Raschid, L., Valduriez, P., 1996. Query Reformulation in Multidatabase Systems using Semantic Knowledge. In International Journal of Cooperative Information Systems, 5(1996), 431-468.
  7. Fagin, R., Vardi, M.Y.,1986. The Theory of Data Dependencies-A Survey. In Proceedings of Symposia in Applied Mathematics, Volume 34, 19-71.
  8. Godfrey, P., Grant, J., Gryz, J., Minker, J., 1998. Integrity Constraints: Semantics and Applications. In Chapter 9 of Logics for Databases and Information Systems, J.Chomicki and G.Saake, editors, Kluwer Press, 265- 306.
  9. Grant, J., Minker., J., 2002. A logic-based approach to data integration. In TLP, 2(3):323-368.
  10. Gryz, J., 1998. An Algorithm for Query Folding with Functional Dependencies. In Proceedings of the 7th International Symposium on Intelligent Information Systems , 7-16.
  11. Gryz, J., 1999. Query rewriting using views in the presence of functional and inclusion dependencies. In Information System, 24(7):597-612.
  12. Hsu, C., Knoblock, C.A., 2000. Semantic Query Optimization for Query Plans of Heterogeneous Multidatabase Systems. In IEEE Transactions on Knowledge and Data Engineering, 12(6):959--978.
  13. Levy, A.Y., 2001. Answering Queries Using Views: A Survey. In VLDB Journal, 10(4), 270-294.
  14. Levy, A.Y., Rajaraman, A., Ordille, J.J., 1996a. Querying Heterogeneous Information Sources Using Source Descriptions. In Proceedings of the 22nd VLDB Conference, 251--262.
  15. Levy, A.Y., Rajaraman, A., Ordille, J.J., 1996b. QueryAnswering Algorithms for Information Agents. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, AAAI Press / MIT Press, 40--47.
  16. Mitra, P., 2001. An Algorithm for Answering Queries Efficiently Using Views. In Proceedings of the 12th Australasian Database Conference, 99-106.
  17. Pottinger, R., Levy, A.Y., 2000. A Scalable Algorithm for Answering Queries Using Views. In Proceedings of the International Conference on Very Large Data Bases(VLDB), 484-495.
  18. Qian, X., 1996. Query folding. In Proceedings of the 12th IEEE International Conference on Data Engineering (ICDE'96), 48-55.
Download


Paper Citation


in Harvard Style

Bai Q., Hong J. and F. McTear M. (2004). IMPROVING VIEW SELECTION IN QUERY REWRITING USING DOMAIN SEMANTICS . In Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 972-8865-00-7, pages 177-183. DOI: 10.5220/0002623101770183


in Bibtex Style

@conference{iceis04,
author={Qingyuan Bai and Jun Hong and Michael F. McTear},
title={IMPROVING VIEW SELECTION IN QUERY REWRITING USING DOMAIN SEMANTICS},
booktitle={Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2004},
pages={177-183},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002623101770183},
isbn={972-8865-00-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - IMPROVING VIEW SELECTION IN QUERY REWRITING USING DOMAIN SEMANTICS
SN - 972-8865-00-7
AU - Bai Q.
AU - Hong J.
AU - F. McTear M.
PY - 2004
SP - 177
EP - 183
DO - 10.5220/0002623101770183