Generalized partial indexes
Praveen Seshadri, A. Swami · Proceedings - International Conference on Data Engineering · 2002
This paper demonstrates the use of generalized partial indexes for efficient query processing. We propose that partial indexes be built on those portions of the database that are statistically likely to be the most useful for query processing. We identify three classes of statistical information, and two levels at which it may be available. We describe indexing strategies that use this information to significantly improve average query performance. Results from simulation experiments demonstrate that the proposed generalized partial indexing strategies perform well compared to the traditional approach to indexing.>
Cited by 54 works. doi:10.1109/icde.1995.380355
Authors
References
- The Art of Computer Programming, Vol. 3: Sorting and Searching
- The art of computer programming. Vol.3: Sorting and searching
- On random 2?3 trees
- Proceedings of the International Conference on Very Large Data Bases
- Parallel sorting on a shared-nothing architecture using probabilistic splitting
- Physical database design for relational databases
- Single table access using multiple indexes: Optimization, execution, and concurrency control techniques
- On B-tree Indices for Skewed Distributions
- The case for partial indexes
- A Benchmark Comparison of DB2 and the DBC/1012.