{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:06Z","timestamp":1750306086850,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS 0612203 and DRL 1515550"],"award-info":[{"award-number":["IIS 0612203 and DRL 1515550"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3102254.3102264","type":"proceedings-article","created":{"date-parts":[[2017,7,26]],"date-time":"2017-07-26T20:05:41Z","timestamp":1501099541000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient top-k shortest path query processing in sparse graph databases"],"prefix":"10.1145","author":[{"given":"Hasan M.","family":"Jamil","sequence":"first","affiliation":[{"name":"University of Idaho"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"XMARK\n\n  \n  : The XML-benchmark project. http:\/\/monetdb.cwi.nl\/ xml 2002. XMARK: The XML-benchmark project . http:\/\/monetdb.cwi.nl\/ xml 2002."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2014.2302803"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75520-3_17"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2013.02.006"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2012.90"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkv1164"},{"volume-title":"29th IEEE International Conference on Data Engineering, ICDE 2013","year":"2013","author":"Cheng Jiefeng","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","unstructured":"Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest and Clifford Stein. 2009. Introduction to Algorithms Third Edition (3rd ed.). The MIT Press.  Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest and Clifford Stein. 2009. Introduction to Algorithms Third Edition (3rd ed.). The MIT Press."},{"key":"e_1_3_2_1_9_1","unstructured":"Ernesto de Queir\u00f3s Vieira Martins and Marta M. B. Pascoal. 2003. A new implementation of Yen's ranking loopless paths algorithm. 4OR 1 2 (2003) 121--133.  Ernesto de Queir\u00f3s Vieira Martins and Marta M. B. Pascoal. 2003. A new implementation of Yen's ranking loopless paths algorithm. 4OR 1 2 (2003) 121--133."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871625"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05813-9_11"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.3.395"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5220\/0005859400420053"},{"key":"e_1_3_2_1_16_1","first-page":"b263","article-title":"k-th shortest paths and applications to the probabilistic networks","volume":"23","author":"Fox B. L.","year":"1975","journal-title":"ORSA\/TIMS Joint National Mtg."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5220\/0005353500970107"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871504"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-011-9603-3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959899"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/320998.321004"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2391125"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1929934.1929941"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120406"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25159-2_21"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2014.0582"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505760"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_58"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSACW.2013.49"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0968-2"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCNC.2016.7440702"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989368"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1089\/brain.2011.0038"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247573"},{"key":"e_1_3_2_1_38_1","unstructured":"Guang-Zhong Wang and Martin J. Lercher. 2011. The Effects of Network Neighbours on Protein Evolution. PLoS ONE 6 4 (04 2011) 1--6.  Guang-Zhong Wang and Martin J. Lercher. 2011. The Effects of Network Neighbours on Protein Evolution. PLoS ONE 6 4 (04 2011) 1--6."},{"volume-title":"Dual Labeling: Answering Graph Reachability Queries in Constant Time. In 22nd International Conference on Data Engineering, April 3--8","year":"2006","author":"Wang Haixun","key":"e_1_3_2_1_39_1"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1080\/15472450.2015.1082911"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807181"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732992"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2533888.2533936"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Fei Yuan You Zhou Meng Wang Jing Yang Kai Wu Changhong Lu Xiangyin Kong and Yu-Dong Cai. 2015. Identifying New Candidate Genes and Chemicals Related to Prostate Cancer Using a Hybrid Network and Shortest Path Approach. Comp. Math. Methods in Medicine 2015 (2015) 462363:1--462363:12.  Fei Yuan You Zhou Meng Wang Jing Yang Kai Wu Changhong Lu Xiangyin Kong and Yu-Dong Cai. 2015. Identifying New Candidate Genes and Chemicals Related to Prostate Cancer Using a Hybrid Network and Shortest Path Approach. Comp. Math. Methods in Medicine 2015 (2015) 462363:1--462363:12.","DOI":"10.1155\/2015\/462363"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920988"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247650"}],"event":{"name":"WIMS '17: 7th International Conference on Web Intelligence, Mining and Semantics","sponsor":["COSPECS Dipartimento di Scienze Cognitive Psicologiche Pedagogiche e degli Studi Culturali, Universita degli Studi di Messina","Arescon Advanced Research & Solution Consulting","DISA-MIS Dipartimento di Scienze Aziendali - Management e Innovation Systems, Universita Degli Studi di Salerno","Xenia Progetti Xenia Progetti"],"location":"Amantea Italy","acronym":"WIMS '17"},"container-title":["Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3102254.3102264","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3102254.3102264","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3102254.3102264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:18Z","timestamp":1750217418000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3102254.3102264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":47,"alternative-id":["10.1145\/3102254.3102264","10.1145\/3102254"],"URL":"https:\/\/doi.org\/10.1145\/3102254.3102264","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}