1996
DOI: 10.1007/s007780050014
|View full text |Cite
|
Sign up to set email alerts
|

A predicate-based caching scheme for client-server database architectures

Abstract: Abstract. We propose a new client-side data-caching scheme for relational databases with a central server and multiple clients. Data are loaded into each client cache based on queries executed on the central database at the server. These queries are used to form predicates that describe the cache contents. A subsequent query at the client may be satisfied in its local cache if we can determine that the query result is entirely contained in the cache. This issue is called cache completeness. A separate issue, c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
85
0
2

Year Published

1999
1999
2020
2020

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 160 publications
(87 citation statements)
references
References 27 publications
0
85
0
2
Order By: Relevance
“…While not breaking new ground in caching strategies, we do apply it to a novel scenario of Semantic CEP where query performance over continuous event data can be punitive otherwise. Our caching algorithms for stream queries leverage existing state-of-the-art, resembling the global caching in [8,12], and partial query caching [15]. Other than caching query results for subsequent relational queries, we cache semantic query results for new data.…”
Section: Complex Event Processingmentioning
confidence: 99%
“…While not breaking new ground in caching strategies, we do apply it to a novel scenario of Semantic CEP where query performance over continuous event data can be punitive otherwise. Our caching algorithms for stream queries leverage existing state-of-the-art, resembling the global caching in [8,12], and partial query caching [15]. Other than caching query results for subsequent relational queries, we cache semantic query results for new data.…”
Section: Complex Event Processingmentioning
confidence: 99%
“…Some of them [10,12,19,36] dealt with relational queries while others [1,9,22] focused on caching for heterogeneous sources. Semantic caching [10] and predicate caching [19] were initially proposed in traditional client-server database architectures. Lee and Chu [22] focused on algorithms for choosing the best matching query in the context of semantic caching for range queries.…”
Section: Related Workmentioning
confidence: 99%
“…High level caching systems in which objects are not individually identified, but rather a set of objects together is identified with the query that generated it is called semantic caching [12] or predicate caching [25]. Our memory management is similar to the one present in semantic caching.…”
Section: High Level Cachingmentioning
confidence: 99%