Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time.
Aaron BernsteinPublished in: FOCS (2009)
Keyphrases
- database
- response time
- query processing
- insertions and deletions
- user queries
- query expansion
- dynamic environments
- user interaction
- shortest path
- dynamically updated
- pre computed
- aggregate queries
- retrieval method
- database queries
- communication cost
- complex queries
- keyword search
- query rewriting
- distance computation
- exact and approximate
- data objects
- user defined
- relevance feedback