A Tractable Query Cache by Approximation

Authors:
Daniel P. Miranker;Malcolm C. Taylor;Anand Padmanaban
Affiliations:
-;-;-
Venue:
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Year:
2002

Citing 15
Cited 2

On conjunctive queries containing inequalities

Journal of the ACM (JACM)
Subtree-elimination algorithms in deductive databases

Subtree-elimination algorithms in deductive databases
The implementation and performance evaluation of the ADMS query optimizer: integrating query result caching and matching

The implementation and performance evaluation of the ADMS query optimizer: integrating query result caching and matching
Some results on the containment and minimization of (in)equality queries

Information Processing Letters
Tractable reasoning via approximation

Artificial Intelligence
On-line warehouse view maintenance

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The complexity of querying indefinite data about linearly ordered domains

Journal of Computer and System Sciences - Special issue: dedicated to the memory of Paris Kanellakis
Rewriting queries using views in description logics

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of the containment problem for conjunctive queries with built-in predicates

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Algorithm 97: Shortest path

Communications of the ACM
Database Systems: The Complete Book

Database Systems: The Complete Book
Query Folding

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Conjunctive Query Containment Revisited

ICDT '97 Proceedings of the 6th International Conference on Database Theory
Optimal implementation of conjunctive queries in relational data bases

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Processing conjunctive predicates and queries

VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6

A method based on query caching and predicate substitution for the treatment of failing database queries

ICCBR'10 Proceedings of the 18th international conference on Case-Based Reasoning Research and Development
Cache-Based Query Processing for Search Engines

ACM Transactions on the Web (TWEB)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present the organization of a predicatebased query cache suitable for integration with agent-based heterogeneous database systems. The cache is managed using a tractable (sound and complete) query containment algorithm, yet there are no language restrictions placed on the applications. This is accomplished by introducing query approximation.Query approximation is a compilation technique where a query expression in a general query language is mapped to a query expression in a restricted language. We define a target language such that query containment can be tested in polynomial time. We specify the algorithms by which the query engine and the cache manager may negotiate a choice of approximation and the development of a query plan. We use two application workloads and the TPC-D benchmark queries to assess the value of the cache within the architecture of the InfoSleuth heterogeneous database system.