A common optimization technique in data warehouse environments is the use of materialized aggregates. Aggregate processing becomes complex, if partitions of aggregates or queries are materialized and reused later. Most problematic are the implication problems regarding the restriction predicates. We show that in the presence of hierarchies in a multidimensional environment an efficient algorithm can be given to construct - or to derive - an aggregate from one or more overlapping materialized aggregate partitions (set-derivability).
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:82891 |
| Date | 12 January 2023 |
| Creators | Albrecht, J., Günzel, H., Lehner, Wolfgang |
| Publisher | Springer |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/acceptedVersion, doc-type:conferenceObject, info:eu-repo/semantics/conferenceObject, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | 978-3-540-66458-1, 978-3-540-48298-7, 10.1007/3-540-48298-9_15 |
Page generated in 0.0023 seconds