{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:18:08Z","timestamp":1740122288892,"version":"3.37.3"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,1,16]],"date-time":"2017-01-16T00:00:00Z","timestamp":1484524800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,16]],"date-time":"2017-01-16T00:00:00Z","timestamp":1484524800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Science Foundation","award":["1637541"],"award-info":[{"award-number":["1637541"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10707-016-0287-5","type":"journal-article","created":{"date-parts":[[2017,1,16]],"date-time":"2017-01-16T07:09:24Z","timestamp":1484550564000},"page":"703-732","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hub Labels on the database for large-scale graphs with the COLD framework"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7719-8938","authenticated-orcid":false,"given":"Alexandros","family":"Efentakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christodoulos","family":"Efstathiades","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Pfoser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,16]]},"reference":[{"key":"287_CR1","doi-asserted-by":"crossref","unstructured":"Abraham I, Delling D, Fiat A, Goldberg AV, Werneck RF (2012) Hldb: Location-based services in databases. In: Proceedings of the 20th International Conference on Advances in Geographic Information Systems, pp 339\u2013348","DOI":"10.1145\/2424321.2424365"},{"key":"287_CR2","doi-asserted-by":"crossref","unstructured":"Abraham I, Delling D, Goldberg AV, Werneck RF (2011) A hub-based labeling algorithm for shortest paths in road networks. In: Proc. 10th International Symposium on Experimental Algorithms (SEA), pp 230\u2013241","DOI":"10.1007\/978-3-642-20662-7_20"},{"key":"287_CR3","doi-asserted-by":"crossref","unstructured":"Abraham I, Delling D, Goldberg AV, Werneck RF (2012) Hierarchical hub labelings for shortest paths. In: Proc. 20th Annual European Symposium on Algorithms (ESA), pp 24\u201335","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"287_CR4","doi-asserted-by":"crossref","unstructured":"Afshani P, Brodal GS, Zeh N (2011) Ordered and unordered top-k range reporting in large data sets. In: Proc. Twenty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp 390\u2013400","DOI":"10.1137\/1.9781611973082.31"},{"key":"287_CR5","doi-asserted-by":"crossref","unstructured":"Akiba T, Iwata Y, Kawarabayashi K, Kawata Y (2014) Fast shortest-path distance queries on road networks by pruned highway labeling. In: Proc. 16th Workshop on Algorithm Engineering and Experiments (ALENEX), pp 147\u2013154","DOI":"10.1137\/1.9781611973198.14"},{"key":"287_CR6","doi-asserted-by":"crossref","unstructured":"Akiba T, Iwata Y, Yoshida Y (2013) Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: Proc. ACM SIGMOD International Conference on Management of Data, pp 349\u2013360","DOI":"10.1145\/2463676.2465315"},{"key":"287_CR7","unstructured":"Akiba T, Iwata Y, Yoshida Y (2015) Pruned landmark labeling. \n                    https:\/\/github.com\/iwiwi\/pruned-landmark-labeling"},{"key":"287_CR8","doi-asserted-by":"crossref","unstructured":"Albert R, Jeong H, Barab\u00e1si A-L (1999) The diameter of the world wide web. CoRR. arXiv:\n                    cond-mat\/9907038","DOI":"10.1038\/43601"},{"key":"287_CR9","doi-asserted-by":"crossref","unstructured":"Bader DA, Meyerhenke H, Sanders P, Wagner D (eds) (2013) Proceedings of the 10th DIMACS Implementation Challenge Workshop Graph Partitioning and Graph Clustering","DOI":"10.1090\/conm\/588"},{"key":"287_CR10","unstructured":"Bast H, Delling D, Goldberg AV, Muller-Hannemann M, Pajor T, Sanders P, Wagner D, Werneck RF (2015) Route planning in transportation networks. CoRR. arXiv:\n                    abs\/1504.05140"},{"key":"287_CR11","doi-asserted-by":"crossref","unstructured":"Borutta F, Nascimento MA, Niedermayer J, Kr\u00f6ger P (2014) Monochromatic rknn queries in time-dependent road networks. In: Proc. Third ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems, pp 26\u201333","DOI":"10.1145\/2675316.2675317"},{"key":"287_CR12","unstructured":"Cheema MA, Shen Z, Lin X, Zhang W (2014) A unified framework for efficiently processing ranking related queries. In: Proc. 17th International Conference on Extending Database Technology (EDBT), pp 427\u2013438"},{"key":"287_CR13","doi-asserted-by":"crossref","unstructured":"Cho E, Myers SA, Leskovec J (2011) Friendship and mobility: user movement in location-based social networks. In: Proc. of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 1082\u20131090","DOI":"10.1145\/2020408.2020579"},{"key":"287_CR14","unstructured":"Cohen E, Halperin E, Kaplan H, Zwick U (2002) Reachability and distance queries via 2-hop labels. In: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp 937\u2013946"},{"key":"287_CR15","doi-asserted-by":"crossref","unstructured":"Delling D, Dibbelt J, Pajor T, Werneck R (2015) Public transit labeling. In: Proc. 14th International Symposium on Experimental Algorithms(SEA), pp 273\u2013285","DOI":"10.1007\/978-3-319-20086-6_21"},{"key":"287_CR16","doi-asserted-by":"crossref","unstructured":"Delling D, Goldberg AV, Pajor T, Werneck RF (2011) Customizable route planning. In: Proc. 10th International Conference on Experimental Algorithms (SEA), pp 376\u2013387","DOI":"10.1007\/978-3-642-20662-7_32"},{"key":"287_CR17","doi-asserted-by":"crossref","unstructured":"Delling D, Goldberg AV, Pajor T, Werneck RF (2014) Robust distance queries on massive networks. In: Proc. 22th Annual European Symposium on Algorithms (ESA), pp 321\u2013333","DOI":"10.1007\/978-3-662-44777-2_27"},{"key":"287_CR18","unstructured":"Delling D, Goldberg AV, Werneck R (2011) Faster batched shortest paths in road networks. In: Proc. 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS)"},{"key":"287_CR19","doi-asserted-by":"crossref","unstructured":"Delling D, Goldberg AV, Werneck RF (2013) Hub label compression. In: Proc. 12th International Symposium on Experimental Algorithms (SEA), pp 18\u201329","DOI":"10.1007\/978-3-642-38527-8_4"},{"issue":"3","key":"287_CR20","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1109\/TKDE.2014.2345386","volume":"27","author":"D Delling","year":"2015","unstructured":"Delling D, Werneck R (2015) Customizable point-of-interest queries in road networks. IEEE Trans Knowl Data Eng 27(3):686\u2013698","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"287_CR21","doi-asserted-by":"crossref","unstructured":"Delling D, Werneck RFF (2012) Better bounds for graph bisection. In: Proc. 20th Annual European Symposium on Algorithms (ESA), pp 407\u2013418","DOI":"10.1007\/978-3-642-33090-2_36"},{"key":"287_CR22","unstructured":"Efentakis A (2016) Scalable public transportation queries on the database. In: Proc. 19th International Conference on Extending Database Technology (EDBT), pp 527\u2013538"},{"key":"287_CR23","unstructured":"Efentakis A, Efstathiades C, Pfoser D (2015) COLD. revisiting hub labels on the database for large-scale graphs. In: Proc. 14th International Symposium on Advances in Spatial and Temporal Databases (SSTD), pp 22\u201339"},{"key":"287_CR24","doi-asserted-by":"crossref","unstructured":"Efentakis A, Pfoser D (2013) Optimizing landmark-based routing and preprocessing. In: Proc. 6th ACM SIGSPATIAL International Workshop on Computational Transportation Science (CTS)","DOI":"10.1145\/2533828.2533838"},{"key":"287_CR25","unstructured":"Efentakis A, Pfoser D (2014) GRASP. extending graph separators for the single-source shortest-path problem. In: Proc. 22th Annual European Symposium on Algorithms (ESA), pp 358\u2013370"},{"key":"287_CR26","doi-asserted-by":"crossref","unstructured":"Efentakis A, Pfoser D (2016) Rehub: Extending hub labels for reverse k-nearest neighbor queries on large-scale networks. J. Exp. Algorithmics 21:1.13:1\u20131.13:35","DOI":"10.1145\/2990192"},{"key":"287_CR27","unstructured":"Efentakis A, Pfoser D, Vassiliou Y (2015) Salt.aunifiedframeworkforallshortest-path query variants on road networks. In: Proc. 14th International Symposium on Experimental Algorithms (SEA)), pp 298\u2013311"},{"key":"287_CR28","unstructured":"Gavoille C, Peleg D, P\u00e9rennes S, Raz R (2001) Distance labeling in graphs. In: Proc. Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SODA \u201901, pp 210\u2013219"},{"issue":"1","key":"287_CR29","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C Gavoille","year":"2004","unstructured":"Gavoille C, Peleg D, P\u00e9rennes S, Raz R (2004) Distance labeling in graphs. J. Algorithms 53(1):85\u2013112","journal-title":"J. Algorithms"},{"key":"287_CR30","doi-asserted-by":"crossref","unstructured":"Geisberger R, Sanders P, Schultes D (2008) Better approximation of betweenness centrality. In: Proc. 10th Workshop on Algorithm Engineering and Experiments (ALENEX), pp 90\u2013100","DOI":"10.1137\/1.9781611972887.9"},{"key":"287_CR31","doi-asserted-by":"crossref","unstructured":"Geisberger R, Sanders P, Schultes D, Delling D (2008) Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In: Proc. 7th International Workshop on Experimental Algorithms (WEA), pp 319\u2013333","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"287_CR32","doi-asserted-by":"crossref","unstructured":"Hung H-P, Chuang K-T, Chen M-S (2007) Efficient process of top-k range-sum queries over multiple streams with minimized global error, pp 1404\u20131419","DOI":"10.1109\/TKDE.2007.1070"},{"issue":"12","key":"287_CR33","first-page":"1203","volume":"7","author":"M Jiang","year":"2014","unstructured":"Jiang M, Fu AW, Wong RC, Xu Y (2014) Hop doubling label indexing for point-to-point distance querying on scale-free networks. PVLDB 7(12):1203\u20131214","journal-title":"PVLDB"},{"key":"287_CR34","doi-asserted-by":"crossref","unstructured":"Kumar Y, Janardan R, Gupta P (2008) Efficient algorithms for reverse proximity query problems. In: Proc. 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp 39:1\u201339:10","DOI":"10.1145\/1463434.1463483"},{"key":"287_CR35","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection. \n                    http:\/\/snap.stanford.edu\/data"},{"issue":"1","key":"287_CR36","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2009) Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Math 6(1):29\u2013123","journal-title":"Internet Math"},{"issue":"10","key":"287_CR37","doi-asserted-by":"publisher","first-page":"2618","DOI":"10.1109\/TKDE.2015.2426702","volume":"27","author":"B Liao","year":"2015","unstructured":"Liao B, LHU, Yiu ML, Gong Z (2015) Beyond millisecond latency knn search on commodity machine. IEEE Trans Knowl Data Eng 27(10):2618\u20132631","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"287_CR38","doi-asserted-by":"crossref","unstructured":"Liu J, Chen H, Furuse K, Kitagawa H (2010) An efficient algorithm for reverse furthest neighbors query with metric index. In: Proc. 21st International Conference on Database and Expert Systems Applications (DEXA): Part II, pp 437\u2013451","DOI":"10.1007\/978-3-642-15251-1_34"},{"key":"287_CR39","doi-asserted-by":"crossref","unstructured":"Luo Z, Ling TW, Ang C-H, Lee SY, Cui B (2001) Range top\/bottom k queries in olap sparse data cubes. In: Proc. 12th International Conference on Database and Expert Systems Applications (DEXA), pp 678\u2013687","DOI":"10.1007\/3-540-44759-8_66"},{"key":"287_CR40","unstructured":"McAuley JJ, Leskovec J (2012) Learning to discover social circles in ego networks. In: Proc. 26th Annual Conference on Neural Information Processing Systems, pp 548\u2013556"},{"key":"287_CR41","unstructured":"PostgreSQL (2016) The world\u2019s most advanced open source database. \n                    http:\/\/www.postgresql.org\/"},{"issue":"5","key":"287_CR42","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 (2009) Voronoi-based reverse nearest neighbor query processing on spatial networks. Multimedia Systems 15(5):295\u2013308","journal-title":"Multimedia Systems"},{"issue":"8","key":"287_CR43","doi-asserted-by":"publisher","first-page":"1158","DOI":"10.1109\/TKDE.2010.75","volume":"22","author":"J Sankaranarayanan","year":"2010","unstructured":"Sankaranarayanan J, Samet H (2010) Query processing using distance oracles for spatial networks. IEEE Trans Knowl Data Eng 22(8):1158\u20131175","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"287_CR44","doi-asserted-by":"crossref","unstructured":"Sheng C, Tao Y (2012) Dynamic top-k range reporting in external memory. In: Proc. 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp 121\u2013130","DOI":"10.1145\/2213556.2213576"},{"key":"287_CR45","doi-asserted-by":"crossref","unstructured":"Tao Y (2014) A dynamic i\/o-efficient structure for one-dimensional top-k range reporting. In: Proc. 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp 256\u2013265","DOI":"10.1145\/2594538.2594543"},{"key":"287_CR46","doi-asserted-by":"crossref","unstructured":"Tran QT, Taniar D, Safar M (2009) Transactions on large-scale data- and knowledge-centered systems i. chapter Reverse K Nearest Neighbor and Reverse Farthest Neighbor Search on Spatial Networks, pp 353\u2013372. Springer-Verlag","DOI":"10.1007\/978-3-642-03722-1_14"},{"key":"287_CR47","doi-asserted-by":"crossref","unstructured":"Wang S, Cheema MA, Lin X, Zhang Y, Liu D (2016) Efficiently computing reverse k furthest neighbors. In: Proc. 32nd IEEE International Conference on Data Engineering (ICDE), pp 1110\u20131121","DOI":"10.1109\/ICDE.2016.7498317"},{"key":"287_CR48","doi-asserted-by":"crossref","unstructured":"Wang S, Lin W, Yang Y, Xiao X, Zhou S (2015) Efficient route planning on public transportation networks: A labelling approach. In: Proc. 2015 ACM SIGMOD International Conference on Management of Data, pp 967\u2013982","DOI":"10.1145\/2723372.2749456"},{"key":"287_CR49","unstructured":"Yang J, Leskovec J (2012) Defining and evaluating network communities based on ground-truth. In: Proc. 12th IEEE International Conference on Data Mining (ICDM), pp 745\u2013754"},{"issue":"4","key":"287_CR50","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1109\/TKDE.2006.1599391","volume":"18","author":"ML Yiu","year":"2006","unstructured":"Yiu ML, Papadias D, Mamoulis N, Tao Y (2006) Reverse nearest neighbors in large graphs. IEEE Trans Knowl Data Eng 18(4):540\u2013553","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"287_CR51","doi-asserted-by":"crossref","unstructured":"Zhong R, Li G, Tan K-L, Zhou L (2013) G-tree: An efficient index for knn search on road networks. In: Proc. 22nd ACM International Conference on Conference on Information Knowledge Management (CIKM), pp 39\u201348. ACM","DOI":"10.1145\/2505515.2505749"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-016-0287-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-016-0287-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-016-0287-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T13:52:01Z","timestamp":1589723521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-016-0287-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,16]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["287"],"URL":"https:\/\/doi.org\/10.1007\/s10707-016-0287-5","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[2017,1,16]]},"assertion":[{"value":"23 March 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2016","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}