{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T16:23:37Z","timestamp":1756571017605,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,27]],"date-time":"2021-11-27T00:00:00Z","timestamp":1637971200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,27]],"date-time":"2021-11-27T00:00:00Z","timestamp":1637971200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s11280-021-00977-1","type":"journal-article","created":{"date-parts":[[2021,11,27]],"date-time":"2021-11-27T12:02:26Z","timestamp":1638014546000},"page":"151-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Compression techniques for 2-hop labeling for shortest distance queries"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6679-8252","authenticated-orcid":false,"given":"Shikha","family":"Anirban","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junhu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Saiful","family":"Islam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Humayun","family":"Kayesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mao Lin","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,27]]},"reference":[{"key":"977_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.F.: Hierarchical hub labelings for shortest paths. In: Epstein, L., Ferragina, P. (eds.) Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, Lecture Notes in Computer Science, vol. 7501, pp 24\u201335 (2012)","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"977_CR2","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Kawarabayashi, K., Kawata, Y.: Fast shortest-path distance queries on road networks by pruned highway labeling. In: ALENEX, pp 47\u2013154 (2014)","DOI":"10.1145\/2463676.2465315"},{"key":"977_CR3","doi-asserted-by":"publisher","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: SIGMOD. https:\/\/doi.org\/10.1145\/2463676.2465315, pp 349\u2013360 (2013)","DOI":"10.1145\/2463676.2465315"},{"key":"977_CR4","doi-asserted-by":"publisher","unstructured":"Akiba, T., Sommer, C., Kawarabayashi, K.: Shortest-path queries for complex networks: exploiting low tree-width outside the core. In: EDBT. https:\/\/doi.org\/10.1145\/2247596.2247614, pp 144\u2013155 (2012)","DOI":"10.1145\/2247596.2247614"},{"key":"977_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s41019-019-00099-9","volume":"4","author":"S Anirban","year":"2019","unstructured":"Anirban, S., Wang, J., Islam, M.S.: Modular decomposition-based graph compression for fast reachability detection. Data Sci. Eng. 4, 193\u2013207 (2019). https:\/\/doi.org\/10.1007\/s41019-019-00099-9","journal-title":"Data Sci. Eng."},{"key":"977_CR6","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1007\/s00778-012-0274-x","volume":"21","author":"L Chang","year":"2012","unstructured":"Chang, L., Yu, J.X., Qin, L., Cheng, H., Qiao, M.: The exact distance to destination in undirected world. VLDB J. 21, 869\u2013888 (2012). https:\/\/doi.org\/10.1007\/s00778-012-0274-x","journal-title":"VLDB J."},{"key":"977_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2390176.2390180","volume":"9","author":"W Chen","year":"2012","unstructured":"Chen, W., Sommer, C., Teng, S., Wang, Y.: A compact routing scheme and approximate distance oracle for power-law graphs. TALG 9, 1\u201326 (2012). https:\/\/doi.org\/10.1145\/2390176.2390180","journal-title":"TALG"},{"key":"977_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM, 937\u2013946 (2002)","DOI":"10.1137\/S0097539702403098"},{"key":"977_CR9","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A, Werneck, R: Hub label compression. In: Proceedings of the 12th International Symposium on Experimental Algorithms (SEA\u201913). https:\/\/www.microsoft.com\/en-us\/research\/publication\/hub-label-compression\/. Springer Verlag (2013)","DOI":"10.1007\/978-3-642-38527-8_4"},{"key":"977_CR10","doi-asserted-by":"publisher","unstructured":"Delling, D.: Route planning in transportation networks: from research to practice. In: SIGSPATIAL. https:\/\/doi.org\/10.1145\/3274895.3282802, p 2 (2018)","DOI":"10.1145\/3274895.3282802"},{"key":"977_CR11","unstructured":"Fan, W.: Data quality: Theory and practice. In: Gao, H., Lim, L., Wang, W., Li, C., Chen, L. (eds.) Web-Age Information Management - 13th International Conference, WAIM 2012, Harbin, China, August 18-20. Proceedings, Lecture Notes in Computer Science, vol. 7418, pp 1\u201316 (2012)"},{"key":"977_CR12","unstructured":"Farhan, M., Wang, Q., Lin, Y., McKay, B.: A highly scalable labelling approach for exact distance queries in complex networks. In: EDBT, pp 13\u201324 (2019)"},{"key":"977_CR13","unstructured":"Farhan, M., Wang, Q., Lin, Y., McKay, B.D.: A highly scalable labelling approach for exact distance queries in complex networks. In: Advances in Database Technology - 22nd International Conference on Extending Database Technology, EDBT 2019, Lisbon, Portugal, March 26-29, 2019, pp 13\u201324 (2019)"},{"key":"977_CR14","doi-asserted-by":"publisher","unstructured":"chee Fu, A.W., Wu, H., Cheng, J., Wong, R.C.W.: Is-label: an independent-set based labeling scheme for point-to-point distance querying. In: PVLDB. https:\/\/doi.org\/10.14778\/2536336.2536346, vol. 6, pp 457\u2013468 (2013)","DOI":"10.14778\/2536336.2536346"},{"key":"977_CR15","doi-asserted-by":"publisher","unstructured":"Haryanto, A.A., Islam, M.S., Taniar, D., Cheema, M.A.: Ig-tree: an efficient spatial keyword index for planning best path queries on road networks. In: World Wide Web. https:\/\/doi.org\/10.1007\/s11280-018-0643-5, vol. 22, pp 1359\u20131399 (2019)","DOI":"10.1007\/s11280-018-0643-5"},{"key":"977_CR16","doi-asserted-by":"publisher","unstructured":"Hayashi, T., Akiba, T., Kawarabayashi, K.: Fully dynamic shortest-path distance query acceleration on massive networks. In: CIKM. https:\/\/doi.org\/10.1145\/2983323.2983731, pp 1533\u20131542 (2016)","DOI":"10.1145\/2983323.2983731"},{"key":"977_CR17","doi-asserted-by":"publisher","unstructured":"Jiang, M., Fu, A., Wong, R.C.W., Xu, Y.: Hop doubling label indexing for point-to-point distance querying on scale-free networks. In: PVLDB. https:\/\/doi.org\/10.14778\/2732977.2732993, vol. 7, pp 1203\u20131214 (2014)","DOI":"10.14778\/2732977.2732993"},{"issue":"12","key":"977_CR18","first-page":"1203","volume":"7","author":"M Jiang","year":"2014","unstructured":"Jiang, M., Fu, A.W., Wong, R.C., Xu, Y.: Hop doubling label indexing for point-to-point distance querying on scale-free networks. PVLDB 7(12), 1203\u20131214 (2014)","journal-title":"PVLDB"},{"key":"977_CR19","doi-asserted-by":"publisher","unstructured":"Li, W., Qiao, M., Qin, L., Zhang, Y., Chang, L., Lin, X.: Scaling distance labeling on small-world networks. In: SIGMOD. https:\/\/doi.org\/10.1145\/3299869.3319877, pp 060\u20131077 (2019)","DOI":"10.1145\/3299869.3319877"},{"key":"977_CR20","doi-asserted-by":"crossref","unstructured":"Li, W., Qiao, M., Qin, L., Zhang, Y., Chang, L., Lin, X.: Scaling up distance labeling on graphs with core-periphery properties. In: Maier, D., Pottinger, R., Doan, A., Tan, W., Alawini, A., Ngo, H.Q. (eds.) Proceedings of the 2020 International Conference on Management of Data, SIGMOD Conference 2020, online conference [Portland, OR, USA], June 14-19, 2020, pp 1367\u20131381. ACM (2020)","DOI":"10.1145\/3318464.3389748"},{"key":"977_CR21","doi-asserted-by":"publisher","unstructured":"Li, Y., U, L.H., Yiu, M., Kou, N.: An experimental study on hub labeling based shortest path algorithms. In: PVLDB. https:\/\/doi.org\/10.1145\/3186728.3164141, vol. 11, pp 445\u2013457 (2017)","DOI":"10.1145\/3186728.3164141"},{"key":"977_CR22","doi-asserted-by":"publisher","unstructured":"Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: CIKM. https:\/\/doi.org\/10.1145\/1645953.1646063, pp 867\u2013876 (2009)","DOI":"10.1145\/1645953.1646063"},{"key":"977_CR23","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/TKDE.2012.253","volume":"26","author":"M Qiao","year":"2012","unstructured":"Qiao, M., Cheng, H., Chang, L., Yu, J.X.: Approximate shortest distance computing: A query-dependent local landmark scheme. TKDE 26, 55\u201368 (2012). https:\/\/doi.org\/10.1109\/TKDE.2012.253","journal-title":"TKDE"},{"key":"977_CR24","unstructured":"Ren, X., Sengupta, N., Ren, X., Wang, J., Cur\u00e9, O.: Finding minimum connected subgraphs with ontology exploration on large RDF data. arXiv:2010.06336 (2020)"},{"issue":"5","key":"977_CR25","doi-asserted-by":"publisher","first-page":"617","DOI":"10.14778\/2735479.2735493","volume":"8","author":"X Ren","year":"2015","unstructured":"Ren, X., Wang, J.: Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs. Proc. VLDB Endow. 8(5), 617\u2013628 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"977_CR26","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI. https:\/\/networkrepository.com (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"977_CR27","doi-asserted-by":"crossref","unstructured":"Shi, Y., Cheng, G., Kharlamov, E.: Keyword search over knowledge graphs via static and dynamic hub labelings. In: WWW, pp 235\u2013245 (2020)","DOI":"10.1145\/3366423.3380110"},{"key":"977_CR28","doi-asserted-by":"crossref","unstructured":"Wang, J., Anirban, S., Amagasa, T., Shiokawa, H., Gong, Z., Islam, M.S.: A hybrid index for distance queries. In: WISE, pp 227\u2013241 (2020)","DOI":"10.1007\/978-3-030-62005-9_17"},{"key":"977_CR29","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TKDE.2016.2633472","volume":"29","author":"X Wang","year":"2017","unstructured":"Wang, X., Zhang, Y., Zhang, W., Lin, X.: Efficient distance-aware influence maximization in geo-social networks. TKDE 29, 599\u2013612 (2017). https:\/\/doi.org\/10.1109\/TKDE.2016.2633472","journal-title":"TKDE"},{"key":"977_CR30","doi-asserted-by":"publisher","unstructured":"Yahia, S.A., Benedikt, M., Lakshmanan, L.V., Stoyanovich, J.: Efficient network aware search in collaborative tagging sites. In: PVLDB. https:\/\/doi.org\/10.14778\/1453856.1453934, vol. 1, pp 710\u2013721 (2008)","DOI":"10.14778\/1453856.1453934"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00977-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-021-00977-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00977-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T14:13:13Z","timestamp":1673878393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-021-00977-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,27]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["977"],"URL":"https:\/\/doi.org\/10.1007\/s11280-021-00977-1","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2021,11,27]]},"assertion":[{"value":"1 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no financial or non-financial interests to disclose that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}