An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fully dynamic shortest paths in digraphs with arbitrary arc weights
Journal of Algorithms
A new approach to dynamic all pairs shortest paths
Journal of the ACM (JACM)
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
The SphereSearch engine for unified ranked retrieval of heterogeneous XML and web documents
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL
ACM Transactions on Database Systems (TODS)
Experimental analysis of dynamic all pairs shortest path algorithms
ACM Transactions on Algorithms (TALG)
Fast and practical indexing and querying of very large graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficiently answering reachability queries on very large directed graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficient top-k querying over social-tagging networks
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
On-line exact shortest distance query processing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficiently indexing shortest paths by exploiting symmetry in graphs
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
NAGA: Searching and Ranking Knowledge
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Evaluating Reachability Queries over Path Collections
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Personalized social search based on the user's social network
Proceedings of the 18th ACM conference on Information and knowledge management
Incremental Maintenance of 2-Hop Labeling of Large Graphs
IEEE Transactions on Knowledge and Data Engineering
What is Twitter, a social network or a news media?
Proceedings of the 19th international conference on World wide web
Modeling relationship strength in online social networks
Proceedings of the 19th international conference on World wide web
Fast and accurate estimation of shortest paths in large graphs
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Hi-index | 0.00 |
An important building block of many graph applications such as searching in social networks, keyword search in graphs, and retrieval of linked documents is retrieving the transitive neighbors of a node in ascending order of their distances. Since large graphs cannot be kept in memory and graph traversals at query time would be prohibitively expensive, the list of neighbors for each node is usually precomputed and stored in a compact form. While the problem of precomputing all-pairs shortest distances has been well studied for decades, efficiently maintaining this information when the graph changes is not as well understood. This paper presents an algorithm for maintaining nearest neighbor lists in weighted graphs under node insertions and decreasing edge weights. It considers the important case where queries are a lot more frequent than updates, and presents two approaches for transparently performing necessary index updates while executing queries. Extensive experiments with large graphs, including a subset of Twitter's user graph, demonstrate that the overhead for this maintenance is small.