article

Free access

Binary Search Trees and File Organization

Author:

J. NievergeltAuthors Info & Claims

ACM Computing Surveys (CSUR), Volume 6, Issue 3

Pages 195 - 207

https://doi.org/10.1145/356631.356634

Published: 01 September 1974 Publication History

PDF eReader

References

[1]

ADELSON-VELsKII, G. M.; AND LANDIS, YE. M. "An algorithm for the organization of information." Dokl. Akad. Naulc SSSR 146 (1962), 263-266 (Russian), English translation in Soviet Math. Dokl. 3 (1962), 1259-1262.

Google Scholar

[2]

BAYER, R., AND MCCREIGHT. "Organization and maintenance of large ordered indexes." Acla Informatica 1, 3 (1972), 173-189.

Google Scholar

[3]

BAYER, R. "Symmetric binary B-trees: data structure and maintenance algorithms." Acta Informalica 1, 4 (1972), 290-306.

Google Scholar

[4]

BRUNO, J.; AND COFFMAN, E. G. "Nearly optimal binary search trees." Proc. 1FIP Congress 71. North-Holland Publishing Co., Amsterdam 1972, 99-103.

Google Scholar

[5]

COFFMAN, E. G.; AND BRUNO, J. "On file structuring for non-uniform access frequencies." BIT 10 (1970), 443-456.

Google Scholar

[6]

FOSTER, C. C. "Information storage and retrieval using AVL trees." Proc. ACM 20th National Conf., 1965, 192-205.

Crossref

Google Scholar

[7]

FOSTER, C. C. "A generalization of AVL trees." Comm. ACM 16, 8 (August 1973), 513-517.

Crossref

Google Scholar

[8]

FREDKIN, E. "Trie memory." Comm. ACM 3, 9 (Sept. 1960), 490-500.

Crossref

Google Scholar

[9]

GhosH, S. P.; AND SENKO, M. E. "File organization: On the selection of random access index points for sequential files." J. ACM 16, 4 (Oct 1969), 569-579.

Crossref

Google Scholar

[10]

HUFFMAN, D. A. "A method for the construction of minimum redundancy codes." Proc. IRE, Vol. 40, (1952), 1098-1101.

Google Scholar

[11]

HIBBARD, T. "Some combinatorial properties of certain trees, with applications to searching and sorting." J. ACM 9, 1 (Jan. 1962), 13-28.

Crossref

Google Scholar

[12]

HOARE, C. A. R. "Algorithm 63, partition, and algorithms 64, Quicksort." Comm., ACM, 4, 7 (July 1961), 321.

Crossref

Google Scholar

[13]

HU, T. C. ; AND TUCKER, A. C. "Optimal computer search trees and variable-length alphabetic codes." SIAM J. Appl. Math. 21, 4 (Dec. 1971), 514-532.

Google Scholar

[14]

KNUtH, D. E. The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Addison-Wesley, Reading, Mass., 1968.

Crossref

Google Scholar

[15]

KNUTH, D. E. "Optimum binary search trees." Acta Informatica 1 (1971), 14-25.

Google Scholar

[16]

KNUTH, D. E. The Art of Computer Programming, Vol. 3: SortinG and Searching, Addison-Wesley, Reading, Mass., 1973.

Crossref

Google Scholar

[17]

KNOTT, G. D. "A balanced tree storage and retrieval algorithm. Proc. Symp. n Information Storage and Retrieval, Univ. Maryland, College Park, Md., 1971, 175- 196.

Crossref

Google Scholar

[18]

MORRIS, a . "Scatter storage techniques." Comm. ACM 11, 1 (Jan. 1968)., 38-44.

Crossref

Google Scholar

[19]

MUNTZ, R.; AND UZGALIS, R. "Dynamic storage allocation for binary search trees in a two-level memory." Proc. 4th Annual Princeton Conference, Princeton, N.J., 1970.

Google Scholar

[20]

NIEVERGELT, J.; AND WONG, C. K. "On binary search trees." Proc. IFIP Congress 71, North Holland Publ. Co., Amsterdam 1972, 91-98.

Google Scholar

[21]

NIEVERGELT, J. ; ANn TONG, C. K. "Upper bound,s for the total path length of binary trees." J. ACM 20, 1 (Jan. 1973), 1-6.

Crossref

Google Scholar

[22]

NIEVERGELT, J.; AND REINGOLD, E. M. "Binary search trees of bounded balance." SIAM J. Computing 2, 1 (March 1973), 33-43.

Google Scholar

[23]

SEVERANCE, D. G. "Identifier search mechanisms: a survey and generalized model." Computing Surveys 6, 3 (Sept. 1974), 175-194.

Crossref

Google Scholar

[24]

SUSSENGUTH, E. H. "Use of tree structures for processing files." Comm. ACM 6, 5 (May 1963), 272-279.

Crossref

Google Scholar

[25]

