The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
An attribute based model for database access cost analysis
ACM Transactions on Database Systems (TODS)
Performance evaluation of a relational associative processor
ACM Transactions on Database Systems (TODS)
A Note on the Efficiency of Hashing Functions
Journal of the ACM (JACM)
On the Optimality of the Probability Ranking Scheme in Storage Applications
Journal of the ACM (JACM)
The independence of miss ratio on page size
Journal of the ACM (JACM)
Identifier Search Mechanisms: A Survey and Generalized Model
ACM Computing Surveys (CSUR)
Approximating block accesses in database organizations
Communications of the ACM
On self-organizing sequential search heuristics
Communications of the ACM
A stochastic evaluation model for database organizations in data retrieval systems
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
Attribute based file organization in a paged memory environment
Communications of the ACM
Communications of the ACM
Communications of the ACM
An indirect chaining method for addressing on secondary keys
Communications of the ACM
Distributed query processing in a relational data base system
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Computer Database Organization, 2nd Ed
Computer Database Organization, 2nd Ed
Exploiting parallelism in a Relational Associative Processor
CAW '78 Proceedings of the fourth workshop on Computer architecture for non-numeric processing
Some generalized modeling structures for use in design of file organizations.
Some generalized modeling structures for use in design of file organizations.
Deterministic Learning Automata Solutions to the Equipartitioning Problem
IEEE Transactions on Computers
A linear-time probabilistic counting algorithm for database applications
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
The relative placement of records in a database has a significant impact on the overall system performance. In this paper we study three related assignment problems. They are (1) the assignment of records to devices so as to minimize the expected completion time and to maximize the expected utilization of the devices, (2) the assignment of records to pages or blocks in secondary memory so as to minimize the number of blocks to be accessed, and (3) the analysis of the performance of a hashing scheme under the assumption that the record-to-bucket probability varies from one bucket to another. The solutions to these problems are obtained by studying an occupancy problem. In each case, an optimal solution is obtained.