Fast In-Memory XPath Search over Compressed Text and Tree Indexes
Diego ArroyueloFrancisco ClaudeSebastian ManethVeli MäkinenGonzalo NavarroKim NguyenJouni SirénNiko VälimäkiPublished in: CoRR (2009)
Keyphrases
- compressed text
- pattern matching
- data structure
- random access
- approximate string matching
- inverted index
- index structure
- search space
- suffix tree
- natural language text
- search algorithm
- b tree
- xml documents
- query processing
- main memory
- lower bound
- r tree
- tree structure
- n gram
- indexing structure
- distance measure
- xpath queries
- query language
- inverted file
- natural language
- database