Design of tree structures for efficient querying
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
Multi-attribute retrieval with combined indexes
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
An optimization problem on the selection of secondary keys
ACM '71 Proceedings of the 1971 26th annual conference
Algorithms for trie compaction
ACM Transactions on Database Systems (TODS)
Database performance evaluation in an indexed file environment
ACM Transactions on Database Systems (TODS)
Physical database design for relational databases
ACM Transactions on Database Systems (TODS)
An Automatic Physical Designer for Network Model Databases
IEEE Transactions on Software Engineering
Models for the Combined Logical and Physical Design of Databases
IEEE Transactions on Computers
Optimal Selection of Secondary Indexes
IEEE Transactions on Software Engineering
Expert design tools for physical database design
SIGBDP '90 Proceedings of the 1990 ACM SIGBDP conference on Trends and directions in expert systems
A compendium of key search references
ACM SIGIR Forum
On the automation of physical database design
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
The index suggestion problem for object database applications
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
ACM Computing Surveys (CSUR)
Current practice in the evaluation of multikey search algorithms
SIGIR '83 Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval
Estimating Block Selectivities for Physical Database Design
IEEE Transactions on Knowledge and Data Engineering
Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design
IEEE Transactions on Knowledge and Data Engineering
Query Optimization by Stored Queries
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
A Framework for Automating Physical Database Design
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Modeling on-line rebalancing with priorities and executing on parallel database systems
CASCON '96 Proceedings of the 1996 conference of the Centre for Advanced Studies on Collaborative research
Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution
IEEE Transactions on Knowledge and Data Engineering
A survey of physical database design methodology and techniques
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
An index selection method without repeated optimizer estimations
Information Sciences: an International Journal
Data mining-based materialized view and index selection in data warehouses
Journal of Intelligent Information Systems
Preserving SQL access control policies over published XML data
Proceedings of the 2009 EDBT/ICDT Workshops
Selecting materialized views for RDF data
ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering
Static and incremental selection of multi-table indexes for very large join queries
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
| Hi-index | 0.00 |
Given a file on a secondary store in which each record has several attributes, it is usually advantageous to build an index mechanism to decrease the cost of conducting transactions to the file. The problem of selecting attributes over which to index has been studied in the context of various storage structures and access assumptions. One algorithm to make an optimum index selection requires 2k steps in the worst case, where k is the number of attributes in the file. We examine the question of whether a more efficient algorithm might exist and show that even under a simple cost criterion the problem is computationally difficult in a precise sense. Our results extend directly to other related problems where the cost of the index depends on fixed values which are assigned to each attribute. Some practical implications are discussed.