Abstract
In this paper we study the issue of utilizing polytree structures in a real-life application namely that of enhancing caching in disributed databases. Specifically, in this application, the only data or learning cases available is a huge trace of a set of queries of the type of “Select” statements made by different users of a distributed database system. This trace is considered as a sequence containing repeated patterns of queries. The aim is to capture the repeated patterns of queries so as to be able to perform anticipated caching. By introducing the notion of caching, we try to take advantage of performing local accesses rather than remote accesses, because the former significantly reduces the communication time, and thus improves the overall performance of a system. We utilize polytree-based machine learning schemes to detect sequences of repeated queries made to remote databases. Once constructed, such networks can provide insight into probabilistic dependencies that exist among the queries, and thus enhance distributed query optimization.
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
Acid, S. and de Campos, L.M., (1994): Approximations of Causal Networks by Polytrees: An Empirical Study. Proceedings of the Fifth IPMU Conference, 972–977.
Cooper, G. F. and Herskovits, E. H., (1992): A Bayesian Method for the Induction of Probabilistic Networks from Data. Machine Learning, Vol. 9: 309–347.
Chow, C. K. and Liu, C. N., (1968): Approximating Discrete Probability Distributions with Dependence Trees”. IEEE Trans. on Information Theory, Vol. 14: 462–467.
Dasputa, S. (2000): Learning Probability Distributions. Doctoral Dissertation, University of California at Berkeley, 2000.
Dietterich, T. G, and Michalski, R. S., (1983): Learning to Predict Sequences. Machine Learning II: An Artificial Intelligence Approach. Edited by Michalski, Carbonell and Mictchell.
Geiger, D., Paz, A., and Pearl, J. (1990): Learning Causal Trees from Dependence Information. Proceedings of the Eighth National Conference on Artificial Intelligence, AAAI Press, pp. 770–776.
King, D., (1999). Personal Communication. President and CEO, KSL King Systems Limited, 28 Newton Street, Ottawa,Ontario, Canada, K1S 2S7.
KSL King Systems Limited. (1995): The NetCache Software Manual, The Remote Database Performance, NC01.
Ouerd, M., Oommen, B. J., and Matwin, S. (2000): A Formalism for Building Causal Polytree Structures using Data Distributions. Proceedings of the Int’l Symposium on Intelligent Systems, Charlotte, NC: pp. 629–638.
Ouerd, M., (2000): Building Probabilistic Networks and Its Application to Distributed Databases. Doctoral Dissertation, SITE, University of Ottawa, Ottawa, Canada.
Pearl, J. (1988): Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA.
Rebane, G. and Pearl, J. (1987): “The Recovery of Causal Polytrees from Statistical Data”. Proceedings of the Third Workshop on Uncertainty in Artificial Intelligence Seattle, Washington, 222–228.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Messaouda, O., Oommen, J.B., Matwin, S. (2003). Enhancing Caching in Distributed Databases Using Intelligent Polytree Representations. In: Xiang, Y., Chaib-draa, B. (eds) Advances in Artificial Intelligence. Canadian AI 2003. Lecture Notes in Computer Science, vol 2671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44886-1_40
Download citation
DOI: https://doi.org/10.1007/3-540-44886-1_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40300-5
Online ISBN: 978-3-540-44886-0
eBook Packages: Springer Book Archive