File Organization: On the Selection of Random Access Index Points for Sequential Files.
Sakti P. Ghosh, Michael E. Senko:
File Organization: On the Selection of Random Access Index Points for Sequential Files.
J. ACM 16(1): 569-579(1969)@article{DBLP:journals/jacm/GhoshS69,
author = {Sakti P. Ghosh and
Michael E. Senko},
title = {File Organization: On the Selection of Random Access Index Points
for Sequential Files},
journal = {J. ACM},
volume = {16},
number = {1},
year = {1969},
pages = {569-579},
ee = {db/journals/jacm/GhoshS69.html, http://doi.acm.org/10.1145/321541.321546},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
CDROM Version: Load the CDROM "Volume 5 Issue 2, JACM, VLDB-J, POS, ..." and ...
DVD Version: Load ACM SIGMOD Anthology DVD 2" and ...
BibTeX
Online Edition
Citation Page
BibTeX
Referenced by
- David B. Lomet:
A Simple Bounded Disorder File Organization with Good Performance.
ACM Trans. Database Syst. 13(4): 525-551(1988)
- Witold Litwin, David B. Lomet:
The Bounded Disorder Access Method.
ICDE 1986: 38-48
- Aris M. Ouksel:
The Interpolation-Based Grid File.
PODS 1985: 20-27
- Walter A. Burkhard:
Interpolation-Based Index Maintenance.
PODS 1983: 76-89
- Per-Åke Larson:
Analysis of Index-Sequential Files with Overflow Chaining.
ACM Trans. Database Syst. 6(4): 671-680(1981)
- Douglas Comer:
The Ubiquitous B-Tree.
ACM Comput. Surv. 11(2): 121-137(1979)
- Dennis G. Severance, John V. Carlis:
A Practical Approach to Selecting Record Access Paths.
ACM Comput. Surv. 9(4): 259-272(1977)
BibTeX
Copyright © Sun May 17 00:05:18 2009
by Michael Ley (ley@uni-trier.de)