article

Replacement strategies for XQuery caching systems

Authors:

Elke A. RundensteinerAuthors Info & Claims

Data & Knowledge Engineering, Volume 49, Issue 2

Pages 145 - 175

https://doi.org/10.1016/j.datak.2003.10.002

Published: 01 May 2004 Publication History

Abstract

To improve the query performance over XML documents in a distributed environment, we develop a semantic caching system named ACE-XQ for XQuery queries. ACE-XQ applies innovative query containment and rewriting techniques to answer user queries using cached queries. We also design a fine-grained replacement strategy which records user access statistics at a finer granularity than the complete XML query regions. As a result, less frequently used XML view fragments are replaced to maintain a better utilization of the cache space. Extensive experimental results illustrate the performance improvement achieved by this strategy over the traditional one for a variety of situations.

References

[1]

{1} A. Deutsch, V. Tannen, Containment of regular path expressions under integrity constraints, in: 8th International Workshop on Knowledge Representation Meets Databases (KRDB), Rome, Italy, June 2001, pp. 1-11.]]

[2]

{2} P. Buneman, S. Davidson, W. Fan, C. Hara, Keys for XML, in: World Wide Web Conference (WWW10), Hong Kong, China, 2001, pp. 21-36.]]

[3]

{3} D. Calvanese, G.D. Giacomo, M. Lenzerini, M.Y. Vardi, View-based query processing for regular path queries with inverse, in: Symposium on Principles of Database Systems (PODS), Dallas, TX, May 2000, pp. 58-66.]]

[4]

{4} P. Cao, E.W. Felten, K. Li, Application-controlled file caching policies, in: Proceedings of the USENIX Summer 1994 Technical Conference, 1994, pp. 171-182.]]

[5]

{5} P. Cao, S. Irani, Cost aware WWW proxy caching algorithms, in: Proceedings of USENIX Symposium on Internet Technologies and Systems (USITS), 1997, pp. 193-206.]]

[6]

{6} M.J. Carey, M.J. Franklin, M. Zaharioudakis, Fine-grained sharing in a page server OODBMS, in: SIGMOD, Minneapolis, Minnesota, 1994, pp. 359-370.]]

[7]

{7} A.K. Chandra, P.M. Merlin, Optimal implementations of conjunctive queries in relational data bases, in: STOC, 1977, pp. 77-90.]]

[8]

{8} C.M. Chen, N. Roussopoulos, The implementation and performance evaluation of the ADMS query optimizer: integrating query result caching and matching, in: EDBT, Cambridge, UK, March 1994, pp. 323-336.]]

[9]

{9} L. Chen, E.A. Rundensteiner, ACE-XQ: a CachE-aware XQuery answering system, in: Proceedings of the 5th International Workshop on the Web and Databases (WebDB), Madison, WI, 2002, pp. 31-36.]]

[10]

{10} L. Chen, E.A. Rundensteiner, A semantic caching system for XQueries, Technical Report, Computer Science Department, WPI, 2003, in progress.]]

[11]

{11} L. Chen, E.A. Rundensteiner, S. Wang, XCache-a semantic caching system for XML queries, in: SIGMOD demonstration paper, Madison, WI, 2002, pp. 618.]]

[12]

{12} L. Chen, S. Wang, E.A. Rundensteiner, A fine-grained replacement strategy for XML query cache, in: 4th International Workshop on Web Information and Data Management (WIDM'02), McLean, Virginia, November 2002, pp. 76-83.]]

Digital Library

[13]

{13} E.G. Coffman, P.J. Denning, Operating Systems Theory, Prentice-Hall International Editions, 1973.]]

[14]

{14} S. Dar, M.J. Franklin, B. Jonsson, Semantic data caching and replacement, in: VLDB, Bombay, India, 1996, pp. 330-341.]]

[15]

{15} A. Deutsch, M. Fernandez, D. Florescu, A. Levy, D. Suciu, A query language for XML, in: Proceedings of the 8th International World Wide Web Conference (WWW-8), Toronto, Canada, vol. 31, 1999, pp. 1155-1169.]]

