Evolution and Revolutions in LDAP Directory Caches
LDAP directories have recently proliferated with the growth of the Internet, and are being used in a wide variety of network-based applications. In this paper, we propose the use of generalized queries, referred to as query templates, obtained by generalizing individual user queries, as the semantic basis for low overhead, high benefit LDAP directory caches for handling declarative queries. We present efficient incremental algorithms that, given a sequence of user queries, maintain a set of potentially beneficial candidate query templates, and select a sub-set of these candidates for admission into the directory cache. A novel feature of our algorithms is their ability to deal with overlapping query templates. Finally, we demonstrate the advantages of template caches over query caches, with an experimental study based on real data and a prototype implementation of the LDAP directory cache.
Unable to display preview. Download preview PDF.
- 1.P. Cao, E. W. Felten, A. R. Karlin, and K. Li. A study of integrated prefetching and caching strategies. In Proceedings of ACM SIGMETRICS Conference, pages 188–197, 1995.Google Scholar
- 2.S. Cluet, O. Kapitskaia, and D. Srivastava. Using LDAP directory caches. In Proceedings of the ACM Symposium on Principles of Database Systems, Philadelphia, PA, June 1999.Google Scholar
- 3.K. M. Curevitz, P. Krishnan, and J. S. Vitter. Practical prefetching via data compression. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 257–266, 1993.Google Scholar
- 4.S. Dar, M. J. Franklin, B. T. Jonsson, D. Srivastava, and M. Tan. Semantic data caching and replacement. In Proceedings of the International Conference on Very Large Databases, pages 330–341, Bombay, India, 1996.Google Scholar
- 5.P. M. Deshpande, K. Ramaswamy, A. Shukla, and J. F. Naughton. Caching multidimensional queries using chunks. In Proceedings of the ACM SIGMOD Conference on Management of Data, Seattle, WA, 1998.Google Scholar
- 6.M. J. Franklin. Client data caching: A foundation for high performance object database systems. Kluwer Academic Publishers, 1996.Google Scholar
- 7.M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.Google Scholar
- 8.Innosoft. Innosoft’s LDAP world implementation survey. Available from http://www.critical-angle.com/dir/lisurvey.html.
- 9.H. V. Jagadish, O. Kapitskaia, R. T. Ng and D. Srivastava. Multi-dimensional substring selectivity estimation. In Proceedings of the International Conference on Very Large Databases, 1999Google Scholar
- 10.H. V. Jagadish, R. T. Ng, and D. Srivastava. Substring selectivity estimation. In Proceedings of the ACM Symposium on Principles of Database Systems, Philadelphia, PA, June 1999.Google Scholar
- 12.A. Kraiss and G. Weikum. Integrated document caching and prefetching in storage hierarchies based on markov-chain predictions. The VLDB Journal, 1998.Google Scholar
- 13.M. Palmer and S. Zdonik. FIDO: A cache that learns to fetch. In Proceedings of the International Conference on Very Large Databases, pages 255–264, 1991.Google Scholar
- 14.N. Roussopoulos, C. M. Chen, S. Kelley, A. Delis, and Y. Papakonstantinou. The ADMS project: Views “R” Us. IEEE Data Engineering Bulletin, June 1995.Google Scholar
- 15.P. Scheuermann, J. Shim, and R. Vingralek. WATCHMAN: A data warehouse intelligent cache manager. In Proceedings of the International Conference on Very Large Databases, 1996.Google Scholar