WALKER, W. A.; AND GOTLIEB, C. C. "A top-down algorithm for constructing nearly-optimal lexieographic trees." R. C. Read (ed.), Graph Theory and Computing, Academic Press, New York, 1972, 303- 323.

Google Scholar

[26]

WEINER, P. "On the heuristic design of binary search trees." Proc. 5th Annual Princeton Conference, Princeton, N.J., March 1971.

Google Scholar

[27]

WONG, C. K.; AND CHANG, S. K. "The generation and balancing of binary search trees." (to appear).

Google Scholar

Cited By

View all

Bruno RDe Prisco RDe Santis AVaccaro U(2024)Bounds and Algorithms for Alphabetic Codes and Binary Search TreesIEEE Transactions on Information Theory10.1109/TIT.2024.342869970:10(6974-6988)Online publication date: Oct-2024
https://doi.org/10.1109/TIT.2024.3428699
Liu YChen SMa LYang GWan K(2024)Real-Time Order Book Building and Snapshot Generating for High Frequency Trading on FPGA2024 IEEE 35th International Conference on Application-specific Systems, Architectures and Processors (ASAP)10.1109/ASAP61560.2024.00025(71-76)Online publication date: 24-Jul-2024
https://doi.org/10.1109/ASAP61560.2024.00025
Eroglu OYilmaz G(2014)A Terrain Referenced UAV Localization Algorithm Using Binary Search MethodJournal of Intelligent and Robotic Systems10.1007/s10846-013-9922-773:1-4(309-323)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1007/s10846-013-9922-7
Show More Cited By

Recommendations

Binary search trees and file organization
SIGFIDET '72: Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control

Binary search trees are an important technique for organizing large files, because they are efficient for both random and sequential access of records, and for modification of a file. Because of this, they have received a great deal of attention in ...
Multidimensional binary search trees used for associative searching

This paper develops the multidimensional binary search tree (or k-d tree, where k is the dimensionality of the search space) as a data structure for storage of information to be retrieved by associative searches. The k-d tree is defined and examples are ...
Self-adjusting binary search trees

The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an n-node splay tree, all ...

Comments

Information & Contributors

Information

Published In

ACM Computing Surveys Volume 6, Issue 3

Sept. 1974

55 pages

ISSN:0360-0300

EISSN:1557-7341

DOI:10.1145/356631

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1974

Published in CSUR Volume 6, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

58
Total Citations
View Citations
2,650
Total Downloads

Downloads (Last 12 months)283
Downloads (Last 6 weeks)18

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bruno RDe Prisco RDe Santis AVaccaro U(2024)Bounds and Algorithms for Alphabetic Codes and Binary Search TreesIEEE Transactions on Information Theory10.1109/TIT.2024.342869970:10(6974-6988)Online publication date: Oct-2024
https://doi.org/10.1109/TIT.2024.3428699
Liu YChen SMa LYang GWan K(2024)Real-Time Order Book Building and Snapshot Generating for High Frequency Trading on FPGA2024 IEEE 35th International Conference on Application-specific Systems, Architectures and Processors (ASAP)10.1109/ASAP61560.2024.00025(71-76)Online publication date: 24-Jul-2024
https://doi.org/10.1109/ASAP61560.2024.00025
Eroglu OYilmaz G(2014)A Terrain Referenced UAV Localization Algorithm Using Binary Search MethodJournal of Intelligent and Robotic Systems10.1007/s10846-013-9922-773:1-4(309-323)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1007/s10846-013-9922-7
Abdullah ANazir ASenapan MMeng SKaruppiah E(2014)Fast Multi-Keyword Range Search Using GPGPUGPU Computing and Applications10.1007/978-981-287-134-3_17(259-274)Online publication date: 12-Sep-2014
https://doi.org/10.1007/978-981-287-134-3_17
Ardalan AArdalan R(2009)A data structure for supply chain management systemsIndustrial Management & Data Systems10.1108/02635570910926636109:1(138-150)Online publication date: 30-Jan-2009
https://doi.org/10.1108/02635570910926636
Oh MBaik JKang SChoi H(2008)An Efficient Approach for QoS-Aware Service Selection Based on a Tree-Based AlgorithmProceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008)10.1109/ICIS.2008.8(605-610)Online publication date: 14-May-2008
https://dl.acm.org/doi/10.1109/ICIS.2008.8
Grune D(2006)Choosing a tag‐list algorithm for a compiler with special application to the ALEPH compilerSoftware: Practice and Experience10.1002/spe.43800907089:7(575-593)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380090708
Shneidebman B(2006)A review of design techniques for programs and dataSoftware: Practice and Experience10.1002/spe.43800604106:4(555-567)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380060410
Nievergelt J(2005)Trees as data and file structuresCAAP '8110.1007/3-540-10828-9_53(35-45)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-10828-9_53
Blaser ASchmutz H(2005)Data base research: A surveyData Base Systems10.1007/3-540-07612-3_3(44-113)Online publication date: 23-May-2005
https://doi.org/10.1007/3-540-07612-3_3
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.

References

Cited By

Recommendations