Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks.
Ye WangQing WangHenning KoehlerYu LinPublished in: SIGMOD Conference (2021)
Keyphrases
- shortest path
- flow graph
- path queries
- edge weights
- betweenness centrality
- path length
- weighted graph
- shortest path problem
- query processing
- user queries
- path selection
- source node
- road network
- shortest path algorithm
- random walk
- strongly connected components
- finding the shortest path
- routing algorithm
- spatial networks
- complex queries
- minimum spanning tree
- query evaluation
- graph search
- efficient processing
- reverse nearest neighbor
- data sources
- complex networks
- range queries
- information flow
- query rewriting
- social networks
- travel time
- optimal path
- cost model
- steiner tree
- structured data
- response time
- shortest distance
- rdf graphs
- directed graph
- spanning tree
- network structure
- nearest neighbor
- xpath queries
- data objects