Digital Library

[16]

{16} D. DeWitt, P. Futtersack, D. Maier, F. Velez, A study of three alternative workstation-server architectures for object-oriented database systems, in: VLDB, Queensland, Australia, August 1990, pp. 107-121.]]

[17]

{17} D. Florescu, A. Levy, D. Suciu, Query containment for conjunctive queries with regular expressions, in: Symposium on Principles of Database Systems (PODS), Seattle, WA, June 1998, pp. 139-148.]]

[18]

{18} G. Miklau, D. Suciu, Containment and equivalence for an XPath fragment, in: Symposium on Principles of Database Systems (PODS), Madison, WI, June 2002, pp. 65-76.]]

[19]

{19} H. Hosoya, B.C. Pierce, XDuce: a typed XML processing language, in: WebDB, Dallas, TX, May 2000, pp. 111-116.]]

[20]

{20} H. Hosoya, J. Vouillon, B.C. Pierce, Regular expression types for XML, Montreal, Canada, in: International Conference on Functional Programming (ICFP), 2000, pp. 11-22.]]

[21]

{21} L.M. Haas, D. Kossmann, I. Ursu, Loading a cache with query results, in: Proceedings of the 25th VLDB Conference, Edinburgh, Scotland, 1999, pp. 351-362.]]

[22]

{22} V. Hristidis, M. Petropoulos. Semantic caching of XML databases, in: 5th International Workshop on the Web and Databases (WebDB), Madison, WI, June 2002, pp. 25-30.]]

[23]

{23} T. Johnson, D. Shasha, 2Q: a low overhead high performance buffer management replacement algorithm, in: Proceedings of the 20th International Conference on VLDB, 1994, pp. 439-450.]]

[24]

{24} A.M. Keller, J. Basu, A predicate-based caching scheme for client server database architectures, The VLDB Journal 5 (1) (1996) 35-47.]]

Digital Library

[25]

{25} L. Breslau, P. Cao, L. Fan, G. Phillips, The implications of Zipfs Law for Web caching, in: WWW Caching Workshop, Wisconsin, MI, June 1998.]]

[26]

{26} L. Breslau, P. Cao, L. Fan, G. Phillips, Web caching and Zipf-like distributions: evidence and implications, in: INFOCOM (1), New York, NY, 1999, pp. 126-134.]]

[27]

{27} P.A. Larson, H.Z. Yang, Computing queries from derived relation, in: VLDB, Stockholm, Sweden, August 1985, pp. 259-269.]]

[28]

{28} D. Lee, J. Choi, S.H. Noh, S.L. Min, Y. Cho, C.S. Kim, On the existence of a spectrum of policies that subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) policies, in: Proceedings of the 1999 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, 1999, pp. 134-143.]]

Digital Library

[29]

{29} A. Levy, A. Mendelzon, Y. Sagiv, D. Srivastava, Answering queries using views, in: PODS, San Jose, CA, June 1995, pp. 95-104.]]

[30]

{30} M. Fernandez, J. Simeon, P. Wadler, A semi-monad for semi-structured data, in: ICDT, London, UK, January 2001, pp. 263-300.]]

[31]

{31} G.W. Manger, A generic algorithm for merging SGML/XML-instances, in: XMLEurope 2001, Berlin, Germany, 2001.]]

[32]

{32} I. Manolescu, D. Florescu, D. Kossmann, Answering XML queries on heterogeneous data sources, in: Proceedings of the 27th VLDB Conference, Edinburgh, Scotland, 2001, pp. 241-250.]]

[33]

{33} E.J. O Neil, P.E. O Neil, G. Weikum, The LRU-K page replacement algorithm for database disk buffering, in: SIGMOD, pp. 297-306, 1993.]]

[34]

{34} Y. Papakonstantinou, V. Vassalos, Query rewriting for semistructured views, in: SIGMOD, Philadelphia, PA, 1999, pp. 455-466.]]

Digital Library

[35]

{35} V. Phalke, B. Gopinath, An inter-reference gap model for temporal locality in program behavior, in Proceedings of the 1995 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, 1995, pp. 291-300.]]

