The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees.
Sébastien FerréPublished in: ICFCA (2007)
Keyphrases
- efficient computation
- suffix tree
- data structure
- suffix array
- string matching
- computational efficiency
- pattern matching
- aggregate queries
- disk resident
- space requirements
- index structure
- window search
- inverted index
- multi dimensional
- database systems
- skyline queries
- periodicity detection
- data sets
- management system
- similarity measure
- information retrieval
- databases