Skip to main navigation Skip to search Skip to main content

On efficient storing and processing of long aggregate lists

  • Silesian University of Technology

Research output: Contribution to journal › Conference article › peer-review

13 Citations (Scopus)

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 languageEnglish
Pages (from-to)190-199
Number of pages10
JournalLecture Notes in Computer Science
Volume3589
DOIs
Publication statusPublished - 2005
Event7th 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