1 paper
Arijit Khan, Gustavo Segovia, Donald Kossmann
We study online graph queries that retrieve nearby nodes of a query node from a large network. To answer such queries with high throughput and low latency, we partition the graph a…