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

DIS

Performance Models for Tree-Based Index Structures,n order to design analytical models, three in literature well known performance models for index structures without aggregated data are used. We generalize the models such that they are applicable to model index structures with aggregated data Jürgens and Lenz, 1999a.

DRILL

Conclusion and Outlook,itmap indexes are the most promising structures. The R.-tree is well known for its robustness. Variants of the standard bitmap indexing techniques overcome the problem of space inefficiency and the problem of weak support for range queries.

可忽略

crescendo