The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Retrospection on a database system
ACM Transactions on Database Systems (TODS)
An attribute based model for database access cost analysis
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Some experiments in directory organization - a simulation study
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
Efficient algorithms for selecting efficient data storage structures
Efficient algorithms for selecting efficient data storage structures
An analytic model of physical databases
An analytic model of physical databases
A Physical Database Design Evaluation System for CODASYL Databases
IEEE Transactions on Software Engineering
A compendium of key search references
ACM SIGIR Forum
Optimal file designs and reorganization points
ACM Transactions on Database Systems (TODS)
A unifying model of physical databases
ACM Transactions on Database Systems (TODS)
An Efficient Buffer Management Scheme for Implementing a B-Tree on NAND Flash Memory
ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
Data & Knowledge Engineering
Massive concurrent deletion of keys in b*-tree
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
| Hi-index | 0.00 |
An analytic method for comparing the performance of B+ trees and indexed sequential files is proposed. Preliminary results indicate that indexed sequential files may be more efficient than B+ trees in certain applications.