Abstract
Maintaining a semantic cache of materialized XPath views inside or outside the database, is a novel, feasible and efficient approach to accelerate XML query processing. However, the main problems of existing approaches are that, they either can not exploit sufficient potential cached views to answer an issued query or need too much time for cache lookup. In this paper, we propose, SCEND, an efficient Semantic Cache based on dEcompositioN and Divisibility, which adequately explores the answerability of views, and speeds up cache lookup dramatically. We decompose complex XPath queries into some much simpler and tractable ones to improve cache hit rate, moreover, we introduce a notion of the divisibility between two positive integers to accelerate cache lookup. In addition, we present a new replacement technique for SCEND to improve performance for caching. We experimentally demonstrate the efficiency of our caching techniques and performance gains obtained by employing such a cache.
Supported by the National Natural Science Foundation of China under Grant No. 60573094, Tsinghua Basic Research Foundation under Grant No. JCqn2005022, Zhejiang Natural Science Foundation under Grant No. Y105230, and 973 Program under Grant No.2006CB303103.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Balmin, A., Ozcan, F., Beyer, K., Cochrane, R., Pirahesh, H.: A framework for using materialized xpath views in XML query processing. In: VLDB, pp. 60–71 (2004)
Bruno, N., Srivastava, D., Koudas, N.: Holistic twig joins: Optimal XML pattern matching. In: SIGMOD, pp. 310–321 (2002)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. McGraw-Hill, New York (1990)
Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: STOC 1977, pp. 77–90 (1977)
Chen, L., Rundensteiner, E.A.: Ace-xq: A cache-aware xquery answering system. In: WebDB, pp. 31–36 (2002)
Dar, S., Franklin, M.J., Jonsson, B., Srivastava, D., et al.: Semantic data caching and replacement. In: VLDB, pp. 330–341 (1996)
Flesca, S., Furfaro, F., Masciari, E.: On the minimization of xpath queries. In: VLDB, pp. 153–164 (2003)
Jang, H.F., Lu, H.J., Wang, W., Xu Yu, J.: Holistic Twig Joins on Indexed XML Documents. In: VLDB 2003 (2003)
Luo, Q., Krishnamurthy, S., Mohan, C., et al.: Middle-tier database caching for e-business. In: SIGMOD (2002)
Milo, T., Suciu, D.: Index structures for path expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 277–295. Springer, Heidelberg (1998)
Miklau, G., Suciu, D.: Containment and equivalence for an xpath fragment. In: Proceedings of PODS, pp. 65–76 (2002)
Mandhani, B., Suciu, D.: Query Caching and View Selection for XML Databases. In: VLDB, pp. 469–480 (2005)
Pal, S., Cseri, I., Schaller, G., et al.: Indexing xml data stored in a relational database. In: VLDB, pp. 1134–1145 (2004)
Re, C., Brinkley, J., Hinshaw, K., Suciu, D.: Distributed xquery. In: IIWeb (2004)
Schmidt, A.R., Waas, F., Kersten, M.L., et al.: The XML Benchmark Project. Technical Report INS-R0103,CWI (2001)
Yagoub, K., Florescu, D., Issarny, V., Valduriez, P.: Caching strategies for data intensive web sites. The VLDB Journal, 188–199 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, G., Feng, J., Ta, N., Zhang, Y., Zhou, L. (2006). SCEND: An Efficient Semantic Cache to Adequately Explore Answerability of Views. In: Aberer, K., Peng, Z., Rundensteiner, E.A., Zhang, Y., Li, X. (eds) Web Information Systems – WISE 2006. WISE 2006. Lecture Notes in Computer Science, vol 4255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11912873_48
Download citation
DOI: https://doi.org/10.1007/11912873_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48105-8
Online ISBN: 978-3-540-48107-2
eBook Packages: Computer ScienceComputer Science (R0)