On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Syntactic clustering of the Web
Selected papers from the sixth international conference on World Wide Web
Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms
Labeling Schemes for Flow and Connectivity
SIAM Journal on Computing
Journal of Algorithms
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Journal of the ACM (JACM)
Graph distances in the streaming model: the value of space
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Knowledge and Data Engineering
Streaming algorithm for graph spanners---single pass and constant processing time per edge
Information Processing Letters
Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Labeling Schemes for Tree Representation
Algorithmica
Proceedings of the 20th ACM conference on Hypertext and hypermedia
Fast and accurate estimation of shortest paths in large graphs
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Querying shortest path distance with bounded errors in large graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
Of hammers and nails: an empirical comparison of three paradigms for processing large graphs
Proceedings of the fifth ACM international conference on Web search and data mining
How user behavior is related to social affinity
Proceedings of the fifth ACM international conference on Web search and data mining
Kineograph: taking the pulse of a fast-changing and connected world
Proceedings of the 7th ACM european conference on Computer Systems
Canal: scaling social network-based Sybil tolerance schemes
Proceedings of the 7th ACM european conference on Computer Systems
Partitioned multi-indexing: bringing order to social search
Proceedings of the 21st international conference on World Wide Web
A highway-centric labeling approach for answering distance queries on large sparse graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Shortest-path queries for complex networks: exploiting low tree-width outside the core
Proceedings of the 15th International Conference on Extending Database Technology
Shortest paths in less than a millisecond
Proceedings of the 2012 ACM workshop on Workshop on online social networks
A compact routing scheme and approximate distance oracle for power-law graphs
ACM Transactions on Algorithms (TALG)
Fast approximation of steiner trees in large graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
The exact distance to destination in undirected world
The VLDB Journal — The International Journal on Very Large Data Bases
RDF-4G: algorithmic building blocks for large-scale graph analytics
Proceedings of the 2013 Sigmod/PODS Ph.D. symposium on PhD symposium
SocialWatch: detection of online service abuse via large-scale social graphs
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Social ranking techniques for the web
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Label constrained shortest path estimation
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths
Proceedings of the first ACM conference on Online social networks
Call me maybe: understanding nature and risks of sharing mobile numbers on online social networks
Proceedings of the first ACM conference on Online social networks
Efficient proximity detection among mobile objects in road networks with self-adjustment methods
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Top-K nearest keyword search on large graphs
Proceedings of the VLDB Endowment
IS-Label: an independent-set based labeling scheme for point-to-point distance querying
Proceedings of the VLDB Endowment
Proceedings of the 23rd international conference on World wide web
| Hi-index | 0.00 |
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance queries between pairs of nodes in real time. Since the standard shortest path algorithms are expensive, our approach moves the time-consuming shortest-path computation offline, and at query time only looks up precomputed values and performs simple and fast computations on these precomputed values. More specifically, during the offline phase we compute and store a small "sketch" for each node in the graph, and at query-time we look up the sketches of the source and destination nodes and perform a simple computation using these two sketches to estimate the distance.