Abstract
There are several algorithms for the problem of query rewriting using views, including the bucket-based algorithms and the inverse rule-based algorithms. The inverse rule-based algorithms have considered the problem in the presence of functional dependencies. However, there are few papers that consider the influences of functional dependencies from the point of view of the bucket-based algorithms. In this paper, we discuss this issue in the bucket-based framework. We mainly consider how to use conditions weaker than the ones in the previous algorithms when forming a set of buckets. The novelty of our approach is that we can enforce additional constraints on the non-exported attributes in a view through functional dependencies. As a result, more valid buckets can be formed. We can then generate additional rewritings which cannot be generated by the previous algorithms. We prove that our algorithm is sound and complete, i.e., the union of the obtained rewriting is a maximally-contained rewriting relative to functional dependencies under certain assumptions. In addition, we also discuss how to construct a recursive rewriting by making use of functional dependencies.
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
Bai, Q., Hong, J., McTear, M.F.: Scalable Query Reformulation Using Views in the Presence of Functional Dependencies. In: Proceedings of the 4th International Conference on Advances in Web-Age Information Management, Chengdu, China, pp. 471–482. Springer, Heidelberg (2003)
Duschka, O.M., Genesereth, M.R.: Answering Recursive Queries Using Views. In: Proceedings of the 16th ACM Conference on Principles of Database Systems (PODS 1997), Tucson, Arizona, USA, pp. 109–116. ACM Press, New York (1997)
Duschka, O.M., Genesereth, M.R., Levy, A.Y.: Recursive Query Plans for Data Integration. Journal of Logic Programming, special issue on Logic Based Heterogeneous Information Systems 43(1), 49–73 (2000)
Grant, J., Minker, J.: A logic-based approach to data integration. TLP 2(3), 323–368 (2002)
Gryz, J.: Query Rewriting Using Views in the Presence of Functional and Inclusion Dependencies. Information Systems 24(7), 597–612 (1999)
Lenzerini, M.: Data Integration: A Theoretical Perspective. In: Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Madison, Wisconsin, USA, pp. 233–246. ACM Press, New York (2002)
Levy, A.Y.: Answering Queries Using Views: A Survey. The VLDB Journal 10(4), 270–294 (2001)
Mitra, P.: An Algorithm for Answering Queries Efficiently Using Views. In: Proceedings of the 12th Australasian Database Conference, Australia, pp. 99–106. ACM Press, New York (2001)
Pottinger, R., Levy, A.Y.: A Scalable Algorithm for Answering Queries Using Views. In: Proceedings of the 26th International Conference on Very Large Data Bases, Cairo, Egypt, pp. 484–495. Morgan Kaufmann Publishers, San Francisco (2000)
Qian, X.: Query folding. In: Proceedings of the 12th IEEE International Conference on Data Engineering, New Orleans, Louisiana, USA, pp. 48–55. IEEE Computer Society Press, Los Alamitos (1996)
Ullman, J.D.: Information Integration Using Logical Views. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 19–40. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bai, Q., Hong, J., Wang, H., McTear, M.F. (2005). Influences of Functional Dependencies on Bucket-Based Rewriting Algorithms. In: Fan, W., Wu, Z., Yang, J. (eds) Advances in Web-Age Information Management. WAIM 2005. Lecture Notes in Computer Science, vol 3739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11563952_33
Download citation
DOI: https://doi.org/10.1007/11563952_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29227-2
Online ISBN: 978-3-540-32087-6
eBook Packages: Computer ScienceComputer Science (R0)