Generalized Partial Indexes (1995) [16 citations — 0 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Praveen Seshadri and Arun Swami},
title = {Generalized Partial Indexes},
booktitle = {In ICDE},
year = {1995},
pages = {420--427},
publisher = {IEEE Computer Society}
}
Bookmarks
OpenURL
Abstract:
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. 1 Introduction In traditional database systems, indexes are used primarily for the efficient associative retrieval of data. The database administrator (DBA) chooses to build indexes on selected columns of tuples in an RDBMS (or members of objects in an OODBMS) to speed up queries that apply predicates to those columns 1 . The choice of indexes is influenced by the number ...
Citations
| 290 | The Art of Computer Programming, Vol.3: Sorting and Searching – Knuth - 1973 |
| 70 | Parallel Sorting on a Shared-Nothing Architecture Using Probabilistic Splitting – DeWitt, Naughton, et al. - 1991 |
| 52 | Physical database design for relational databases – Finkelstein, Schkolnick, et al. - 1988 |
| 36 | On B-tree indices for skewed distributions – Faloutsos, Jagadish - 1992 |
| 1 | DB2 System Planning Administration Guide – Corporation, Plains, et al. - 1993 |
