Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
A graph generation software package
SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
The Stanford GraphBase: a platform for combinatorial computing
The Stanford GraphBase: a platform for combinatorial computing
Communications of the ACM
STOC '01 Proceedings of the thirty-third 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
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
Introduction to Algorithms
Algorithms for Searching Massive Graphs
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
Approximation algorithms for combinatorial problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
On the shortest path and minimum spanning tree problems
On the shortest path and minimum spanning tree problems
Journal of Algorithms
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Stack-based algorithms for pattern matching on DAGs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Answering distance queries in directed graphs using fast matrix multiplication
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Dual Labeling: Answering Graph Reachability Queries in Constant Time
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Group formation in large social networks: membership, growth, and evolution
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
BLINKS: ranked keyword searches on graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Fast and practical indexing and querying of very large graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Fast computing reachability labelings for large graphs with high compression rate
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
On incremental maintenance of 2-hop labeling of graphs
Proceedings of the 17th international conference on World Wide Web
Efficient algorithms for exact ranked twig-pattern matching over graphs
Proceedings of the 2008 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
Proximity-preserving labeling schemes
Journal of Graph Theory
Fast computation of reachability labeling for large graphs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Fast top-k simple shortest paths discovery in graphs
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
On-line preferential nearest neighbor browsing in large attributed graphs
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
Subgraph search over massive disk resident graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Dynamic pickup and delivery with transfers
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Index structures and top-k join algorithms for native keyword search databases
Proceedings of the 20th ACM international conference on Information and knowledge management
Answering pattern match queries in large graph databases via graph embedding
The VLDB Journal — The International Journal on Very Large Data Bases
Journal of Biomedical Informatics
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
K-reach: who is in your small world
Proceedings of the VLDB Endowment
A compact routing scheme and approximate distance oracle for power-law graphs
ACM Transactions on Algorithms (TALG)
G-SPARQL: a hybrid engine for querying large attributed graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
Pay-as-you-go maintenance of precomputed nearest neighbors in large graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
Hierarchical hub labelings for shortest paths
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
The exact distance to destination in undirected world
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient breadth-first search on large graphs with skewed degree distributions
Proceedings of the 16th International Conference on Extending Database Technology
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
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
IS-Label: an independent-set based labeling scheme for point-to-point distance querying
Proceedings of the VLDB Endowment
Efficient processing of label-constraint reachability queries in large graphs
Information Systems
Proceedings of the 23rd international conference on World wide web
Hybrid query execution engine for large attributed graphs
Information Systems
Hi-index | 0.00 |
Shortest-path query processing not only serves as a long established routine for numerous applications in the past but also is of increasing popularity to support novel graph applications in very large databases nowadays. For a large graph, there is the new scenario to query intensively against arbitrary nodes, asking to quickly return node distance or even shortest paths. And traditional main memory algorithms and shortest paths materialization become inadequate. We are interested in graph labelings to encode the underlying graphs and assign labels to nodes to support efficient query processing. Surprisingly, the existing work of this category mainly emphasizes on reachability query processing, while no sufficient effort has been given to distance labelings to support querying exact shortest distances between nodes. Distance labelings must be developed on the graph in whole to correctly retain node distance information. It makes many existing methods to be inapplicable. We focus on fast computing distance-aware 2-hop covers, which can encode the all-pairs shortest paths of a graph in O(|V|·|E|1/2) space. Our approach exploits strongly connected components collapsing and graph partitioning to gain speed, while it can overcome the challenges in correctly retaining node distance information and appropriately encoding all-pairs shortest paths with small overhead. Furthermore, our approach avoids pre-computing all-pairs shortest paths, which can be prohibitive over large graphs. We conducted extensive performance studies, and confirm the efficiency of our proposed new approaches.