IS-LABEL: An independent-set based labeling scheme for point-to-point distance querying

Proceedings of the VLDB Endowment

Volumn 6, Issue 6, 2013, Pages 457-468

  Fu, Ada Wai Chee ^a   Wu, Huanhuan ^a   Cheng, James ^a   Wong, Raymond Chi Wing ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ALGORITHMS; GRAPHIC METHODS; QUERY PROCESSING;

INDEPENDENT SET; LABELING SCHEME; ORDERS OF MAGNITUDE; POINT TO POINT; PROCESS GRAPHS; REAL-WORLD GRAPHS; SHORTEST PATH; WEB GRAPHS;

GRAPH THEORY;

EID: 84881244485     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2536336.2536346     Document Type: Article

References (41)

1. I. Abraham, D. Delling, A. Fiat, A. V. Goldberg, and R. F. F. Werneck. Vc-dimension and shortest path algorithms. In ICALP (1), pages 690-699, 2011.
2. I. Abraham, D. Delling, A. V. Goldberg, and R. F. F. Werneck. A hub-based labeling algorithm for shortest paths in road networks. In SEA, pages 230-241, 2011.
3. I. Abraham, D. Delling, A. V. Goldberg, and R. F. F. Werneck. Hierarchical hub labelings for shortest paths. In Proceedings of the 20th Annual European Conference on Algorithms (ESA), pages 24-35, 2012.
4. I. Abraham, A. Fiat, A. V. Goldberg, and R. F. F. Werneck. Highway dimension, shortest paths, and provably efficient algorithms. In SODA, pages 782-793, 2010.
5. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Commun. ACM, 31(9):1116-1127, 1988.
6. D. Ajwani, R. Dementiev, and U. Meyer. A computational study of external-memory BFS algorithms. In SODA, pages 601-610, 2006.
7. D. Ajwani, U. Meyer, and V. Osipov. Improved external memory bfs implementation. In ALENEX, 2007.
8. S. Baswana and S. Sen. Approximate distance oracles for unweighted graphs in expected o(n2) time. ACM Transactions on Algorithms, 2(4):557-577, 2006.
9. R. Bauer, D. Delling, P. Sanders, D. Schieferdecker, D. Schultes, and D. Wagner. Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm. ACM Journal of Experimental Algorithmics, 15, 2010.
10. T. Bu and D. F. Towsley. On distinguishing between internet power law topology generators. In INFOCOM, 2002.
11. A. L. Buchsbaum, M. H. Goldwasser, S. Venkatasubramanian, and J. Westbrook. On external memory graph traversal. In SODA, pages 859-860, 2000.
12. L. Chang, J. Yu, L. Qin, H. Cheng, and M. Qiao. The exact distance to destination in undirected world. The VLDB Journal, pages 1-20, 2012 (Online First).
13. J. Cheng, Y. Ke, S. Chu, and C. Cheng. Efficient processing of distance queries in large graphs: a vertex cover approach. In SIGMOD Conference, pages 457-468, 2012.
14. J. Cheng, Z. Shang, H. Cheng, H. Wang, and J. X. Yu. K-reach: Who is in your small world. PVLDB, 5(11):1292-1303, 2012.
15. J. Cheng and J. X. Yu. On-line exact shortest distance query processing. In EDBT, pages 481-492, 2009.
16. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. SIAM J. Comput., 32(5):1338-1355, 2003.
17. A. W.-C. Fu, H. Wu, J. Cheng, S. Cho, and R. C.-W. Wong. Is-label: an independent-set labeling scheme for point-to-point distance querying on large graphs. arXiv:1211.2367, 2012.
18. R. Geisberger, P. Sanders, D. Schultes, and D. Delling. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In WEA, pages 319-333, 2008.
19. A. V. Goldberg and C. Harrelson. Computing the shortest path: A* search meets graph theory. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 156-165, 2005.
20. A. Gubichev, S. J. Bedathur, S. Seufert, and G. Weikum. Fast and accurate estimation of shortest paths in large graphs. In CIKM, pages 499-508, 2010.
21. M. M. Halldórsson and J. Radhakrishnan. Greed is good: Approximating independent sets in sparse and bounded-degree graphs. Algorithmica, 18(1):145-163, 1997.
22. M. Holzer, F. Schulz, and D. Wagner. Engineering multilevel overlay graphs for shortest-path queries. ACM Journal of Experimental Algorithmics, 13(2.5), 2008.
23. R. Jin, N. Ruan, Y. Xiang, and V. E. Lee. A highway-centric labeling approach for answering distance queries on large sparse graphs. In SIGMOD Conference, pages 445-456, 2012.
24. V. Kumar and E. J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. In IEEE Symp. on Parallel and Distributed Processing, pages 169-177, 1996.
25. K. Mehlhorn and U. Meyer. External-memory breadth-first search with sublinear I/O. In ESA, pages 723-735, 2002.
26. U. Meyer. Via detours to I/O-efficient shortest paths. In Efficient Algorithms, pages 219-232, 2009.
27. U. Meyer and V. Osipov. Design and implementation of a practical i/o-efficient shortest paths algorithm. In ALENEX, pages 85-96, 2009.
28. U. Meyer and N. Zeh. I/O-efficient undirected shortest paths with unbounded edge lengths. In ESA, pages 540-551, 2006.
29. K. Munagala and A. G. Ranade. I/o-complexity of graph algorithms. In SODA, pages 687-694, 1999.
30. M. Potamias, F. Bonchi, C. Castillo, and A. Gionis. Fast shortest path distance estimation in large networks. In CIKM, pages 867-876, 2009.
31. H. Samet, J. Sankaranarayanan, and H. Alborzi. Scalable network distance browsing in spatial databases. In SIGMOD Conference, pages 43-54, 2008.
32. P. Sanders and D. Schultes. Highway hierarchies hasten exact shortest path queries. In ESA, pages 568-579, 2005.
33. J. Sankaranarayanan, H. Samet, and H. Alborzi. Path oracles for spatial networks. PVLDB, 2(1):1210-1221, 2009.
34. A. D. Sarma, S. Gollapudi, M. Najork, and R. Panigrahy. A sketch-based distance oracle for web-scale graphs. In WSDM, pages 401-410, 2010.
35. R. Schenkel, A. Theobald, and G. Weikum. Hopi: An efficient connection index for complex xml document collections. In EDBT, pages 237-255, 2004.
36. Y. Tao, C. Sheng, and J. Pei. On k-skip shortest paths. In SIGMOD Conference, pages 43-54, 2011.
37. M. Thorup and U. Zwick. Approximate distance oracles. J. ACM, 52(1):1-24, 2005.
38. D. Watts and S. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393(6684):440-442, 1998.
39. F. Wei. Tedi: efficient shortest path query answering on graphs. In SIGMOD Conference, pages 99-110, 2010.
40. H. Wu, J. Cheng, A. W.-C. Fu, and S. Chu. Generating massive graphs with limited memory. Technical Report, Department of Computer Science and Engineering, The Chinese University of Hong Kong, (CS-TR-2012-01):1-9, 2012.
41. Y. Xiao, W. Wu, J. Pei, W. Wang, and Z. He. Efficiently indexing shortest paths by exploiting symmetry in graphs. In EDBT, pages 493-504, 2009.