Login / Signup
An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size.
Dong Kyue Kim
Jeong Eun Jeon
Heejin Park
Published in:
SPIRE (2004)
Keyphrases
</>
suffix array
suffix tree
data structure
space requirements
string matching
index structure
space efficient
pattern matching
inverted index
indexing structure
data compression
similarity measurement
databases
relational databases
b tree