Digital Library

[36]

{36} J. Robie, J. Lapp, D. Schach, XML Query Language (XQL). Available from 〈http://www.w3.org/TandS/QL/ QL98/pp/xql.html〉.]]

[37]

{37} J.T. Robinson, M.V. Devarakonda, Data cache management using frequency-based replacement, in: SIGMETRICS Conference on Measurement and Modeling of Computer Systems, 1990, pp. 134-142.]]

[38]

{38} M. Stonebraker, A. Jhingran, J. Goh, S. Potamianos, On rules, procedures, caching and views in DataBase systems, in: SIGMOD, Atlantic City, NJ, May 1990, pp. 281-290.]]

Digital Library

[39]

{39} I. Tatarinov, Z.G. Ives, A.Y. Halevy, D.S. Weld, Updating XML, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Santa Barbara, CA, May 2001, pp. 413-424.]]

[40]

{40} V. Benzaken, G. Castagna, A. Frisch, Regular language description for XML (RELAX), Technical Report, ISO/ IEC DTR 22250-1, 2001.]]

[41]

{41} V. Benzaken, G. Castagna, A. Frisch, Semantic subtyping, in: IEEE Symposium on Logic in Computer Science (LICS'2002), Copenhagen, Denmark, July 2002, pp. 137-146.]]

[42]

{42} W3C. XML query use cases, W3C Working Draft 02, May, 2003. Available from 〈http://www.w3.org/TR/xqueryuse-cases〉.]]

[43]

{43} W3C. XML Path Language (XPath)Version 1.0. W3C Recommendation. Available from 〈http://www.w3.org/TR/ xpath.html〉, March 2000.]]

[44]

{44} W3C. XQuery 1.0: An XML Query Language. Available from 〈http://www.w3.org/TR/xquery/〉, December 2001.]]

[45]

{45} S.A. Yahia, S. Cho, L.V. Lakshmanan, D. Srivastava, Minimization of tree pattern queries, in: SIGMOD, Santa Barbara, CA, June 2001, pp. 497-508.]]

[46]

{46} N. Yong, On-line caching as cache size varies, in: The 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, 1991, pp. 241-250.]]

Cited By

Chen LRundensteiner EEllis AHagino T(2005)XQuery containment in presence of variable binding dependenciesProceedings of the 14th international conference on World Wide Web10.1145/1060745.1060789(288-297)Online publication date: 10-May-2005
https://dl.acm.org/doi/10.1145/1060745.1060789

Index Terms

Replacement strategies for XQuery caching systems
1. Information systems
  1. Information retrieval
    1. Information retrieval query processing
    2. Retrieval models and ranking
  2. Information storage systems

Recommendations

A fine-grained replacement strategy for XML query cache
WIDM '02: Proceedings of the 4th international workshop on Web information and data management

Caching popular queries and reusing results of previously computed queries is one important query optimization technique, especially in modern distributed environments such as the WWW. Based on the recent proliferation of XML data and the emergence of ...
Cache Invalidation and Replacement Strategies for Location-Dependent Data in Mobile Environments

Mobile location-dependent information services (LDISs) have become increasingly popular in recent years. However, data caching strategies for LDISs have thus far received little attention. In this paper, we study the issues of cache invalidation and ...
Counter-Based Cache Replacement and Bypassing Algorithms

Recent studies have shown that in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large, motivating the design of alternative replacement algorithms to improve ...

Comments

Information & Contributors

Information

Published In

cover image Data & Knowledge Engineering

Data & Knowledge Engineering Volume 49, Issue 2

Special issue: WIDM 2002

May 2004

94 pages

ISSN:0169-023X

Issue’s Table of Contents

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 May 2004

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chen LRundensteiner EEllis AHagino T(2005)XQuery containment in presence of variable binding dependenciesProceedings of the 14th international conference on World Wide Web10.1145/1060745.1060789(288-297)Online publication date: 10-May-2005
https://dl.acm.org/doi/10.1145/1060745.1060789

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents