The case for partial indexes

Authors:
M. Stonebraker
Affiliations:
Department of Electrical Engineering and Computer Sciences, University of California, Berkeley,
Venue:
ACM SIGMOD Record
Year:
1989

Citing 0
Cited 26

Managing persistent objects in a multi-level store

SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Compensation-based on-line query processing

SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Caching transitive closures

CSC '91 Proceedings of the 19th annual conference on Computer Science
Informix under CONTROL: Online Query Processing

Data Mining and Knowledge Discovery
Partial Indexing for Nonuniform Data Distributions in Relational DBMS's

IEEE Transactions on Knowledge and Data Engineering
Online Dynamic Reordering for Interactive Data Processing

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
The Design of XPRS

VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Storage and Querying of E-Commerce Data

Proceedings of the 27th International Conference on Very Large Data Bases
Principles of Transaction-Based On-Line Reorganization

VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Online dynamic reordering

The VLDB Journal — The International Journal on Very Large Data Bases
Batched Processing for Information Filters

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
AGILE: adaptive indexing for context-aware information filters

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Updating a cracked database

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
The case for a wide-table approach to manage sparse relational data sets

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Just-in-time query retrieval over partially indexed data on structured P2P overlays

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Relational support for flexible schema scenarios

Proceedings of the VLDB Endowment
Content-based filtering for efficient online materialized view maintenance

Proceedings of the 17th ACM conference on Information and knowledge management
Online reorganization of databases

ACM Computing Surveys (CSUR)
Self-selecting, self-tuning, incrementally optimized indexes

Proceedings of the 13th International Conference on Extending Database Technology
Feeding frenzy: selectively materializing users' event feeds

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
CW2I: community data indexing for complex query processing

WAIM'10 Proceedings of the 11th international conference on Web-age information management
TI: an efficient indexing mechanism for real-time search on tweets

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Merging what's cracked, cracking what's merged: adaptive indexing in main-memory column-stores

Proceedings of the VLDB Endowment
Concurrency control for adaptive indexing

Proceedings of the VLDB Endowment
Adaptive indexing in modern database kernels

Proceedings of the 15th International Conference on Extending Database Technology
SMIX: self-managing indexes for dynamic workloads

Proceedings of the 25th International Conference on Scientific and Statistical Database Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current data managers support secondary and/or primary indexes on columns of relations. In this paper we suggest the advantages that result from indexes which contain only some of the possible values in a column of a relation.