A fine-grained replacement strategy for XML query cache

Chen, Li; Wang, Song; Cash, Elizabeth; Ryder, Burke; Hobbs, Ian; Rundensteiner, Elke A.

doi:10.1145/584931.584947

Cited by 12 publications

(12 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, when replacement is needed, individual paths of the fragment answering a query are also considered as candidates for replacement, besides the whole fragment. Such a partial replacement strategy was shown to be beneficial for caching XPath queries [7]. For example, consider In the case of IndexCache, cache overflow is caused, when after a cache miss of some local query Q, a peer p whose local cache has reached its maximum capacity Cp, attempts to cache the result fragment of Q.…”

Section: Replacement Policymentioning

confidence: 99%

“…XML caching in a typical client-server environment is discussed in [7,14,19]. XML caching, as related to view materialization and view subsumption, has been the focus of much current research.…”

Section: Related Workmentioning

confidence: 99%

“…increase, caching results of previous queries can substantially reduce the communication and computational cost of processing them in a distributing setting. Caching schemes for XML databases usually follow a semantic approach [7,8,14]: cached data are not organized at the tuple, page or document level but instead at the level of query descriptors. In abstract terms, the answers of previous queries are stored in cache along with the associated query analogously to materializing a view.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Cooperative XPath caching

Lillis

Pitoura

2008

Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data

View full text Add to dashboard Cite

Motivated by the fact that XML is increasingly being used in distributed applications, we propose building a cooperative caching scheme for XML documents. Our scheme allows sharing cache content among a number of peers. To facilitate sharing, a distributed prefix-based index is built based on the queries whose results are cached. In the loosely-coupled sharing approach, each peer stores in its local cache results of its own queries and just publishes the associated queries to the index. In the tightly-coupled approach, each peer is assigned a specific part of the query space and stores in its local cache the results of the corresponding queries. Both approaches result in a dynamic organization of content that evolves over time based on the query load, the number of peers and the overall storage available. We present a number of associated design choices such as using a DHT for distributing the prefix-based index and a proactive cache replacement policy. We also report on a number of experiments that show the benefits of cooperative caching and highlight the pros and cons of loosely and tightly coupled cache sharing.

show abstract

Section: Replacement Policymentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Cooperative XPath caching

Lillis

Pitoura

2008

Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data

View full text Add to dashboard Cite

show abstract

“…This work is motivated by the promising application of semantic caching for answering XML queries using cached XML views [6,8]. The idea of semantic caching is that the (mobile) client maintains both the semantic descriptions and associated answers of previous queries in its cache, in the hope of being able to reuse them to speed up the processing of subsequent queries.…”

Section: Motivationmentioning

confidence: 99%

“…The main techniques exploited by ACE-XQ include the containment mapping approach for nested XQuery, XQuery rewriting, and a multi-granularity replacement strategy. With [8] focussed on the proposed replacement strategy and the cache performance evaluation, we introduce, in this paper, the fundamental query containment technique underlining ACE-XQ which is the first comprehensive practical semantic cache solution for handling nested conjunctive XQuery.…”

Section: Motivationmentioning

confidence: 99%

XQuery containment in presence of variable binding dependencies

Chen

Rundensteiner

2005

Proceedings of the 14th International Conference on World Wide Web - WWW '05

Self Cite

View full text Add to dashboard Cite

Semantic caching is an important technology for improving the response time of future user queries specified over remote servers. This paper deals with the fundamental query containment problem in an XQuery-based semantic caching system. To our best knowledge, the impact of subtle differences in XQuery semantics caused by different ways of specifying variables on query containment has not yet been studied. We introduce the concept of variable binding dependencies for representing the hierarchical element dependencies preserved by an XQuery. We analyze the problem of XQuery containment in the presence of such dependencies. We propose a containment mapping technique for nested XQuery in presence of variable binding dependencies. The implication of the nested block structure on XQuery containment is also considered. We mention the performance gains achieved by a semantic caching system we build based on the proposed technique.

show abstract

Caching Frequent XML Query Patterns

Zhan

Wang

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A fine-grained replacement strategy for XML query cache

Cited by 12 publications

References 9 publications

Cooperative XPath caching

Cooperative XPath caching

XQuery containment in presence of variable binding dependencies

Caching Frequent XML Query Patterns

Contact Info

Product

Resources

About