ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Performance Measures for Ordered Lists in Random-Access Files
Full text PdfPdf (701 KB)
Source Journal of the ACM (JACM) archive
Volume 26 ,  Issue 4  (October 1979) table of contents
Pages: 654 - 667  
Year of Publication: 1979
ISSN:0004-5411
Authors
Haim Mendelson  Graduate School of Management, University of Rochester, Rochester, NY and Tel Aviv University, Tel Aviv, Israel
Uri Yechiali  Department of Statistics, Tel Aviv University, Tel Aviv, Israel
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 23,   Citation Count: 2
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322154.322159
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
L. R. Johnson, An indirect chaining method for addressing on secondary keys, Communications of the ACM, v.4 n.5, p.218-222, May 1961  [doi>10.1145/366532.366540]
 
2
Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
3
V. Y. Lum , P. S. T. Yuen , M. Dodd, Key-to-address transform techniques: a fundamental performance study on large existing formatted files, Communications of the ACM, v.14 n.4, p.228-239, April 1971  [doi>10.1145/362575.362578]
4
Robert Morris, Scatter storage techniques, Communications of the ACM, v.11 n.1, p.38-44, Jan. 1968  [doi>10.1145/362851.362882]
 
5
PETERSON. W W Addressing for random-access storage IBM J Res and Develop 1 (1957), 130--146
 
6
VAN DER POOL. J A Opttmum storage allocauon for mmal loading of a file IBM J Res and Develop 16 (1972), 579-586

CITED BY  2
Haim Mendelson , Uri Yechiali, A New Approach to the Analysis of Linear Probing Schemes, Journal of the ACM (JACM), v.27 n.3, p.474-483, July 1980
Jun-ichi Aoe, A compendium of key search references, ACM SIGIR Forum, v.24 n.3, p.26-42, Fall 1990

INDEX TERMS

Primary Classification:
  E. Data
  E.1 DATA STRUCTURES
      Subjects: Lists, stacks, and queues

Additional Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.3 Information Search and Retrieval
          Subjects: Retrieval models


General Terms:
Management, Measurement, Performance, Theory, Verification

Collaborative Colleagues:
Haim Mendelson: colleagues
Uri Yechiali: colleagues

Peer to Peer - Readers of this Article have also read:

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2008 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player