Tight Bounds for String Reconstruction Using Substring Queries.
Dekel TsurPublished in: APPROX-RANDOM (2005)
Keyphrases
- tight bounds
- upper bound
- data structure
- suffix tree
- query language
- query processing
- suffix array
- pattern matching
- database
- efficient processing
- user queries
- arbitrary length
- complex queries
- hamming distance
- query formulation
- response time
- three dimensional
- reconstruction process
- answering queries
- query evaluation
- query logs
- database queries
- space efficient
- discrete tomography
- retrieval systems
- data objects
- range queries
- image reconstruction
- web search engines
- data management
- information retrieval systems
- data sources
- data model
- relational databases
- information retrieval
- databases