𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Data sufficiency for queries on cache

✍ Scribed by Oded Shmueli; Kurt Shoens

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
763 KB
Volume
65
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis

In distributed environments, replication of data provides improved availability, isolation between workloads with different characteristics, and improved performance through local access to data. The "real data" is server resident and by "local data" we refer to cached client data. We examine which data should be cached on behalf of a cached query. The minimum requirement for cached data for a query Q is that it enables answering Q locally. We consider the following: (i) Definitions of what data is cached for a cached query. (ii) Deciding whether cached data can be used to solve a "new" query. (iii) A simple class of caching rules. @ 1998 Elsevier Science B.V.

πŸ“œ SIMILAR VOLUMES

On caching search engine query results
On caching search engine query results
✍ E.P Markatos πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 150 KB

In this paper we explore the problem of Caching of Search Engine Query Results in order to reduce the computing and I/O requirements needed to support the functionality of a search engine of the World Wide Web. We study query traces from the EXCITE search engine and show that they have a significan

Oracles and Queries That Are Sufficient
Oracles and Queries That Are Sufficient for Exact Learning
✍ Nader H. Bshouty; Richard Cleve; Ricard GavaldΓ ; Sampath Kannan; Christino Tamon πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 605 KB

We show that the class of all circuits is exactly learnable in randomized expected polynomial time using weak subset and weak superset queries. This is a consequence of the following result which we consider to be of independent interest: circuits are exactly learnable in randomized expected polynom

Query containment for data integration s
Query containment for data integration systems
✍ Todd Millstein; Alon Halevy; Marc Friedman πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 213 KB

The problem of query containment is fundamental to many aspects of database systems, including query optimization, determining independence of queries from updates, and rewriting queries using views. In the data-integration framework, however, the standard notion of query containment does not suffic

Recursive query plans for data integrati
Recursive query plans for data integration
✍ Oliver M. Duschka; Michael R. Genesereth; Alon Y. Levy πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 204 KB

Generating query-answering plans for data integration systems requires to translate a user query, formulated in terms of a mediated schema, to a query that uses relations that are actually stored in data sources. Previous solutions to the translation problem produced sets of conjunctive plans, and w