A linear-space data structure for range-LCP queries in poly-logarithmic time.
Paniz AbedinArnab GangulyWing-Kai HonKotaro MatsudaYakov NekrichKunihiko SadakaneRahul ShahSharma V. ThankachanPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- linear space
- space efficient
- data structure
- query cost
- external memory
- range queries
- nearest neighbor search
- inverted index
- query evaluation
- main memory
- query language
- web search engines
- query processing
- user queries
- database
- arbitrary shape
- bloom filter
- sliding window
- index structure
- multi dimensional
- indexing techniques
- worst case
- indexing structure
- random access
- locality sensitive hashing
- query patterns
- spatial databases
- memory space
- cost model
- b tree
- data streams
- databases