Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Virtual landmarks for the internet
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Evolution and Structure of the Internet: A Statistical Physics Approach
Evolution and Structure of the Internet: A Statistical Physics Approach
Group formation in large social networks: membership, growth, and evolution
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Graph evolution: Densification and shrinking diameters
ACM Transactions on Knowledge Discovery from Data (TKDD)
Efficient search ranking in social networks
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Efficient network aware search in collaborative tagging sites
Proceedings of the VLDB Endowment
Searching the wikipedia with contextual information
Proceedings of the 17th ACM conference on Information and knowledge management
On-line exact shortest distance query processing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Ten weeks in the life of an eDonkey server
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
On the evolution of user interaction in Facebook
Proceedings of the 2nd ACM workshop on Online social networks
Controversial users demand local trust metrics: an experimental study on Epinions.com community
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
Online social networks: measurement, analysis, and applications to distributed information systems
Online social networks: measurement, analysis, and applications to distributed information systems
A sketch-based distance oracle for web-scale graphs
Proceedings of the third ACM international conference on Web search and data mining
TEDI: efficient shortest path query answering on graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
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
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
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
Hierarchical hub labelings for shortest paths
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
IS-Label: an independent-set based labeling scheme for point-to-point distance querying
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
We propose two dynamic indexing schemes for shortest-path and distance queries on large time-evolving graphs, which are useful in a wide range of important applications such as real-time network-aware search and network evolution analysis. To the best of our knowledge, these methods are the first practical exact indexing methods to efficiently process distance queries and dynamic graph updates. We first propose a dynamic indexing scheme for queries on the last snapshot. The scalability and efficiency of its offline indexing algorithm and query algorithm are competitive even with previous static methods. Meanwhile, the method is dynamic, that is, it can incrementally update indices as the graph changes over time. Then, we further design another dynamic indexing scheme that can also answer two kinds of historical queries with regard to not only the latest snapshot but also previous snapshots. Through extensive experiments on real and synthetic evolving networks, we show the scalability and efficiency of our methods. Specifically, they can construct indices from large graphs with millions of vertices, answer queries in microseconds, and update indices in milliseconds.