{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:38:11Z","timestamp":1768109891070,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:00:00Z","timestamp":1587340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,4,20]]},"DOI":"10.1145\/3366423.3380110","type":"proceedings-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:11:44Z","timestamp":1588579904000},"page":"235-245","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Keyword Search over Knowledge Graphs via Static and Dynamic Hub Labelings"],"prefix":"10.1145","author":[{"given":"Yuxuan","family":"Shi","sequence":"first","affiliation":[{"name":"Nanjing University and Bosch Center for AI"}]},{"given":"Gong","family":"Cheng","sequence":"additional","affiliation":[{"name":"Nanjing University"}]},{"given":"Evgeny","family":"Kharlamov","sequence":"additional","affiliation":[{"name":"Bosch Center for AI and University of Oslo"}]}],"member":"320","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Ittai Abraham Daniel Delling Andrew\u00a0V. Goldberg and Renato Fonseca\u00a0F. Werneck. 2011. A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In SEA. 230\u2013241.  Ittai Abraham Daniel Delling Andrew\u00a0V. Goldberg and Renato Fonseca\u00a0F. Werneck. 2011. A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In SEA. 230\u2013241.","DOI":"10.1007\/978-3-642-20662-7_20"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Takuya Akiba Yoichi Iwata Ken-ichi Kawarabayashi and Yuki Kawata. 2014. Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling. In ALENEX. 147\u2013154.  Takuya Akiba Yoichi Iwata Ken-ichi Kawarabayashi and Yuki Kawata. 2014. Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling. In ALENEX. 147\u2013154.","DOI":"10.1137\/1.9781611973198.14"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Takuya Akiba Yoichi Iwata and Yuichi Yoshida. 2013. Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In SIGMOD. 349\u2013360.  Takuya Akiba Yoichi Iwata and Yuichi Yoshida. 2013. Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In SIGMOD. 349\u2013360.","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Ziyad AlGhamdi Fuad Jamour Spiros Skiadopoulos and Panos Kalnis. 2017. A Benchmark for Betweenness Centrality Approximation Algorithms on Large Graphs. In SSDBM.  Ziyad AlGhamdi Fuad Jamour Spiros Skiadopoulos and Panos Kalnis. 2017. A Benchmark for Betweenness Centrality Approximation Algorithms on Large Graphs. In SSDBM.","DOI":"10.1145\/3085504.3085510"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Haris Angelidakis Yury Makarychev and Vsevolod Oparin. 2017. Algorithmic and Hardness Results for the Hub Labeling Problem. In SODA. 1442\u20131461.  Haris Angelidakis Yury Makarychev and Vsevolod Oparin. 2017. Algorithmic and Hardness Results for the Hub Labeling Problem. In SODA. 1442\u20131461.","DOI":"10.1137\/1.9781611974782.94"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Marcelo Arenas Bernardo\u00a0Cuenca Grau Evgeny Kharlamov Sarunas Marciuska and Dmitriy Zheleznyakov. 2016. Faceted search over RDF-based knowledge graphs. J. Web Semant. 37-38(2016) 55\u201374.  Marcelo Arenas Bernardo\u00a0Cuenca Grau Evgeny Kharlamov Sarunas Marciuska and Dmitriy Zheleznyakov. 2016. Faceted search over RDF-based knowledge graphs. J. Web Semant. 37-38(2016) 55\u201374.","DOI":"10.1016\/j.websem.2015.12.002"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Bahman Bahmani and Ashish Goel. 2012. Partitioned multi-indexing: bringing order to social search. In WWW. 399\u2013408.  Bahman Bahmani and Ashish Goel. 2012. Partitioned multi-indexing: bringing order to social search. In WWW. 399\u2013408.","DOI":"10.1145\/2187836.2187891"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"C.\u00a0Douglass Bateman Christopher\u00a0S. Helvig Gabriel Robins and Alexander Zelikovsky. 1997. Provably good routing tree construction with multi-port terminals. In ISPD. 96\u2013102.  C.\u00a0Douglass Bateman Christopher\u00a0S. Helvig Gabriel Robins and Alexander Zelikovsky. 1997. Provably good routing tree construction with multi-port terminals. In ISPD. 96\u2013102.","DOI":"10.1145\/267665.267697"},{"key":"e_1_3_2_1_9_1","unstructured":"Gaurav Bhalotia Arvind Hulgeri Charuta Nakhe Soumen Chakrabarti and S. Sudarshan. 2002. Keyword Searching and Browsing in Databases using BANKS. In ICDE. 431\u2013440.  Gaurav Bhalotia Arvind Hulgeri Charuta Nakhe Soumen Chakrabarti and S. Sudarshan. 2002. Keyword Searching and Browsing in Databases using BANKS. In ICDE. 431\u2013440."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Wei Chen Christian Sommer Shang-Hua Teng and Yajun Wang. 2009. Compact Routing in Power-Law Graphs. In DISC(Lecture Notes in Computer Science) Vol.\u00a05805. 379\u2013391.  Wei Chen Christian Sommer Shang-Hua Teng and Yajun Wang. 2009. Compact Routing in Power-Law Graphs. In DISC(Lecture Notes in Computer Science) Vol.\u00a05805. 379\u2013391.","DOI":"10.1007\/978-3-642-04355-0_41"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Gong Cheng and Evgeny Kharlamov. 2017. Towards a semantic keyword search over industrial knowledge graphs (extended abstract). In BigData. 1698\u20131700.  Gong Cheng and Evgeny Kharlamov. 2017. Towards a semantic keyword search over industrial knowledge graphs (extended abstract). In BigData. 1698\u20131700.","DOI":"10.1109\/BigData.2017.8258109"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.228"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Daniel Delling Andrew\u00a0V. Goldberg Thomas Pajor and Renato\u00a0F. Werneck. 2014. Robust Distance Queries on Massive Networks. In ESA. 321\u2013333.  Daniel Delling Andrew\u00a0V. Goldberg Thomas Pajor and Renato\u00a0F. Werneck. 2014. Robust Distance Queries on Massive Networks. In ESA. 321\u2013333.","DOI":"10.1007\/978-3-662-44777-2_27"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Bolin Ding Jeffrey\u00a0Xu Yu Shan Wang Lu Qin Xiao Zhang and Xuemin Lin. 2007. Finding Top-k Min-Cost Connected Trees in Databases. In ICDE. 836\u2013845.  Bolin Ding Jeffrey\u00a0Xu Yu Shan Wang Lu Qin Xiao Zhang and Xuemin Lin. 2007. Finding Top-k Min-Cost Connected Trees in Databases. In ICDE. 836\u2013845.","DOI":"10.1109\/ICDE.2007.367929"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.61"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Haizhou Fu and Kemafor Anyanwu. 2011. Effectively Interpreting Keyword Queries on RDF Databases with a Rear View. In ISWC. 193\u2013208.  Haizhou Fu and Kemafor Anyanwu. 2011. Effectively Interpreting Keyword Queries on RDF Databases with a Rear View. In ISWC. 193\u2013208.","DOI":"10.1007\/978-3-642-25073-6_13"},{"key":"e_1_3_2_1_18_1","unstructured":"Grettel Garc\u00eda Yenier Izquierdo Elisa Menendez Frederic Dartayre and Marco\u00a0A. Casanova. 2017. RDF Keyword-based Query Technology Meets a Real-World Dataset. In EDBT. 656\u2013667.  Grettel Garc\u00eda Yenier Izquierdo Elisa Menendez Frederic Dartayre and Marco\u00a0A. Casanova. 2017. RDF Keyword-based Query Technology Meets a Real-World Dataset. In EDBT. 656\u2013667."},{"key":"e_1_3_2_1_19_1","volume-title":"Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In WEA. 319\u2013333.","author":"Geisberger Robert","year":"2008","unstructured":"Robert Geisberger , Peter Sanders , Dominik Schultes , and Daniel Delling . 2008 . Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In WEA. 319\u2013333. Robert Geisberger, Peter Sanders, Dominik Schultes, and Daniel Delling. 2008. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In WEA. 319\u2013333."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Andrey Gubichev and Thomas Neumann. 2012. Fast approximation of steiner trees in large graphs. In CIKM. 1497\u20131501.  Andrey Gubichev and Thomas Neumann. 2012. Fast approximation of steiner trees in large graphs. In CIKM. 1497\u20131501.","DOI":"10.1145\/2396761.2398460"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Shuo Han Lei Zou Jeffrey\u00a0Xu Yu and Dongyan Zhao. 2017. Keyword Search on RDF Graphs - A Query Graph Assembly Approach. In CIKM. 227\u2013236.  Shuo Han Lei Zou Jeffrey\u00a0Xu Yu and Dongyan Zhao. 2017. Keyword Search on RDF Graphs - A Query Graph Assembly Approach. In CIKM. 227\u2013236.","DOI":"10.1145\/3132847.3132957"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Faegheh Hasibi Fedor Nikolaev Chenyan Xiong Krisztian Balog Svein\u00a0Erik Bratsberg Alexander Kotov and Jamie Callan. 2017. DBpedia-Entity v2: A Test Collection for Entity Search. In SIGIR.  Faegheh Hasibi Fedor Nikolaev Chenyan Xiong Krisztian Balog Svein\u00a0Erik Bratsberg Alexander Kotov and Jamie Callan. 2017. DBpedia-Entity v2: A Test Collection for Entity Search. In SIGIR.","DOI":"10.1145\/3077136.3080751"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Hao He Haixun Wang Jun Yang and Philip\u00a0S. Yu. 2007. BLINKS: ranked keyword searches on graphs. In SIGMOD. 305\u2013316.  Hao He Haixun Wang Jun Yang and Philip\u00a0S. Yu. 2007. BLINKS: ranked keyword searches on graphs. In SIGMOD. 305\u2013316.","DOI":"10.1145\/1247480.1247516"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2016.121"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Edmund Ihler. 1990. Bounds on the quality of approximate solutions to the Group Steiner Problem. In WG. 109\u2013118.  Edmund Ihler. 1990. Bounds on the quality of approximate solutions to the Group Steiner Problem. In WG. 109\u2013118.","DOI":"10.1007\/3-540-53832-1_36"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Edmund Ihler. 1991. The Complexity of Approximating the Class Steiner Tree Problem. In WG. 85\u201396.  Edmund Ihler. 1991. The Complexity of Approximating the Class Steiner Tree Problem. In WG. 85\u201396.","DOI":"10.1007\/3-540-55121-2_8"},{"key":"e_1_3_2_1_27_1","unstructured":"Varun Kacholia Shashank Pandit Soumen Chakrabarti S. Sudarshan Rushi Desai and Hrishikesh Karambelkar. 2005. Bidirectional Expansion For Keyword Search on Graph Databases. In VLDB. 505\u2013516.  Varun Kacholia Shashank Pandit Soumen Chakrabarti S. Sudarshan Rushi Desai and Hrishikesh Karambelkar. 2005. Bidirectional Expansion For Keyword Search on Graph Databases. In VLDB. 505\u2013516."},{"key":"e_1_3_2_1_28_1","volume-title":"STAR: Steiner-Tree Approximation in Relationship Graphs. In ICDE. 868\u2013879.","author":"Kasneci Gjergji","year":"2009","unstructured":"Gjergji Kasneci , Maya Ramanath , Mauro Sozio , Fabian\u00a0 M. Suchanek , and Gerhard Weikum . 2009 . STAR: Steiner-Tree Approximation in Relationship Graphs. In ICDE. 868\u2013879. Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabian\u00a0M. Suchanek, and Gerhard Weikum. 2009. STAR: Steiner-Tree Approximation in Relationship Graphs. In ICDE. 868\u2013879."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2017.05.005"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2019.01.001"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2017.02.001"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2018.10.004"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Evgeny Kharlamov Martin\u00a0G. Skj\u00e6veland Dag Hovland Theofilos Mailis Ernesto Jim\u00e9nez-Ruiz Guohui Xiao Ahmet Soylu Ian Horrocks and Arild Waaler. 2018. Finding Data Should be Easier than Finding Oil. In BigData. 1747\u20131756.  Evgeny Kharlamov Martin\u00a0G. Skj\u00e6veland Dag Hovland Theofilos Mailis Ernesto Jim\u00e9nez-Ruiz Guohui Xiao Ahmet Soylu Ian Horrocks and Arild Waaler. 2018. Finding Data Should be Easier than Finding Oil. In BigData. 1747\u20131756.","DOI":"10.1109\/BigData.2018.8622035"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Benny Kimelfeld and Yehoshua Sagiv. 2006. Finding and approximating top-k answers in keyword proximity search. In PODS. 173\u2013182.  Benny Kimelfeld and Yehoshua Sagiv. 2006. Finding and approximating top-k answers in keyword proximity search. In PODS. 173\u2013182.","DOI":"10.1145\/1142351.1142377"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2302294"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.3233\/SW-140134"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Guoliang Li Beng\u00a0Chin Ooi Jianhua Feng Jianyong Wang and Lizhu Zhou. 2008. EASE: an effective 3-in-1 keyword search method for unstructured semi-structured and structured data. In SIGMOD. 903\u2013914.  Guoliang Li Beng\u00a0Chin Ooi Jianhua Feng Jianyong Wang and Lizhu Zhou. 2008. EASE: an effective 3-in-1 keyword search method for unstructured semi-structured and structured data. In SIGMOD. 903\u2013914.","DOI":"10.1145\/1376616.1376706"},{"key":"e_1_3_2_1_38_1","unstructured":"Rong-Hua Li Lu Qin Jeffrey\u00a0Xu Yu and Rui Mao. 2016. Efficient and Progressive Group Steiner Tree Search. In SIGMOD. 91\u2013106.  Rong-Hua Li Lu Qin Jeffrey\u00a0Xu Yu and Rui Mao. 2016. Efficient and Progressive Group Steiner Tree Search. In SIGMOD. 91\u2013106."},{"key":"e_1_3_2_1_39_1","first-page":"445","article-title":"An Experimental Study on Hub Labeling based Shortest Path Algorithms","volume":"11","author":"Li Ye","year":"2017","unstructured":"Ye Li , Leong\u00a0Hou U, Man\u00a0Lung Yiu , and Ngai\u00a0Meng Kou . 2017 . An Experimental Study on Hub Labeling based Shortest Path Algorithms . PVLDB 11 , 4 (2017), 445 \u2013 457 . Ye Li, Leong\u00a0Hou U, Man\u00a0Lung Yiu, and Ngai\u00a0Meng Kou. 2017. An Experimental Study on Hub Labeling based Shortest Path Algorithms. PVLDB 11, 4 (2017), 445\u2013457.","journal-title":"PVLDB"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Alexander\u00a0H. Miller Adam Fisch Jesse Dodge Amir-Hossein Karimi Antoine Bordes and Jason Weston. 2016. Key-Value Memory Networks for Directly Reading Documents. In EMNLP.  Alexander\u00a0H. Miller Adam Fisch Jesse Dodge Amir-Hossein Karimi Antoine Bordes and Jason Weston. 2016. Key-Value Memory Networks for Directly Reading Documents. In EMNLP.","DOI":"10.18653\/v1\/D16-1147"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331166"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Dian Ouyang Lu Qin Lijun Chang Xuemin Lin Ying Zhang and Qing Zhu. 2018. When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks. In SIGMOD. 709\u2013724.  Dian Ouyang Lu Qin Lijun Chang Xuemin Lin Ying Zhang and Qing Zhu. 2018. When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks. In SIGMOD. 709\u2013724.","DOI":"10.1145\/3183713.3196913"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Atish\u00a0Das Sarma Sreenivas Gollapudi Marc Najork and Rina Panigrahy. 2010. A sketch-based distance oracle for web-scale graphs. In WSDM. 401\u2013410.  Atish\u00a0Das Sarma Sreenivas Gollapudi Marc Najork and Rina Panigrahy. 2010. A sketch-based distance oracle for web-scale graphs. In WSDM. 401\u2013410.","DOI":"10.1145\/1718487.1718537"},{"key":"e_1_3_2_1_44_1","volume-title":"SINA: Semantic interpretation of user queries for question answering on interlinked data. J. Web Semant. 30(2015).","author":"Shekarpour Saeedeh","year":"2015","unstructured":"Saeedeh Shekarpour , Edgard Marx , Axel- Cyrille\u00a0Ngonga Ngomo , and S\u00f6ren Auer . 2015 . SINA: Semantic interpretation of user queries for question answering on interlinked data. J. Web Semant. 30(2015). Saeedeh Shekarpour, Edgard Marx, Axel-Cyrille\u00a0Ngonga Ngomo, and S\u00f6ren Auer. 2015. SINA: Semantic interpretation of user queries for question answering on interlinked data. J. Web Semant. 30(2015)."},{"key":"e_1_3_2_1_45_1","volume-title":"Shortest-path queries in static networks. ACM Comput. Surv. 46, 4","author":"Sommer Christian","year":"2014","unstructured":"Christian Sommer . 2014. Shortest-path queries in static networks. ACM Comput. Surv. 46, 4 ( 2014 ), 45:1\u201345:31. Christian Sommer. 2014. Shortest-path queries in static networks. ACM Comput. Surv. 46, 4 (2014), 45:1\u201345:31."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Thanh Tran Philipp Cimiano Sebastian Rudolph and Rudi Studer. 2007. Ontology-Based Interpretation of Keywords for Semantic Search. In ISWC + ASWC. 523\u2013536.  Thanh Tran Philipp Cimiano Sebastian Rudolph and Rudi Studer. 2007. Ontology-Based Interpretation of Keywords for Semantic Search. In ISWC + ASWC. 523\u2013536.","DOI":"10.1007\/978-3-540-76298-0_38"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Thanh Tran Haofen Wang Sebastian Rudolph and Philipp Cimiano. 2009. Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data. In ICDE. 405\u2013416.  Thanh Tran Haofen Wang Sebastian Rudolph and Philipp Cimiano. 2009. Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data. In ICDE. 405\u2013416.","DOI":"10.1109\/ICDE.2009.119"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90021-2"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733088"},{"key":"e_1_3_2_1_51_1","first-page":"67","article-title":"Keyword Search in Relational Databases: A Survey","volume":"33","author":"Yu Jeffrey\u00a0Xu","year":"2010","unstructured":"Jeffrey\u00a0Xu Yu , Lu Qin , and Lijun Chang . 2010 . Keyword Search in Relational Databases: A Survey . IEEE Data Eng. Bull. 33 , 1 (2010), 67 \u2013 78 . Jeffrey\u00a0Xu Yu, Lu Qin, and Lijun Chang. 2010. Keyword Search in Relational Databases: A Survey. IEEE Data Eng. Bull. 33, 1 (2010), 67\u201378.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Hongyang Zhang Huacheng Yu and Ashish Goel. 2019. Pruning based Distance Sketches with Provable Guarantees on Random Graphs. In WWW. 2301\u20132311.  Hongyang Zhang Huacheng Yu and Ashish Goel. 2019. Pruning based Distance Sketches with Provable Guarantees on Random Graphs. In WWW. 2301\u20132311.","DOI":"10.1145\/3308558.3313708"},{"key":"e_1_3_2_1_53_1","volume-title":"SPARK: Adapting Keyword Query to Semantic Search. In ISWC + ASWC. 694\u2013707.","author":"Zhou Qi","year":"2007","unstructured":"Qi Zhou , Chong Wang , Miao Xiong , Haofen Wang , and Yong Yu . 2007 . SPARK: Adapting Keyword Query to Semantic Search. In ISWC + ASWC. 694\u2013707. Qi Zhou, Chong Wang, Miao Xiong, Haofen Wang, and Yong Yu. 2007. SPARK: Adapting Keyword Query to Semantic Search. In ISWC + ASWC. 694\u2013707."},{"key":"e_1_3_2_1_54_1","unstructured":"Andy\u00a0Diwen Zhu Hui Ma Xiaokui Xiao Siqiang Luo Youze Tang and Shuigeng Zhou. 2013. Shortest path and distance queries on road networks: towards bridging theory and practice. In SIGMOD. 857\u2013868.  Andy\u00a0Diwen Zhu Hui Ma Xiaokui Xiao Siqiang Luo Youze Tang and Shuigeng Zhou. 2013. Shortest path and distance queries on road networks: towards bridging theory and practice. In SIGMOD. 857\u2013868."}],"event":{"name":"WWW '20: The Web Conference 2020","location":"Taipei Taiwan","acronym":"WWW '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of The Web Conference 2020"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380110","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3366423.3380110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:59Z","timestamp":1750199579000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,20]]},"references-count":54,"alternative-id":["10.1145\/3366423.3380110","10.1145\/3366423"],"URL":"https:\/\/doi.org\/10.1145\/3366423.3380110","relation":{},"subject":[],"published":{"date-parts":[[2020,4,20]]},"assertion":[{"value":"2020-04-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}