Sciweavers

6654 search results - page 213 / 1331
» Querying Faceted Databases
Sort
View
217
Voted
VLDB
2006
ACM
147views Database» more  VLDB 2006»
16 years 3 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
115
Voted
DEXA
2008
Springer
120views Database» more  DEXA 2008»
15 years 5 months ago
Compressing Very Large Database Workloads for Continuous Online Index Selection
The paper presents a novel method for compressing large database workloads for purpose of autonomic, continuous index selection. The compressed workload contains a small subset of ...
Piotr Kolaczkowski
338
Voted

Tutorial
905views
17 years 3 months ago
Location-aware Query Processing and Optimization
The wide spread use of cellular phones, handheld devices, and GPS-like technology enables location-aware environments where virtually all objects are aware of their locations. Loca...
199
Voted
ICDT
2009
ACM
119views Database» more  ICDT 2009»
16 years 4 months ago
Querying data sources that export infinite sets of views
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
Bogdan Cautis, Alin Deutsch, Nicola Onose
137
Voted
SIGMOD
2003
ACM
172views Database» more  SIGMOD 2003»
16 years 3 months ago
Dynamic Sample Selection for Approximate Query Processing
In decision support applications, the ability to provide fast approximate answers to aggregation queries is desirable. One commonly-used technique for approximate query answering ...
Brian Babcock, Surajit Chaudhuri, Gautam Das