Comparison of two approaches to processing long aggregates lists in spatial data warehouses
Abstract
In this paper we present a comparison of two approaches for storing and processing of long aggregates lists in a spatial data warehouse. An aggregates list contains aggregates, calculated from the data stored in the database. Our comparative criteria are: the efficiency of retrieving the aggregates and the consumed memory. The first approach assumes using a modified Java list supported with materialization mechanism. In the second approach we utilize a table divided into pages. For this approach we present three different multi-thread page-filling algorithms used when the list is browsed. When filled with aggregates, the pages are materialized. We also present test results comparing the efficiency of the two approaches.
Full Text:
PDFDOI: http://dx.doi.org/10.17951/ai.2006.4.1.149-160
Date of publication: 2006-01-01 00:00:00
Date of submission: 2016-04-27 10:15:05
Statistics
Total abstract view - 361
Downloads (from 2020-06-17) - PDF - 0
Indicators
Refbacks
- There are currently no refbacks.
Copyright (c) 2015 Annales UMCS Sectio AI Informatica
This work is licensed under a Creative Commons Attribution 4.0 International License.