{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:01:28Z","timestamp":1743145288771,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439838"},{"type":"electronic","value":"9783662439845"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-662-43984-5_6","type":"book-chapter","created":{"date-parts":[[2014,7,10]],"date-time":"2014-07-10T12:57:50Z","timestamp":1404997070000},"page":"75-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Distributed K-Distance Indexing Approach for Efficient Shortest Path Discovery on Large Graphs"],"prefix":"10.1007","author":[{"given":"Jihye","family":"Hong","sequence":"first","affiliation":[]},{"given":"Hyunwook","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Waqas","family":"Nawaz","sequence":"additional","affiliation":[]},{"given":"Kisung","family":"Park","sequence":"additional","affiliation":[]},{"given":"Byeong-Soo","family":"Jeong","sequence":"additional","affiliation":[]},{"given":"Young-Koo","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,11]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Vieira, M.V., Fonseca, B.M., Damazio, R., Golgher, P.B., Reis, D.d.C., Ribeiro-Neto, B.: Efficient search ranking in social networks. In: CIKM, pp. 563\u2013572 (2007)","DOI":"10.1145\/1321440.1321520"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: KDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Ukkonen, A., Castillo, C., Donato, D., Gionis, A.: Searching the wikipedia with contextual information. In: CIKM, pp. 1351\u20131352 (2008)","DOI":"10.1145\/1458082.1458274"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: CIKM, pp. 867\u2013876 (2009)","DOI":"10.1145\/1645953.1646063"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-70918-3_3","volume-title":"STACS 2007","author":"D Wagner","year":"2007","unstructured":"Wagner, D., Willhalm, T.: Speed-up techniques for shortest-path computations. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 23\u201336. Springer, Heidelberg (2007)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: SODA, pp. 937\u2013946 (2002)","DOI":"10.1137\/S0097539702403098"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Wei, F.: Tedi: efficient shortest path query answering on method for efficient shortest path discovery graphs. In: SIGMOD, pp. 99\u2013110 (2010)","DOI":"10.1145\/1807167.1807181"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: CIKM, pp. 453\u2013470 (2009)","DOI":"10.1145\/1645953.1646063"},{"key":"6_CR10","unstructured":"Goldberg, A., Harrelson, C.: Computing the shortest path: search meets graph theory. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms SODA, Vancouver, British Columbia, 23\u201325 January 2005"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Wei, F.: Tedi: efficient shortest path query answering on graphs. In: Proceedings of the 29th ACM SIGMOD International Conference on Management of Data, Indianapolis, USA, 6\u201311 June 2010","DOI":"10.1145\/1807167.1807181"},{"issue":"11","key":"6_CR12","first-page":"876","volume":"4","author":"Y Yuan","year":"2011","unstructured":"Yuan, Y., Wang, G., Wang, H., Chen, L.: Efficient subgraph search over large uncertain graphs. PVLDB 4(11), 876\u2013886 (2011)","journal-title":"PVLDB"},{"key":"6_CR13","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. In: Proceedings of the 6th Symposium on Operating Systems Design and Implementation, San Francisco, CA, 6\u20138 December 2004"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Chakrabarti, K., Xin, D.: Fast personalized pagerank on mapreduce. In: Proceedings of the 30th ACM SIGMOD International Conference on Management of Data, Athens, Greece, 12\u201316 June 2011","DOI":"10.1145\/1989323.1989425"},{"issue":"8","key":"6_CR15","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Comm. ACM 33(8), 103\u2013111 (1990)","journal-title":"Comm. ACM"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: SIGMOD (2010)","DOI":"10.1145\/1583991.1584010"},{"issue":"4","key":"6_CR17","first-page":"358","volume":"5","author":"J Gao","year":"2011","unstructured":"Gao, J., Jin, R., Zhou, J., Yu, J., Jiang, X., Wang, T.: Relational approach for shortest path discovery over large graphs. PVLDB 5(4), 358\u2013369 (2011)","journal-title":"PVLDB"},{"key":"6_CR18","volume-title":"The LEDA Platform of Combinatorial and Geometric Computing","author":"K Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., Naher, S.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)"},{"key":"6_CR19","unstructured":"The iGraph library. http:\/\/igraph.wikidot.com\/"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03730-6_26","volume-title":"Data Warehousing and Knowledge Discovery","author":"S Padmanabhan","year":"2009","unstructured":"Padmanabhan, S., Chakravarthy, S.: HDB-subdue: a scalable approach to graph mining. In: Pedersen, T.B., Mohania, M.K., Tjoa, A.M. (eds.) DaWaK 2009. LNCS, vol. 5691, pp. 325\u2013338. Springer, Heidelberg (2009)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/978-3-540-85654-2_59","volume-title":"Database and Expert Systems Applications","author":"S Chakravarthy","year":"2008","unstructured":"Chakravarthy, S., Pradhan, S.: DB-FSG: an SQL-based approach for frequent subgraph mining. In: Bhowmick, S.S., K\u00fcng, J., Wagner, R. (eds.) DEXA 2008. LNCS, vol. 5181, pp. 684\u2013692. Springer, Heidelberg (2008)"},{"key":"6_CR22","unstructured":"Gregor, D., Lumsdaine, A.: The parallel BGL: a generic library for distributed graph computations. In: Proceedings of Parallel Object-Oriented Scientific Computing POOSC (2005)"},{"issue":"1","key":"6_CR23","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1177\/1094342005051196","volume":"19","author":"A Chan","year":"2005","unstructured":"Chan, A., Dehne, F.: CGMGRAPH\/CGMLIB: implementing and testing CGM graph algorithms on PC clusters and shared memory machines. Int. J. High Perform. Comput. Appl. 19(1), 81\u201397 (2005)","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M. H., Bik, A. J., Dehnert, J. C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: SIGMOD, pp. 135\u201346 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"6_CR25","volume-title":"Parallelization and Distribution for Large Scale Graph Processing","author":"A Iosup","year":"2012","unstructured":"Iosup, A., Lampraki, N.P., Penders, A., Biczak, M., Guo, Y., Varbanescu, A.L.: Parallelization and Distribution for Large Scale Graph Processing. HPD, Delft, The Netherlands (2012)"},{"key":"6_CR26","unstructured":"Apache Hadoop. http:\/\/hadoop.apache.org\/"},{"key":"6_CR27","unstructured":"Amazon EC2. http:\/\/aws.amazon.com\/ec2\/"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Predicting positive and negative links in online social networks. In: WWW (2010)","DOI":"10.1145\/1772690.1772756"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) (2005)","DOI":"10.1145\/1081870.1081893"},{"issue":"1","key":"6_CR30","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., Dasgupta, A., Mahoney, M.: 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":"6_CR31","volume-title":"A Java Library of Graph Algorithms and Optimization","author":"TL Hang","year":"2007","unstructured":"Hang, T.L.: A Java Library of Graph Algorithms and Optimization. Taylor & Francis, Hoboken (2007)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43984-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T19:40:59Z","timestamp":1674157259000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-43984-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439838","9783662439845"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43984-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"11 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}