article

Free access

File Organization: On the Selection of Random Access Index Points for Sequential Files

Authors:

S. P. Ghosh,

M. E. SenkoAuthors Info & Claims

Journal of the ACM (JACM), Volume 16, Issue 4

Pages 569 - 579

https://doi.org/10.1145/321541.321546

Published: 01 October 1969 Publication History

PDF eReader

Abstract

The construction of a hierarchy of indexes (the indexed sequential access method) is one means of providing rapid random access to sequential files. An examination is made of the consequences of partially or completely replacing one or more index levels by linear interpolation procedures. For all possible configurations of the several types of key distributions investigated, linear interpolation on the average provides significant performance improvements. Typically, the two accesses required to obtain track index and data are reduced to 1.1 to 1.7 accesses per record. Extremely unusual key distribution will, however, raise the number of accesses required above 2.

Reference

[1]

MOOD, A.M. Introduction to the Theory of Statistics. McGraw-Hill, New York, 1963.

Google Scholar

Cited By

View all

Güting RDieker SGüting RDieker S(2003)Externes Suchen und SortierenDatenstrukturen und Algorithmen10.1007/978-3-322-91882-6_8(295-315)Online publication date: 2003
https://doi.org/10.1007/978-3-322-91882-6_8
Wright WJeyartnam S(1993)Success rate of interpolation in subsegment predictionSoftware—Practice & Experience10.1002/spe.438023030323:3(243-253)Online publication date: 1-Mar-1993
https://dl.acm.org/doi/10.1002/spe.4380230303
Güting RGüting R(1992)Externes Suchen und SortierenDatenstrukturen und Algorithmen10.1007/978-3-322-92105-5_8(267-286)Online publication date: 1992
https://doi.org/10.1007/978-3-322-92105-5_8
Show More Cited By

Index Terms

File Organization: On the Selection of Random Access Index Points for Sequential Files
1. Information systems
  1. Information retrieval
    1. Document representation
    2. Search engine architectures and scalability
      1. Search engine indexing
  2. Information storage systems
    1. Record storage systems
      1. Record storage alternatives
2. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        File systems management

Recommendations

Index compression is good, especially for random access
CIKM '07: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management

Index compression techniques are known to substantially decrease the storage requirements of a text retrieval system. As a side-effect, they may increase its retrieval performance by reducing disk I/O overhead. Despite this advantage, developers ...
The algorithm sequential access method: an alternative to index sequential

A requirement of many computer file processing systems is the ability to access data stored on a direct access storage device (DASD) both sequentially and randomly. A popular method which provides both types of access is the index sequential ...
An efficient random access inverted index for information retrieval
WWW '10: Proceedings of the 19th international conference on World wide web

To improve query performance and space efficiency, an efficient random access blocked inverted index (RABI) is proposed. RABI divides an inverted list into blocks and compresses different part of each block with the corresponding encoding method to ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 16, Issue 4

Oct. 1969

132 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/321541

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1969

Published in JACM Volume 16, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
653
Total Downloads

Downloads (Last 12 months)63
Downloads (Last 6 weeks)11

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Güting RDieker SGüting RDieker S(2003)Externes Suchen und SortierenDatenstrukturen und Algorithmen10.1007/978-3-322-91882-6_8(295-315)Online publication date: 2003
https://doi.org/10.1007/978-3-322-91882-6_8
Wright WJeyartnam S(1993)Success rate of interpolation in subsegment predictionSoftware—Practice & Experience10.1002/spe.438023030323:3(243-253)Online publication date: 1-Mar-1993
https://dl.acm.org/doi/10.1002/spe.4380230303
Güting RGüting R(1992)Externes Suchen und SortierenDatenstrukturen und Algorithmen10.1007/978-3-322-92105-5_8(267-286)Online publication date: 1992
https://doi.org/10.1007/978-3-322-92105-5_8
Aoe J(1990)A compendium of key search referencesACM SIGIR Forum10.1145/101306.10130824:3(26-42)Online publication date: 1-Nov-1990
https://dl.acm.org/doi/10.1145/101306.101308
Lomet D(1988)A simple bounded disorder file organization with good performanceACM Transactions on Database Systems10.1145/49346.5006713:4(525-551)Online publication date: 1-Oct-1988
https://dl.acm.org/doi/10.1145/49346.50067
Ghosh S(1988)SIAM: statistics information access methodInformation Systems10.1016/0306-4379(88)90003-813:4(359-368)Online publication date: 1-Oct-1988
https://dl.acm.org/doi/10.1016/0306-4379%2888%2990003-8
Litwin WLomet D(1987)A New Method for Fast Data Searches with KeysIEEE Software10.1109/MS.1987.2300924:2(16-24)Online publication date: 1-Mar-1987
https://dl.acm.org/doi/10.1109/MS.1987.230092
Miller LLiang TWalker TDominick W(1985)The role of parellelism in file organizationProceedings of the 1985 ACM thirteenth annual conference on Computer Science10.1145/320599.320720(381-388)Online publication date: 1-Mar-1985
https://dl.acm.org/doi/10.1145/320599.320720
Burkhard WFagin RBernstein P(1983)Interpolation-based index maintenanceProceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems10.1145/588058.588070(76-89)Online publication date: 21-Mar-1983
https://dl.acm.org/doi/10.1145/588058.588070
Burkhard W(1983)Interpolation-based index maintenanceBIT10.1007/BF0193445723:3(274-294)Online publication date: Sep-1983
https://doi.org/10.1007/BF01934457
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Reference

Cited By

Index Terms

Recommendations

Index compression is good, especially for random access

The algorithm sequential access method: an alternative to index sequential

An efficient random access inverted index for information retrieval

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations