Download:
|
by Peter Scheuermann, Junho Shim, Radek Vingralek
http://140.115.82.191/old/warehouse/Article_2.PS
Add To MetaCart
Abstract:
Data warehouses store large volumes of data which are used frequently by decision support applications. Such applications involve complex queries. Query performance in such an environment is critical because decision support applications often require interactive query response time. Because data warehouses are updated infrequently, it becomes possible to improve query performance by caching sets retrieved by queries in addition to query execution plans. In this paper we report on the design of an intelligent cache manager for sets retrieved by queries called WATCHMAN, which is particularly well suited for data warehousing environment. Our cache manager employs two novel, complementary algorithms for cache replacement and for cache admission. WATCHMAN aims at minimizing query response time and its cache replacement policy swaps out entire retrieved sets of queries instead of individual pages. The cache replacement and admission algorithms make use of a profit metric, which considers for each retrieved set its average rate of reference, its size, and execution cost of the associated query. We report on a performance evaluation based on the TPC-D and
Citations
|
7715
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
377
|
Implementing Data Cubes Efficiently
– Harinarayan, Rajaraman, et al.
- 1996
|
|
221
|
Research problems in data warehousing
– Widom
- 1995
|
|
220
|
Maintenance of materialized views: Problems, techniques, and applications
– GUPTA, MUMICK
- 1995
|
|
212
|
The LRU-k Page Replacement Algorithm for Database Disk Buffering
– O’Neil, O’Neil, et al.
- 1993
|
|
160
|
Operating Systems Theory
– Coffman, Denning
- 1973
|
|
135
|
An Evaluation of Buffer Management Strategies for Relational Database Systems
– Chou, DeWitt
- 1985
|
|
135
|
A Predicate-based Caching Scheme for Client-Server Database Architectures
– Keller, Basu
- 1996
|
|
104
|
Aggregate-query processing in data warehousing environments
– Gupta, Harinarayan, et al.
- 1995
|
|
101
|
Principles of database buffer management
– Effelsberg, Haerder
- 1984
|
|
89
|
Data Placement in Bubba
– Copeland
- 1988
|
|
72
|
Implementation and performance evaluation of the ADMS query optimizer
– Chen, Roussopoulos
- 1993
|
|
51
|
Intelligent caching and indexing techniques for relational database systems
– Sellis
- 1988
|
|
39
|
Practical Predicate Placement
– Hellerstein
- 1994
|
|
31
|
Rdb/VMS: Developing the Data Warehouse
– Inmon, Kelley
- 1993
|
|
28
|
ªFlexible and Adaptable Buffer Management Techniques for Database Management Systems,º
– Faloutsos, Ng, et al.
- 1995
|
|
22
|
A performance study of query optimization algorithms on a database system supporting procedures
– Jhingran
- 1988
|
|
22
|
Moerkotte G.: Function Materialization in Object Bases: Design, Realization, and Evaluation
– Kemper, Kilger
- 1994
|
|
21
|
SNOWBALL: Scalable Storage on Networks of Workstations with Balanced Load
– Vingralek, Breitbart, et al.
- 1998
|
|
20
|
The 5 minute rule for trading memory for disk accesses and the 10 byte rule for trading memory for cpu time
– Gray, Putzolu
- 1987
|
|
11
|
The Set Query Benchmark
– O'Neil
- 1993
|
|
10
|
One Size Fits All” Database Architectures Do Not Work for DSS
– French
- 1995
|
|
10
|
Virtual Memory Transaction Management
– Stonebraker
- 1984
|
|
10
|
Disk cooling in parallel disk systems
– Scheuermann, Weikum, et al.
- 1994
|
|
7
|
Database Buffer Paging in Virtual Storage Systems
– Lang, Wood, et al.
- 1977
|
|
4
|
Solving Implication Problems in Database Applications
– Sun, Kamel, et al.
- 1989
|
|
1
|
The LRU-K page replacement algorithm for database disk buffering
– Roussopoulos, Chen, et al.
- 1993
|
