Abstract
Query rewriting using views is an important topic in data integration. A number of rewriting algorithms, such as the SVB algorithm, the MiniCon algorithm and the inverse rules algorithm, have been developed. All the algorithms can generate a maximally-contained rewriting of a given query, which is the union of a set of conjunctive rewritings contained in the given query. In this paper, we first argue that the condition for forming a shared-variable bucket in the SVB algorithm can be modified in the case where a shared variable in a query is mapped to a distinguished variable that is also a join attribute in a view. Under the modified condition, we may create more shared-variable buckets so that fewer rewritings can be generated than the SVB algorithm. Second, the SVB algorithm does not handle a constant in a view properly in the case where a shared variable of a query is mapped to a constant of a view. We propose to use a pseudo shared-variable bucket to address this issue. The only difference between the SVB algorithm and the MiniCon algorithm is that the latter considers a head homomorphism on a view. However, the head homomorphism on a view is not related to the condition we intend to modify in this paper. The modifications we present are also applicable to the MiniCon algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Duschka, O.M., Genesereth, M.R., Levy, A.Y.: Recursive Query Plans for Data Integration. Journal of Logic Programming 43(1), 49–73 (2000)
Grant, J., Minker, J.: A logic-based approach to data integration. TLP 2(3), 323–368 (2002)
Levy, A.Y.: Answering Queries Using Views: A Survey. The VLDB Journal 10(4), 270–294 (2001)
Levy, A.Y., Rajaraman, A., Ordille, J.J.: Querying Heterogeneous Information Sources Using Source Descriptions. In: Proceedings of the 22nd VLDB Conference, pp. 251–262 (1996)
Mitra, P.: An Algorithm for Answering Queries Efficiently Using Views. In: Proceedings of the 12th Australasian Database Conference, pp. 99–106 (2001)
Pottinger, R., Levy, A.Y.: A Scalable Algorithm for Answering Queries Using Views. In: Proceedings of VLDB, pp. 484–495 (2000)
Qian, X.: Query folding. In: Proceedings of the 12th IEEE International Conference on Data Engineering (ICDE 1996), pp. 48–55 (1996)
Wang, J., Maher, M., Topor, R.: Rewriting General Conjunctive Queries Using Views. In: Proceedings of the 13th Australasian Conference on Database Technologies, Melbourne, Australia, pp. 197–206 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bai, Q., Hong, J., McTear, M.F. (2004). Some Modifications of Bucket-Based Algorithms for Query Rewriting Using Views. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2004. Lecture Notes in Computer Science, vol 3261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30198-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-30198-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23478-4
Online ISBN: 978-3-540-30198-1
eBook Packages: Computer ScienceComputer Science (R0)