Abstract
In this paper we present a solution called Materialized Aggregate List designed for the efficient storing and processing of long aggregate lists. An aggregate list contains aggregates, calculated from the data stored in the database. In our approach, once created, the aggregates are materialized for further use. The list structure contains a table divided into pages. We present three different page-filling algorithms used when the list is browsed. We present test results and we use them for estimating the best combination of the configuration parameters: number of pages, size of a single page and number of available database connections. The Materialized Aggregate List can be applied on every aggregation level in various indexing structures, such as, an aR-tree.
| Original language | English |
|---|---|
| Pages (from-to) | 190-199 |
| Number of pages | 10 |
| Journal | Lecture Notes in Computer Science |
| Volume | 3589 |
| DOIs | |
| Publication status | Published - 2005 |
| Event | 7th International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2005 - Copenhagen, Denmark Duration: 22 Aug 2005 → 26 Aug 2005 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science
Fingerprint
Dive into the research topics of 'On efficient storing and processing of long aggregate lists'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver