Optimal self-adjusting trees for dynamic string data in secondary storage

Authors:
Pang Ko;Srinivas Aluru
Affiliations:
Department of Electrical and Computer Engineering, Iowa State University;Department of Electrical and Computer Engineering, Iowa State University
Venue:
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Year:
2007

Citing 13
Cited 5

Self-adjusting binary search trees

Journal of the ACM (JACM)
An evaluation of self-adjusting binary search tree techniques

Software—Practice & Experience
Efficient suffix trees on secondary storage

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Reducing the space requirement of suffix trees

Software—Practice & Experience
On the sorting-complexity of suffix tree construction

Journal of the ACM (JACM)
Space efficient suffix trees

Journal of Algorithms
Self-adjusting trees in practice for large text collections

Software—Practice & Experience
Static Optimality Theorem for External Memory String Access

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Cache-oblivious string dictionaries

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Search-Optimized suffix-tree storage for biological applications

HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Adaptive searching in succinctly encoded binary relations and tree-structured documents

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Obtaining provably good performance from suffix trees in secondary storage

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching

On searching compressed string collections cache-obliviously

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An(other) Entropy-Bounded Compressed Suffix Tree

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
B-tries for disk-based string management

The VLDB Journal — The International Journal on Very Large Data Bases
Faster entropy-bounded compressed suffix trees

Theoretical Computer Science
Toward optimal disk layout of genome scale suffix trees

SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a self-adjusting layout scheme for suffix trees in secondary storage that provides optimal number of disk accesses for a sequence of string or substring queries. This has been an open problem since Sleator and Tarjan presented their splaying technique to create self-adjusting binary search trees in 1985. In addition to resolving this open problem, our scheme provides two additional advantages: 1) The partitions are slowly readjusted, requiring fewer disk accesses than splaying methods, and 2) the initial state of the layout is balanced, making it useful even when the sequence of queries is not highly skewed. Our method is also applicable to PATRICIA trees, and potentially to other data structures.