Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Rewriting queries using views in description logics
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
Cache investment: integrating query optimization and distributed data placement
ACM Transactions on Database Systems (TODS)
Loading a Cache with Query Results
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Strategies for Semantic Caching
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Physical Data Independence, Constraints, and Optimization with Universal Plans
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Cache-Based Query Processing for Search Engines
ACM Transactions on the Web (TWEB)
Adaptive range filters for cold data: avoiding trips to Siberia
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
We propose new client-side data caching scheme for relatonal databases with a central server and multiple clients. Data is loaded into a client cache based on queries, which are used to form predicates describing 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”. On the other hand, &lsuo;cache currency” deals with the effect of updates at the central database on the client caches. We examine various performance and optimization issues involved in addressing the questions of cache currency and completeness using predicate descriptions. Expected benefits of our approach over commonly used object ID-based caching include lower query response times, reduced message traffic, higher server throughput, and better scalability.