Article

Free access

Non-uniform key distribution and address calculation sorting

Authors:

Michael E. Tarter,

Richard A. KronmalAuthors Info & Claims

ACM '66: Proceedings of the 1966 21st national conference

Pages 331 - 337

https://doi.org/10.1145/800256.810712

Published: 01 January 1966 Publication History

PDF eReader

Abstract

It is currently far from uncommon for researchers to be confronted with the problem of sorting large files of data, e.g., 20,000 items or keys. One sorting procedure, known as address calculation sorting, is a two stage process in which an address calculation function is constructed by a preliminary examination of the keys. This function is used to insert each key into a location, hopefully near its position in the final sorted file. This process has been referred to as “rough focusing.” In the second phase the tentatively inserted key is compared to its neighbors to assure that it has been inserted correctly in relation to previously processed keys. This is referred to as “fine focusing.”

References

[1]

N I AKHIEZER Theory, of approximation Ungar New York 1956

Google Scholar

[2]

I FLORES Analysis of internal computer sorting J ACM 8:41-80 January 1961

Digital Library

Google Scholar

[3]

I FLORES Computer time for address calculation sorting J ACM# 7:389-409

Digital Library

Google Scholar

[4]

C C GOTLIEB Sorting on computers Comm ACM 6:194-201 May 1963

Digital Library

Google Scholar

[5]

E J ISAAC R C SINGLETON Sorting by address calculation J ACM 3:169-174 July 1956

Digital Library

Google Scholar

[6]

R A KRONMAL M E TARTER Cumulative polygon address calculation sorting Proceedings of the 20th National Conference of the Association for Computing Machinery p 376-384 1965

Digital Library

Google Scholar

[7]

R A KRONMAL M E TARTER Address calculation sorting with minimal storage requirement Submitted for publication to the J ACM

Digital Library

Google Scholar

[8]

F J MASSEY The Kolmogorov-Smirnov test for goodness of fit Journal of American Statistical Association 46:68-78 March 1951

Crossref

Google Scholar

[9]

J F STEFFENSEN Interpolation Chelsea New York 1950

Google Scholar

Cited By

View all

Sorenson PTremblay JDeutscher R(2016)Key-To-Address Transformation TechniquesINFOR: Information Systems and Operational Research10.1080/03155986.1978.1173168516:1(1-34)Online publication date: 25-May-2016
https://doi.org/10.1080/03155986.1978.11731685
Lundberg EMcBride RRawson TMauritsen ROrmond TFisher LKronmal RGillespie M(1982)C2Journal of Medical Systems10.1007/BF009949056:5(501-518)Online publication date: Oct-1982
https://doi.org/10.1007/BF00994905
Gustafson RMinker JRosenfeld S(1971)Elements of the randomized combinatorial file structureProceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval10.1145/511285.511304(163-174)Online publication date: 1-Apr-1971
https://dl.acm.org/doi/10.1145/511285.511304
Show More Cited By

Index Terms

Non-uniform key distribution and address calculation sorting
1. Mathematics of computing
  1. Probability and statistics
    1. Distribution functions
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Sorting and searching

Recommendations

Computer Time for Address Calculation Sorting

For each item to be sorted by address calculation, a location in the file is determined by a linear formula. It is placed there if the location is empty. If there is an item at the specified location, a search is made to find the closest empty space to ...
A variation on sorting by address calculation

The principles of address calculation and merging are combined to yield an efficient sorting technique. Detailed flowcharts of the most important program steps are included. The characteristics of the proposed sort are discussed.
Uniform weak tractability

We introduce a new notion of tractability which is called uniform weak tractability. A problem is uniformly weakly tractable if the information complexity n(@e,d) of its d-variate component to be solved to within @e is not exponential in any positive ...

Comments

Information & Contributors

Information

Published In

ACM '66: Proceedings of the 1966 21st national conference

January 1966

545 pages

ISBN:9781450379151

DOI:10.1145/800256

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1966

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
210
Total Downloads

Downloads (Last 12 months)15
Downloads (Last 6 weeks)1

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sorenson PTremblay JDeutscher R(2016)Key-To-Address Transformation TechniquesINFOR: Information Systems and Operational Research10.1080/03155986.1978.1173168516:1(1-34)Online publication date: 25-May-2016
https://doi.org/10.1080/03155986.1978.11731685
Lundberg EMcBride RRawson TMauritsen ROrmond TFisher LKronmal RGillespie M(1982)C2Journal of Medical Systems10.1007/BF009949056:5(501-518)Online publication date: Oct-1982
https://doi.org/10.1007/BF00994905
Gustafson RMinker JRosenfeld S(1971)Elements of the randomized combinatorial file structureProceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval10.1145/511285.511304(163-174)Online publication date: 1-Apr-1971
https://dl.acm.org/doi/10.1145/511285.511304
Tarter MBlue RRosenberg A(1968)Estimation of the cumulative by fourier series methods and application to the insertion problemProceedings of the 1968 23rd ACM national conference10.1145/800186.810613(491-497)Online publication date: 1-Jan-1968
https://dl.acm.org/doi/10.1145/800186.810613

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Abstract

References

Cited By

Index Terms

Recommendations

Computer Time for Address Calculation Sorting

A variation on sorting by address calculation

Uniform weak tractability

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

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations