Time complexity of page filling algorithms in Materialized Aggregate List (MAL) and MAL/TRIGG materialization cost

Abstract

The Materialized Aggregate List (MAL) enables effective storing and processing of long aggregates lists. The MAL structure contains an iterator table divided into pages that stores adequate number of aggregates. Time complexity of three algorithms was calculated and, in comparison with experimental results, the best configuration of MAL parameters (number of pages, single page size and number of database connections) was estimated. MAL can be also applied to every aggregation level in different indexing structures, like for instance the aR-tree