Sciweavers

9683 search results - page 428 / 1937
» Predicting query performance
Sort
View
VLDB
2000
ACM
128views Database» more  VLDB 2000»
15 years 10 months ago
Concurrency in the Data Warehouse
When a data warehouse is loaded at night and queried during the day, there is no requirement for concurrent update and querying. However there are a number of situations where con...
Richard Taylor
VLDB
1995
ACM
194views Database» more  VLDB 1995»
15 years 10 months ago
Eager Aggregation and Lazy Aggregation
Efficient processing of aggregation queries is essential for decision support applications. This paper describes a class of query transformations, called eager aggregation and lat...
Weipeng P. Yan, Per-Åke Larson
VLDB
2002
ACM
126views Database» more  VLDB 2002»
15 years 6 months ago
FAS - A Freshness-Sensitive Coordination Middleware for a Cluster of OLAP Components
Data warehouses offer a compromise between freshness of data and query evaluation times. However, a fixed preference ratio between these two variables is too undifferentiated. Wit...
Uwe Röhm, Klemens Böhm, Hans-Jörg S...
SIGIR
2008
ACM
15 years 5 months ago
ResIn: a combination of results caching and index pruning for high-performance web search engines
Results caching is an efficient technique for reducing the query processing load, hence it is commonly used in real search engines. This technique, however, bounds the maximum hit...
Gleb Skobeltsyn, Flavio Junqueira, Vassilis Placho...
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
14 years 10 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...