Compressed and Searchable Indexes for Highly Similar Strings (Invited Talk).
Kunsoo ParkPublished in: ISAAC (2016)
Keyphrases
- invited talk
- highly similar
- suffix array
- compressed text
- approximate string matching
- bitmap indexes
- high similarity
- selected papers
- string matching
- knowledge discovery and data mining
- inverted file
- data structure
- database
- digital libraries
- databases
- compressed domain
- edit distance
- data compression
- query processing
- pattern matching
- neural network
- suffix tree
- materialized views
- acceptance rate