On estimating access costs in relational databases
Information Processing Letters
Approximating the number of unique values of an attribute without sorting
Information Systems
A general framework for computing block accesses
Information Systems
A modular user-oriented decision support for physical database design
Decision Support Systems
Optimizing the cost of relational queries using partial-relation schemes
Information Systems
Information Systems
Intelligent caching and indexing techniques for relational database systems
Information Systems
SIAM: statistics information access method
Information Systems
ACM SIGMOD Record
Optimization Strategies for Relational Queries
IEEE Transactions on Software Engineering
EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
Optimization of query evaluation algorithms
ACM Transactions on Database Systems (TODS)
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Estimating block accesses in database organizations: a closed noniterative formula
Communications of the ACM
A history and evaluation of System R
Communications of the ACM
Communications of the ACM
Approximating block accesses in database organizations
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
Methodology and Tools for Data Design
Methodology and Tools for Data Design
Computer-Aided Database Design: The Dataid Project
Computer-Aided Database Design: The Dataid Project
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
On-demand view materialization and indexing for network forensic analysis
NETB'07 Proceedings of the 3rd USENIX international workshop on Networking meets databases
Relational support for flexible schema scenarios
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
It is well known that the effectiveness of relational database systems is greatly dependent on the efficiency of the data access strategies. For this reason, much work has been devoted to the development of new access techniques, supported by adequate access structures such as the B/sup +/trees. The effectiveness of the B/sup +/tree also depends on the data distribution characteristics; in particular, poor performance results when the data show strong key value distribution unbalancing. The aim of this paper is to present the partial index: a new access structure that is useful in such cases of unbalancing, as an alternative to the B/sup +/tree unclustered indexes. The access structures are built in the physical design phase, and at execution (or compilation) time, the optimizer chooses the most efficient access path. Thus, integration of the partial indexing technique in the design and in the optimization process are also described.