{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:19:41Z","timestamp":1743135581862,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319223629"},{"type":"electronic","value":"9783319223636"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22363-6_2","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T01:41:51Z","timestamp":1439343711000},"page":"22-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["COLD. Revisiting Hub Labels on the Database for Large-Scale Graphs"],"prefix":"10.1007","author":[{"given":"Alexandros","family":"Efentakis","sequence":"first","affiliation":[]},{"given":"Christodoulos","family":"Efstathiades","sequence":"additional","affiliation":[]},{"given":"Dieter","family":"Pfoser","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Delling, D., Fiat, A., Goldberg, A.V., Werneck, R.F.: Hldb: Location-based services in databases. In: SIGSPATIAL GIS. ACM, November 2012","DOI":"10.1145\/2424321.2424365"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-20662-7_20","volume-title":"Experimental Algorithms","author":"I Abraham","year":"2011","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A hub-based labeling algorithm for shortest paths in road networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 230\u2013241. Springer, Heidelberg (2011)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-33090-2_4","volume-title":"Algorithms \u2013 ESA 2012","author":"I Abraham","year":"2012","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical hub labelings for shortest paths. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 24\u201335. Springer, Heidelberg (2012)"},{"key":"2_CR4","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: 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2014, Portland, Oregon, USA, 5 January 2014, pp. 147\u2013154 (2014)","DOI":"10.1137\/1.9781611973198.14"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2013, New York, USA, pp. 349\u2013360 (2013)","DOI":"10.1145\/2463676.2465315"},{"key":"2_CR6","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Pruned landmark labeling (2015). https:\/\/github.com\/iwiwi\/pruned-landmark-labeling"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.-L.: The diameter of the world wide web, CoRR (1999). http:\/\/cond-mat\/9907038","DOI":"10.1038\/43601"},{"key":"2_CR8","series-title":"Contemporary Mathematics","volume-title":"Graph Partitioning and Graph Clustering","year":"2013","unstructured":"Bader, D.A., Meyerhenke, H., Sanders, P., Wagner, D. (eds.): Graph Partitioning and Graph Clustering. Contemporary Mathematics, vol. 588. American Mathematical Society, Providence (2013)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Bast, H., Delling, D., Goldberg, A.V., M\u00fcller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.F.: Route planning in transportation networks. CoRR, abs\/1504.05140 (2015)","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Borutta, F., Nascimento, M.A., Niedermayer, J., Kr\u00f6ger, P.: Monochromatic rknn queries in time-dependent road networks. In: Proceedings of the Third ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems, MobiGIS 2014 pp. 26\u201333, New York, NY, USA. ACM (2014)","DOI":"10.1145\/2675316.2675317"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Cho, E., Myers, S.A., Leskovec, J.: Friendship and mobility: user movement in location-based social networks. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, 21\u201324 August 2011, pp. 1082\u20131090 (2011)","DOI":"10.1145\/2020408.2020579"},{"key":"2_CR12","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002, pp. 937\u2013946. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2002)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-20662-7_32","volume-title":"Experimental Algorithms","author":"D Delling","year":"2011","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 376\u2013387. Springer, Heidelberg (2011)"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/978-3-662-44777-2_27","volume-title":"Algorithms - ESA 2014","author":"D Delling","year":"2014","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Robust distance queries on massive networks. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 321\u2013333. Springer, Heidelberg (2014)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-38527-8_4","volume-title":"Experimental Algorithms","author":"D Delling","year":"2013","unstructured":"Delling, D., Goldberg, A.V., Werneck, R.F.: Hub label compression. In: Demetrescu, C., Marchetti-Spaccamela, A., Bonifaci, V. (eds.) SEA 2013. LNCS, vol. 7933, pp. 18\u201329. Springer, Heidelberg (2013)"},{"key":"2_CR16","unstructured":"Delling, D., Goldberg, A.V., Werneck, R.F.F.: Faster batched shortest paths in road networks. In: ATMOS, pp. 52\u201363 (2011)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Delling, D., Werneck, R.F.: Customizable point-of-interest queries in road networks. In: 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL 2013, Orlando, FL, USA, 5\u20138 November 2013, pp. 490\u2013493 (2013)","DOI":"10.1145\/2525314.2525470"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-33090-2_36","volume-title":"Algorithms \u2013 ESA 2012","author":"D Delling","year":"2012","unstructured":"Delling, D., Werneck, R.F.: Better bounds for graph bisection. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 407\u2013418. Springer, Heidelberg (2012)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Efentakis, A., Pfoser, D.: Optimizing landmark-based routing and preprocessing. In: CTS: 6th ACM SIGSPATIAL International Workshop on Computational Transportation Science, 5 November 2013, Orlando, FL, USA, p. 25 (2013)","DOI":"10.1145\/2533828.2533838"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/978-3-662-44777-2_30","volume-title":"Algorithms - ESA 2014","author":"A Efentakis","year":"2014","unstructured":"Efentakis, A., Pfoser, D.: GRASP. extending graph separators for the single-source shortest-path problem. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 358\u2013370. Springer, Heidelberg (2014)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Efentakis, A., Pfoser, D.: ReHub. Extending hub labels for reverse k-nearest neighbor queries on large-scale networks (2015). arXiv preprint http:\/\/arXiv:1504.01497","DOI":"10.1145\/2990192"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-319-20086-6_23","volume-title":"Experimental Algorithms","author":"A Efentakis","year":"2015","unstructured":"Efentakis, A., Pfoser, D., Vassiliou, Y.: SALT. a unified framework for all shortest-path query variants on road networks. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 298\u2013311. Springer, Heidelberg (2015)"},{"key":"2_CR23","unstructured":"Gavoille, C., Peleg, D., P\u00e9rennes, S., Raz, R.: Distance labeling in graphs. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2001, pp. 210\u2013219. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2001)"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D.: Better approximation of betweenness centrality. In: Munro, J.I., Wagner, D. (eds.) ALENEX, pp. 90\u2013100. SIAM (2008)","DOI":"10.1137\/1.9781611972887.9"},{"issue":"12","key":"2_CR25","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":"2_CR26","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"issue":"1","key":"2_CR27","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1), 29\u2013123 (2009)","journal-title":"Internet Math."},{"key":"2_CR28","unstructured":"McAuley, J.J., Leskovec, J.: Learning to discover social circles in ego networks. In: Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012, Proceedings of a meeting held 3\u20136 December 2012, Lake Tahoe, Nevada, United States, pp. 548\u2013556 (2012)"},{"key":"2_CR29","unstructured":"PostgreSQL. The world\u2019s most advanced open source database (2015). http:\/\/www.postgresql.org\/"},{"issue":"5","key":"2_CR30","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00530-009-0167-z","volume":"15","author":"M Safar","year":"2009","unstructured":"Safar, M., Ibrahimi, D., Taniar, D.: Voronoi-based reverse nearest neighbor query processing on spatial networks. Multimedia Syst. 15(5), 295\u2013308 (2009)","journal-title":"Multimedia Syst."},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. In: 12th IEEE International Conference on Data Mining, ICDM 2012, Brussels, Belgium, 10\u201313 December 2012, pp. 745\u2013754 (2012)","DOI":"10.1109\/ICDM.2012.138"},{"issue":"4","key":"2_CR32","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1109\/TKDE.2006.1599391","volume":"18","author":"ML Yiu","year":"2006","unstructured":"Yiu, M.L., Papadias, D., Mamoulis, N., Tao, Y.: Reverse nearest neighbors in large graphs. IEEE Trans. Knowl. Data Eng. 18(4), 540\u2013553 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Zhong, R., Li, G., Tan, K.-L., Zhou, L.: G-tree: An efficient index for knn search on road networks. In: Proceedings of the 22nd ACM International Conference on Conference on Information Knowledge Management, CIKM 2013, pp. 39\u201348. ACM, New York, NY, USA (2013)","DOI":"10.1145\/2505515.2505749"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22363-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T14:21:14Z","timestamp":1675866074000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22363-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319223629","9783319223636"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22363-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}