Titlebook: Index Structures for Data Warehouses; Marcus Jürgens Book 2002 Springer-Verlag Berlin Heidelberg 2002 Aggregated Data Querying.Bitmap Inde

疏忽

AGGER

Techniques for Comparing Index Structures,ta certain classes of index structures perform fast, while for others other classes of index structures are more efficient. Sarawagi makes qualitative propositions for a comparison of index structures Sarawagi, 1997. The performance of query processing depends on various parameters which influence t

暖昧關(guān)系

Conclusion and Outlook,eries which are processed on data warehouses differ much from transactionoriented operational systems. The processing of range queries on multidimensional data is especially important for data warehouse systems. The main goal of this thesis is therefore to investigate what kind of index structures s

失望未來

ectropion

拱形面包

Aggregated Data in Tree-Based Index Structures,ated data in the inner nodes in detail, and it shows how the algorithms are modified to maintain and use the aggregated data. At the end of this chapter we present results of experiments where the extended structure with aggregated data in the inner nodes is compared with the standard structure without materialized aggregated data.

alabaster

嫻熟

0302-9743 -based index structures.- aggregated data in tree-based index structures.- performance models for tree-based index structures.- and techniques for comparing index structures.978-3-540-43368-2978-3-540-45935-4Series ISSN 0302-9743 Series E-ISSN 1611-3349

characteristic

Techniques for Comparing Index Structures, to two classes with altogether four distinct index structures: a tree-based index structure without aggregated data, a tree-based index structure with aggregated data and two bitmap index structures. This chapter closes with results of a detailed performance study.

figment