DIS
发表于 2025-3-28 17:11:46
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
发表于 2025-3-28 20:32:34
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.
可忽略
发表于 2025-3-28 23:14:57
http://reply.papertrans.cn/47/4635/463426/463426_43.png
crescendo
发表于 2025-3-29 06:45:35
http://reply.papertrans.cn/47/4635/463426/463426_44.png