Addressing multidimensional arrays
Communications of the ACM
Communications of the ACM
A programming language
Algorithms for trie compaction
ACM Transactions on Database Systems (TODS)
Variable-depth trie index optimization: theory and experimental results
ACM Transactions on Database Systems (TODS)
A compendium of key search references
ACM SIGIR Forum
The on-line d-dimensional dictionary problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Heuristics for trie index minimization
ACM Transactions on Database Systems (TODS)
Performance evaluation of attribute-based tree organization
ACM Transactions on Database Systems (TODS)
Hashing and trie algorithms for partial match retrieval
ACM Transactions on Database Systems (TODS)
An attribute based model for database access cost analysis
ACM Transactions on Database Systems (TODS)
Tree Structures for Optimal Searching
Journal of the ACM (JACM)
A Modified List Technique Allowing Binary Search
Journal of the ACM (JACM)
The Complexity of Trie Index Construction
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Identifier Search Mechanisms: A Survey and Generalized Model
ACM Computing Surveys (CSUR)
Binary Search Trees and File Organization
ACM Computing Surveys (CSUR)
A comment on the double-chained tree
Communications of the ACM
A note on optimal doubly-chained trees
Communications of the ACM
Evaluation and selection of file organization—a model and system
Communications of the ACM
Design of tree structures for efficient querying
Communications of the ACM
File structures using hashing functions
Communications of the ACM
Variable length tree structures having minimum average search time
Communications of the ACM
Randomized binary search technique
Communications of the ACM
Information science in a Ph.D. computer science program
Communications of the ACM
Data manipulation and programming problems in automatic information retrieval
Communications of the ACM
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
A parts breakdown technique using list structures
Communications of the ACM
Performance of data structures for small sets of strings
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
An empirical comparison of B-trees, compact B-trees and multiway trees
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Modeling and performance evaluation of physical data base structures
ACM '76 Proceedings of the 1976 annual conference
A document retrieval system for man-machine interaction
ACM '64 Proceedings of the 1964 19th ACM national conference
Tree structures construction using key densities
ACM '75 Proceedings of the 1975 annual conference
A time-sharing budget control system
ACM '68 Proceedings of the 1968 23rd ACM national conference
An information system for the coordination of program design
ACM '66 Proceedings of the 1966 21st national conference
Binary search trees and file organization
SIGFIDET '72 Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control
Hybrid trees: A data structure for lists of keys
SIGFIDET '72 Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control
Improved Behaviour of Tries by the "Symmetrization" of the Source
DCC '02 Proceedings of the Data Compression Conference
Organization and maintenance of large ordered indexes
Software pioneers
Selectivity Estimation for String Predicates: Overcoming the Underestimation Problem
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
On the structure of dictionaries for compilers
ACM SIGPLAN Notices
Selection of file organization using an analytic model
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Information filtering and query indexing for an information retrieval model
ACM Transactions on Information Systems (TOIS)
Extracting unique rows of a bounded degree array using tries
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
Organization and maintenance of large ordered indices
SIGFIDET '70 Proceedings of the 1970 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
Access methods: a brief overview for the 1971 ACM SIGFIDET Workshop
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
Storage optimization of tree structured files representing descriptor sets
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
Binary B-trees for virtual memory
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
Comparing integer data structures for 32 and 64 bit keys
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
Minimum search tree structures for data partitioned into pages
IEEE Transactions on Computers
Analysis of a class of tries with adaptive multi-digit branching
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
| Hi-index | 48.38 |
In data processing problems, files are frequently used which must both be searched and altered. Binary search techniques are efficient for searching large files, but the associated file organization is not readily adapted to the file alterations. Conversely, a chained file allocation permits e 1 cient alteration but cannot be searched efficiently. A file organized into a tree-like structure is discussed, and it is shown that such a file may both be searched and altered with times proportional to s logs N, where N is the number of file items and s is a parameter of the tree. It is also shown that optimizing the value of s leads to a search time which is only 25 per cent slower than the binary search. The tree organization employs two data chains and may be considered to be a compromise between the organizations for the binary search and the chained file. The relation of the tree organization to multidimensional indexing and to the trie structure is also discussed.