The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
Communications of the ACM
Use of tree structures for processing files
Communications of the ACM
A compendium of key search references
ACM SIGIR Forum
An effective hash-based algorithm for mining association rules
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Background for association rules and cost estimate of selected mining algorithms
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
A Survey of Data Structures for Computer Graphics Systems
ACM Computing Surveys (CSUR)
Identifier Search Mechanisms: A Survey and Generalized Model
ACM Computing Surveys (CSUR)
Using a Hash-Based Method with Transaction Trimming for Mining Association Rules
IEEE Transactions on Knowledge and Data Engineering
An associative file store using fragments for run-time indexing and compression
SIGIR '80 Proceedings of the 3rd annual ACM conference on Research and development in information retrieval
A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Improved Behaviour of Tries by the "Symmetrization" of the Source
DCC '02 Proceedings of the Data Compression Conference
A graduate course in database management
ACM SIGMOD Record
Multiple choice tries and distributed hash tables
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An analysis of the height of tries with random weights on the edges
Combinatorics, Probability and Computing
Variable-length hash area entries
AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
Universal hash functions for an infinite universe and hash trees
Information Processing Letters
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Expandable open addressing hash table storage and retrieval
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
Gray code chaining: a high performance hashing algorithm for limited storage applications
International Journal of High Performance Systems Architecture
Position heaps: A simple and dynamic text indexing data structure
Journal of Discrete Algorithms
On-line construction of position heaps
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Analysis of a class of tries with adaptive multi-digit branching
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
pcApriori: scalable apriori for multiprocessor systems
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
On-line construction of position heaps
Journal of Discrete Algorithms
Bibliography on data base structures
ACM SIGMIS Database
| Hi-index | 48.22 |
A general method of file structuring is proposed which uses a hashing function to define tree structure. Two types of such trees are examined, and their relation to trees studied in the past is explained. Results for the probability distributions of path lengths are derived and illustrated.