Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search.
Pawel GawrychowskiShay MozesOren WeimannPublished in: ACM Trans. Algorithms (2020)
Keyphrases
- search queries
- user queries
- query formulation
- prior art
- web search engines
- complex queries
- query processing
- result quality
- query refinement
- query reformulation
- search algorithm
- query language
- search quality
- inverted index
- search sessions
- relevance judgements
- search space
- query suggestion
- database queries
- query logs
- inverted file
- user intent
- search terms
- search engine
- retrieval process
- range queries
- web search
- keyword queries
- search interface
- search tasks
- original query
- information seeking
- similarity search
- response time
- data sources
- database systems
- information retrieval
- query recommendation
- approximate matches