A relational model of data for large shared data banks
Communications of the ACM
An optimization problem on the selection of secondary keys
ACM '71 Proceedings of the 1971 26th annual conference
SEQUEL: A structured English query language
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
View indexing in relational databases
ACM Transactions on Database Systems (TODS)
On the estimation of the number of desired records with respect to a given query
ACM Transactions on Database Systems (TODS)
The Complexity of Trie Index Construction
Journal of the ACM (JACM)
Analysis of Effectiveness of Retrieval in Clustered Files
Journal of the ACM (JACM)
Database cost analysis: a top-down approach
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Design and performance tools for data base systems
VLDB '77 Proceedings of the third international conference on Very large data bases - Volume 3
A survey of physical database design methodology and techniques
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Data structures and data accessing in data base systems past, present, future
IBM Systems Journal
| Hi-index | 0.00 |
A major problem to be considered in the design of a data base is that of index selection. In this paper we present a model of a data base together with a probabilistic model for the transactions conducted with the data base: queries and updates. We obtain characterizations of the optimal solution to the best choice of indices. An algorithm is shown to solve this problem, which, in a number of cases, has a running time of O(m log m), where m is the number of attributes of the file.