{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:50:52Z","timestamp":1775717452306,"version":"3.50.1"},"reference-count":116,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T00:00:00Z","timestamp":1617148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T00:00:00Z","timestamp":1617148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002108"],"award-info":[{"award-number":["62002108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2021,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>With the prevalence of Internet access and online services, various big graphs are generated in many real applications (e.g., online social networks and knowledge graphs). An important task on analyzing and mining these graphs is keyword search. Essentially, given a graph<jats:italic>G<\/jats:italic>and query<jats:italic>Q<\/jats:italic>associated with a set of keywords, the keyword search aims to find a substructure (e.g., rooted tree or subgraph)<jats:italic>S<\/jats:italic>in<jats:italic>G<\/jats:italic>such that nodes in<jats:italic>S<\/jats:italic>collectively cover part of or all keywords in<jats:italic>Q<\/jats:italic>, and in the meanwhile,<jats:italic>S<\/jats:italic>is optimal on some user specified semantics. Keyword search on graphs can be applied in many real-life applications, such as point-of-interests recommendation and web search facility. In spite of the great importance of graph keyword search, we, however, notice that the latest survey on this topic is far out of date. Consequently, there is prompt need to conduct a comprehensive survey in this research direction. Motivated by this, in this survey, we systematically review graph keyword search studies by classifying the existing works into different categories according to the specific problem definition. This survey aims to provide the researchers a comprehensive understanding of existing graph keyword search solutions.<\/jats:p>","DOI":"10.1007\/s41019-021-00154-4","type":"journal-article","created":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T12:02:46Z","timestamp":1617192166000},"page":"142-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Keyword Search on Large Graphs: A Survey"],"prefix":"10.1007","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3417-823X","authenticated-orcid":false,"given":"Jianye","family":"Yang","sequence":"first","affiliation":[]},{"given":"Wu","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,31]]},"reference":[{"key":"154_CR1","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1109\/TKDE.2019.2894140","volume":"32","author":"T Abeywickrama","year":"2020","unstructured":"Abeywickrama T, Cheema MA, Khan A (2020) K-spin: Efficiently processing spatial keyword queries on road networks. Trans Knowl Data Eng 32:983\u2013997","journal-title":"Trans Knowl Data Eng"},{"key":"154_CR2","doi-asserted-by":"crossref","unstructured":"Abraham I, Delling D, Goldberg AV, Werneck RFF (2011) A hub-based labeling algorithm for shortest paths in road networks. In: SEA, pp 230\u2013241","DOI":"10.1007\/978-3-642-20662-7_20"},{"key":"154_CR3","doi-asserted-by":"crossref","unstructured":"Bahmani B, Goel A (2012) Partitioned multi-indexing: bringing order to social search. In: WWW, pp 399\u2013408","DOI":"10.1145\/2187836.2187891"},{"key":"154_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo RJ, Ma Y, Srikant R (2007) Scaling up all pairs similarity search. In: WWW, pp 131\u2013140","DOI":"10.1145\/1242572.1242591"},{"key":"154_CR5","doi-asserted-by":"crossref","unstructured":"Bhalotia G, Hulgeri A, Nakhe C, Chakrabarti S, Sudarshan S (2002) Keyword searching and browsing in databases using banks. In: ICDE, pp 431\u2013440","DOI":"10.1109\/ICDE.2002.994756"},{"key":"154_CR6","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10115-015-0895-7","volume":"49","author":"P Bouros","year":"2015","unstructured":"Bouros P, Mamoulis N, Ge S, Terrovitis M (2015) Set containment join revisited. Knowl Inf Syst 49:375\u2013402","journal-title":"Knowl Inf Syst"},{"key":"154_CR7","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/s10791-020-09379-9","volume":"23","author":"S Bryson","year":"2020","unstructured":"Bryson S, Davoudi H, Golab L, Kargar M, Lytvyn Y, Mierzejewski P, Szlichta J, Zihaya M (2020) Robust keyword search in large attributed graphs. Inf Retriev J 23:502\u2013524","journal-title":"Inf Retriev J"},{"key":"154_CR8","first-page":"1136","volume":"5","author":"X Cao","year":"2012","unstructured":"Cao X, Chen L, Cong G, Xiao X (2012) Keyword-aware optimal route search. VLDB 5:1136\u20131147","journal-title":"VLDB"},{"key":"154_CR9","doi-asserted-by":"crossref","unstructured":"Charikar M, Chekuri C, Goel A, Guha S (1998) Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median. In: STOC","DOI":"10.1145\/276698.276719"},{"key":"154_CR10","first-page":"217","volume":"6","author":"L Chen","year":"2013","unstructured":"Chen L, Cong G, Jensen CS, Wu D (2013) Spatial keyword query processing: an experimental evaluation. VLDB 6:217\u2013228","journal-title":"VLDB"},{"key":"154_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10707-019-00373-y","volume":"24","author":"L Chen","year":"2020","unstructured":"Chen L, Shang S, Yang C, Li J (2020) Spatial keyword search: a survey. Geoinformatica 24:85\u2013106","journal-title":"Geoinformatica"},{"key":"154_CR12","doi-asserted-by":"crossref","unstructured":"Choi DW, Pei J, Lin X (2016) Finding the minimum spatial keyword cover. In: ICDE, pp 685\u2013696","DOI":"10.1109\/ICDE.2016.7498281"},{"key":"154_CR13","first-page":"30","volume":"26","author":"J Coffman","year":"2014","unstructured":"Coffman J, Weaver AC (2014) An empirical performance evaluation of relational keyword search techniques. TKDE 26:30\u201342","journal-title":"TKDE"},{"key":"154_CR14","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen E, Halperin E, Kaplan H, Zwick U (2003) Reachability and distance queries via 2-hop labels. SIAM J Comput 32:1338\u20131355","journal-title":"SIAM J Comput"},{"issue":"337","key":"154_CR15","first-page":"348","volume":"2","author":"G Cong","year":"2009","unstructured":"Cong G, Jensen CS, Wu D (2009) Efficient retrieval of the top-k most relevant spatial web objects. VLDB 2(337):348","journal-title":"VLDB"},{"key":"154_CR16","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453982","author":"BB Dalvi","year":"2008","unstructured":"Dalvi BB, Kshirsagar M, Sudarshan S (2008) Keyword search on external memory data graphs. VLDB. https:\/\/doi.org\/10.14778\/1453856.1453982","journal-title":"VLDB"},{"issue":"14778\/2856318","key":"154_CR17","first-page":"2856330","volume":"10","author":"D Deng","year":"2015","unstructured":"Deng D, Li G, Wen H, Feng J (2015) An efficient partition based method for exact set similarity joints. VLDB 10(14778\/2856318):2856330","journal-title":"VLDB"},{"key":"154_CR18","doi-asserted-by":"crossref","unstructured":"Deng D, Tao Y, Li G (2018) Overlap set similarity joins with theoretical guarantees. In: SIGMOD, pp 905\u2013920","DOI":"10.1145\/3183713.3183748"},{"key":"154_CR19","first-page":"48","volume":"7","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 7:48\u201350","journal-title":"Numer Math"},{"key":"154_CR20","doi-asserted-by":"crossref","unstructured":"Ding B, Yu JX, Wang S, Qin L, Zhang X, Lin X (2007) Finding top-k min-cost connected trees in databases. In: ICDE, pp 836\u2013845","DOI":"10.1109\/ICDE.2007.367929"},{"key":"154_CR21","first-page":"185","volume":"132","author":"SE Dreyfus","year":"1971","unstructured":"Dreyfus SE, Wagner RA (1971) The Steiner problem in graphs. Networks 132:185\u2013207","journal-title":"Networks"},{"key":"154_CR22","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994538","author":"Y Fang","year":"2016","unstructured":"Fang Y, Cheng R, Luo S, Hu J (2016) Effective community search for large attributed graphs. VLDB. https:\/\/doi.org\/10.14778\/2994509.2994538","journal-title":"VLDB"},{"key":"154_CR23","doi-asserted-by":"crossref","unstructured":"Felipe ID, Hristidis V, Rishe N (2008) Keyword search on spatial databases. In: ICDE, pp 656\u2013665","DOI":"10.1109\/ICDE.2008.4497474"},{"issue":"10","key":"154_CR24","first-page":"1110","volume":"11","author":"F Fier","year":"2018","unstructured":"Fier F, Augsten N, Bouros P, Leser U, Freytag JC (2018) Set similarity joins on mapreduce: an experimental survey. PVLDB 11(10):1110\u20131122","journal-title":"PVLDB"},{"key":"154_CR25","doi-asserted-by":"crossref","unstructured":"Fu H, Anyanwu K (2011) Effectively interpreting keyword queries on RDF databases with a rear view. In: International semantic web conference, pp 193\u2013208","DOI":"10.1007\/978-3-642-25073-6_13"},{"key":"154_CR26","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1109\/TKDE.2014.2365820","volume":"27","author":"Y Gao","year":"2015","unstructured":"Gao Y, Qin X, Zheng B, Chen G (2015) Efficient reverse top-k boolean spatial keyword queries on road networks. Trans Knowl Data Eng 27:1205\u20131218","journal-title":"Trans Knowl Data Eng"},{"key":"154_CR27","first-page":"469","volume":"17","author":"Y Gao","year":"2016","unstructured":"Gao Y, Zhao J, Zheng B, Chen G (2016) Efficient collective spatial keyword query processing on road networks. TITS 17:469\u2013480","journal-title":"TITS"},{"key":"154_CR28","unstructured":"Garca G, Izquierdo Y, Menendez E, Dartayre F, Casanova MA (2017) RDF keyword-based query technology meets a real-world dataset. In: EDBT, pp 656\u2013667"},{"key":"154_CR29","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jagm.2000.1096","volume":"37","author":"N Garg","year":"2000","unstructured":"Garg N, Konjevod G, Ravi R (2000) A polylogarithmic approximation algorithm for the group Steiner tree problem. J Algorithms 37:66\u201384","journal-title":"J Algorithms"},{"key":"154_CR30","doi-asserted-by":"crossref","unstructured":"Golenberg K, Kimelfeld B, Sagiv Y (2008) Keyword proximity search in complex data graphs. In: SIGMOD, pp 927\u2013940","DOI":"10.1145\/1376616.1376708"},{"key":"154_CR31","unstructured":"Gonzalez J, Xin R, Dave A, Crankshaw D, Franklin M, Stoica I (2014) Graphx: graph processing in a distributed dataflow framework. In: OSDI, pp 599\u2013613"},{"key":"154_CR32","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: Scalable feature learning for networks. In: KDD","DOI":"10.1145\/2939672.2939754"},{"key":"154_CR33","doi-asserted-by":"crossref","unstructured":"Guo T, Cao X, Cong G (2015) Efficient algorithms for answering the m-closest keywords query. In: SIGMOD, pp 405\u2013418","DOI":"10.1145\/2723372.2723723"},{"key":"154_CR34","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp 47\u201357","DOI":"10.1145\/971697.602266"},{"key":"154_CR35","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Inductive representation learning on large graphs. In: NIPS"},{"key":"154_CR36","doi-asserted-by":"crossref","unstructured":"Han S, Zou L, Yu JX, Zhao D (2017) Keyword search on RDF graph\u2014a query graph assembly approach. In: CIKM, pp 227\u2013236","DOI":"10.1145\/3132847.3132957"},{"key":"154_CR37","doi-asserted-by":"crossref","unstructured":"Hao J, Niu B, Qin X (2019) A keyword-aware optimal route query algorithm on large-scale road networks. In: 2019 20th IEEE international conference on mobile data management (MDM), pp 587\u2013592","DOI":"10.1109\/MDM.2019.00124"},{"key":"154_CR38","doi-asserted-by":"crossref","unstructured":"Haryanto AA, Islam MS, Taniar D, Cheema MA (2019) Ig-tree: an efficient spatial keyword index for planning best path queries on road networks. In: WWW, pp 1359\u20131399","DOI":"10.1007\/s11280-018-0643-5"},{"key":"154_CR39","doi-asserted-by":"crossref","unstructured":"He H, Wang H, Yang J, Yu PS (2007) Blinks: ranked keyword searches on graphs. In: SIGMOD, pp 305\u2013316","DOI":"10.1145\/1247480.1247516"},{"key":"154_CR40","doi-asserted-by":"crossref","unstructured":"Hu J, Cheng R, Huang Z, Fang Y, Luo S (2017) On embedding uncertain graphs. In: CIKM, pp 157\u2013166","DOI":"10.1145\/3132847.3132885"},{"key":"154_CR41","doi-asserted-by":"crossref","unstructured":"Huang W, Dai G, Ge Y, Liu Y (2019) Top-k nearest keyword search in public transportation networks. In: 2019 15th international conference on semantics, knowledge and grids, pp 67\u201374","DOI":"10.1109\/SKG49510.2019.00020"},{"key":"154_CR42","doi-asserted-by":"crossref","unstructured":"Huang X, Cheng H, Qin L, Tian W, Yu JX (2014) Querying k-truss community in large and dynamic graphs. In: SIGMOD, pp 1311\u20131322","DOI":"10.1145\/2588555.2610495"},{"key":"154_CR43","first-page":"949","volume":"10","author":"X Huang","year":"2017","unstructured":"Huang X, Lakshmanan LVS (2017) Attribute-driven community search. VLDB 10:949\u2013960","journal-title":"VLDB"},{"key":"154_CR44","doi-asserted-by":"crossref","unstructured":"Ihler E (1991) The complexity of approximating the class Steiner tree problem. In: 17th international workshop, WG","DOI":"10.1007\/3-540-55121-2_8"},{"key":"154_CR45","doi-asserted-by":"crossref","unstructured":"Jia Z, Kwon Y, Shipman G, McCormick P, Erez M, Aiken A (2018) A distributed multi-GPU system for fast graph processing. In: SIGMOD, pp 297\u2013310","DOI":"10.14778\/3157794.3157799"},{"key":"154_CR46","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2956535","author":"J Jiang","year":"2019","unstructured":"Jiang J, Choi B, Xu J, Bhowmick SS (2019) A generic ontology framework for indexing keyword search on massive graphs. Trans Knowl Data Eng. https:\/\/doi.org\/10.1109\/TKDE.2019.2956535","journal-title":"Trans Knowl Data Eng"},{"key":"154_CR47","doi-asserted-by":"crossref","unstructured":"Jiang J, Huang X, Choi B, Xu J, Bhowmick SS, Xu L (2020) Ppkws: An efficient framework for keyword search on public-private networks. In: ICDE, pp 457\u2013468","DOI":"10.1109\/ICDE48307.2020.00046"},{"key":"154_CR48","doi-asserted-by":"crossref","unstructured":"Jiang M, Fu AW, Wong RC (2015) Exact top-k nearest keyword search in large networks. In: SIGMOD, pp 393\u2013404","DOI":"10.1145\/2723372.2749447"},{"key":"154_CR49","unstructured":"Kacholia V, Pandit S, Chakrabarti S, Sudarshan S, Desai R, Karambelkar H (2005) Bidirectional expansion for keyword search on graph databases. In: VLDB \u201905: Proceedings of the 31st international conference on very large data bases, pp 505\u2013516"},{"key":"154_CR50","doi-asserted-by":"crossref","unstructured":"Kaffes V, Belesiotis A, Skoutas D, Skiadopoulos S (2018) Finding shortest keyword covering routes in road networks. In: SSDBM","DOI":"10.1145\/3221269.3223038"},{"issue":"14778\/2021017","key":"154_CR51","first-page":"2021025","volume":"10","author":"M Kargar","year":"2011","unstructured":"Kargar M, An A (2011) Keyword search in graphs: finding r-cliques. VLDB 10(14778\/2021017):2021025","journal-title":"VLDB"},{"key":"154_CR52","doi-asserted-by":"crossref","unstructured":"Kargar M, An A (2012) Efficient top-k keyword search in graphs with polynomial delay. In: ICDE, pp 1269\u20131272","DOI":"10.1109\/ICDE.2012.124"},{"key":"154_CR53","doi-asserted-by":"crossref","unstructured":"Kargar M, Zihayat M, An A (2013) Finding affordable and collaborative teams from a network of experts. In: Proceedings of the 2013 SIAM international conference on data mining, pp 587\u2013595","DOI":"10.1137\/1.9781611972832.65"},{"key":"154_CR54","doi-asserted-by":"crossref","unstructured":"Kasneci G, Ramanath M, Sozio M, Suchanek FM, Weikum G (2009) Star: Steiner-tree approximation in relationship graphs. In: ICDE","DOI":"10.1109\/ICDE.2009.64"},{"key":"154_CR55","doi-asserted-by":"crossref","unstructured":"Kimelfeld B, Sagiv Y(2006) Finding and approximating top-k answers in keyword proximity search. In: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp 173\u2013182","DOI":"10.1145\/1142351.1142377"},{"key":"154_CR56","doi-asserted-by":"crossref","unstructured":"Kolahdouzan M, Shahabi C (2004) Voronoi-based k nearest neighbor search for spatial network databases. VLDB, pp 840\u2013851","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"154_CR57","doi-asserted-by":"crossref","unstructured":"Kunkel A, Rheinl\u00e4nder A, Schiefer C, Helmer S, Bouros+3 P, Leser U (2016) Piejoin: Towards parallel set containment joins. In: SSDBM, p\u00a011","DOI":"10.1145\/2949689.2949694"},{"key":"154_CR58","doi-asserted-by":"crossref","unstructured":"Lappas T, Liu K, Terzi E (2009) Finding a team of experts in social networks. In: KDD, pp 467\u2013476","DOI":"10.1145\/1557019.1557074"},{"key":"154_CR59","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.7.401","author":"EL Lawler","year":"1972","unstructured":"Lawler EL (1972) A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Manag Sci. https:\/\/doi.org\/10.1287\/mnsc.18.7.401","journal-title":"Manag Sci"},{"key":"154_CR60","first-page":"2774","volume":"26","author":"W Le","year":"2014","unstructured":"Le W, Li F, Kementsietsidie A, Duan S (2014) Scalable keyword search on large RDF data. TKDE 26:2774\u20132788","journal-title":"TKDE"},{"key":"154_CR61","doi-asserted-by":"crossref","unstructured":"Li G, Ooi BC, Feng J, Wang J, Zhou L (2008) Ease: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data. In: SIGMOD, pp 903\u2013914","DOI":"10.1145\/1376616.1376706"},{"key":"154_CR62","doi-asserted-by":"crossref","unstructured":"Li RH, Qin L, Yu JX, Mao R (2016) Efficient and progressive group Steiner tree search. In: SIGMOD, pp 91\u2013106","DOI":"10.1145\/2882903.2915217"},{"key":"154_CR63","doi-asserted-by":"crossref","unstructured":"Li Z, Lee KC, Zheng B, Lee WC, Lee D, Wang X (2010) Ir-tree: an efficient index for geographic document search. TKDE","DOI":"10.1109\/TKDE.2010.149"},{"key":"154_CR64","doi-asserted-by":"crossref","unstructured":"Liu Q, Zhu Y, Zhao M, Huang X, Xu J, Gao Y (2020) Vac: Vertex-centric attributed community search. In: ICDE, pp 937\u2013948","DOI":"10.1109\/ICDE48307.2020.00086"},{"key":"154_CR65","doi-asserted-by":"crossref","unstructured":"Luo J, Cao X, Xie X, Qu Q, Xu Z, Jensen CS (2020) Efficient attribute-constrained co-located community search. In: ICDE, pp 1201\u20131212","DOI":"10.1109\/ICDE48307.2020.00108"},{"key":"154_CR66","first-page":"1966","volume":"5","author":"S Luo","year":"2012","unstructured":"Luo S, Luo Y, Zhou S, Cong G, Guan J (2012) Disks: A system for distributed spatial group keyword search on road networks. VLDB 5:1966\u20131969","journal-title":"VLDB"},{"key":"154_CR67","doi-asserted-by":"crossref","unstructured":"Luo Y, Fletcher GH, Hidders J, De\u00a0Bra P (2015) Efficient and scalable trie-based algorithms for computing set containment relations. In: ICDE, pp 303\u2013314","DOI":"10.1109\/ICDE.2015.7113293"},{"key":"154_CR68","doi-asserted-by":"crossref","unstructured":"Majumder A, Datta S, Naidu K (2012) Capacitated team formation problem on social networks. In: KDD, pp 1005\u20131013","DOI":"10.1145\/2339530.2339690"},{"issue":"9","key":"154_CR69","first-page":"636","volume":"9","author":"W Mann","year":"2016","unstructured":"Mann W, Augsten N, Bouros P (2016) An empirical evaluation of set similarity join techniques. PVLDB 9(9):636\u2013647","journal-title":"PVLDB"},{"key":"154_CR70","doi-asserted-by":"crossref","unstructured":"Qiao M, Qin L, Cheng H, Yu JX, Tian W (2013) Top-k nearest keyword search on large graphs. VLDB, pp 901\u2013912","DOI":"10.14778\/2536206.2536217"},{"key":"154_CR71","doi-asserted-by":"crossref","unstructured":"Qin L, Yu JX, Chang L, Tao Y (2009) Querying communities in relational databases. In: ICDE, pp 724\u2013735","DOI":"10.1109\/ICDE.2009.67"},{"key":"154_CR72","doi-asserted-by":"crossref","unstructured":"Rocha-Junior JB, Gkorgkas O, Jonassen S, Norvag K (2011) Efficient processing of top-k spatial keyword queries. In: SSTD","DOI":"10.1007\/978-3-642-22922-0_13"},{"key":"154_CR73","doi-asserted-by":"crossref","unstructured":"Rocha-Junior JB, Norvag K (2012) Top-k spatial keyword queries on road networks. In: EDBT, pp 168\u2013179","DOI":"10.1145\/2247596.2247617"},{"key":"154_CR74","first-page":"93","volume":"4","author":"JB Rocha-Junior","year":"2010","unstructured":"Rocha-Junior JB, Vlachou A, Doulkeridis C, N\u00f8rv\u00e5g K (2010) Efficient processing of top-k spatial preference queries. VLDB 4:93\u2013104","journal-title":"VLDB"},{"key":"154_CR75","unstructured":"Sarma AD, Gollapudi S, Najork M, Panigrahy R (2010) A sketch-based distance oracle for web-scale graphs. In: WSDM, pp 401\u2013410"},{"key":"154_CR76","doi-asserted-by":"crossref","unstructured":"Shan Y, Li M, Chen Y (2017) Constructing target-aware results for keyword search on knowledge graphs. DKE, pp 1\u201323","DOI":"10.1016\/j.datak.2017.02.001"},{"key":"154_CR77","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.websem.2014.06.002","volume":"30","author":"S Shekarpour","year":"2015","unstructured":"Shekarpour S, Marx E, Ngomo ACN, Auer S (2015) Sina: Semantic interpretation of user queries for question answering on interlinked data. J Web Seman 30:39\u201351","journal-title":"J Web Seman"},{"key":"154_CR78","first-page":"893","volume":"29","author":"J Shi","year":"2016","unstructured":"Shi J, Wu D, Mamoulis N (2016) Top-k relevant semantic place retrieval on spatial RDF data. SIGMOD 29:893\u2013917","journal-title":"SIGMOD"},{"key":"154_CR79","doi-asserted-by":"crossref","unstructured":"Shi Y, Cheng G, Kharlamov E (2020) Keyword search over knowledge graphs via static and dynamic hub labelings. In: WWW, pp 235\u2013245","DOI":"10.1145\/3366423.3380110"},{"key":"154_CR80","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadopoulos S, Sheng C, Stefanidis K (2011) Nearest keyword search in xml documents. In: SIGMOD, pp 589\u2013600","DOI":"10.1145\/1989323.1989385"},{"key":"154_CR81","doi-asserted-by":"crossref","unstructured":"Teng Y, Cheng X, Su S, Bi R (2016) Privacy-preserving top-k nearest keyword search on outsourced graphs. In: 2016 IEEE Trustcom\/BigDataSE\/ISPA, pp 815\u2013822","DOI":"10.1109\/TrustCom.2016.0143"},{"key":"154_CR82","doi-asserted-by":"crossref","unstructured":"Tran T, Wang H, Rudolph S, Cimiano P (2009) Top-k exploration of query candidates for efficient keyword search on graph-shaped (RDF) data. In: ICDE, pp 405\u2013416","DOI":"10.1109\/ICDE.2009.119"},{"key":"154_CR83","doi-asserted-by":"crossref","unstructured":"Wang H, Aggarwal CC (2009) A survey of algorithms for keyword search on graph data. In: Managing and mining graph data, pp 249\u2013273","DOI":"10.1007\/978-1-4419-6045-0_8"},{"key":"154_CR84","doi-asserted-by":"crossref","unstructured":"Wang J, Li G, Feng J (2012) Can we beat the prefix filtering?: An adaptive framework for similarity join and search. In: SIGMOD","DOI":"10.1145\/2213836.2213847"},{"key":"154_CR85","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1109\/TMC.2018.2860978","volume":"18","author":"W Wang","year":"2018","unstructured":"Wang W, He Z, Shi P, Wu W, Jiang Y, An B, Hao Z, Chen B (2018) Strategic social team crowdsourcing: forming a team of truthful workers for crowdsourcing in social networks. IEEE Trans Mobile Comput 18:1419\u20131432","journal-title":"IEEE Trans Mobile Comput"},{"issue":"9","key":"154_CR86","first-page":"925","volume":"10","author":"X Wang","year":"2017","unstructured":"Wang X, Qin L, Lin X, Zhang Y, Chang L (2017) Leveraging set relations in exact set similarity join. PVLDB 10(9):925\u2013936","journal-title":"PVLDB"},{"key":"154_CR87","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/TKDE.2017.2690421","volume":"29","author":"YT Wen","year":"2017","unstructured":"Wen YT, Yeo J, Peng WC, Hwang SW (2017) Efficient keyword-aware representative travel route recommendation. IEEE Trans Knowl Data Eng 29:1639\u20131652","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"154_CR88","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/s00778-012-0271-0","volume":"21","author":"D Wu","year":"2012","unstructured":"Wu D, Cong G, Jensen CS (2012) A framework for efficient spatial web object retrieval. VLDB 21:797\u2013822","journal-title":"VLDB"},{"key":"154_CR89","doi-asserted-by":"publisher","DOI":"10.1145\/2000824.2000825","author":"C Xiao","year":"2011","unstructured":"Xiao C, Wang W, Lin X, Yu JX, Wang G (2011) Efficient similarity joins for near-duplicate detection. ACM TODS. https:\/\/doi.org\/10.1145\/2000824.2000825","journal-title":"ACM TODS"},{"key":"154_CR90","doi-asserted-by":"crossref","unstructured":"Yang J, Zhang W, Wang X, Zhang Y, Lin X (2020) Distributed streaming set similarity join. In: ICDE","DOI":"10.1109\/ICDE48307.2020.00055"},{"key":"154_CR91","doi-asserted-by":"crossref","unstructured":"Yang J, Zhang W, Yang S, Zhang Y, Lin X (2017) Tt-join: Efficient set containment join. In: ICDE","DOI":"10.1109\/ICDE.2017.107"},{"key":"154_CR92","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s00778-018-0505-x","volume":"27","author":"J Yang","year":"2018","unstructured":"Yang J, Zhang W, Yang S, Zhang Y, Lin X, Yuan L (2018) Efficient set containment join. VLDB J 27:471\u2013495","journal-title":"VLDB J"},{"key":"154_CR93","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-016-0383-3","author":"J Yang","year":"2017","unstructured":"Yang J, Zhang W, Zhang Y, Wang X, Lin X (2017) Categorical top-k spatial influence query. WWWJ. https:\/\/doi.org\/10.1007\/s11280-016-0383-3","journal-title":"WWWJ"},{"key":"154_CR94","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733088","author":"M Yang","year":"2014","unstructured":"Yang M, Ding B, Chaudhuri S, Chakrabarti K (2014) Finding patterns in a knowledge base using keywords to compose table answers. VLDB. https:\/\/doi.org\/10.14778\/2733085.2733088","journal-title":"VLDB"},{"key":"154_CR95","doi-asserted-by":"crossref","unstructured":"Yang Y, Agrawal D, Jagadish H, Tung AKH, Wu S (2019) An efficient parallel keyword search engine on knowledge graphs. In: ICDE, pp 338\u2013349","DOI":"10.1109\/ICDE.2019.00038"},{"key":"154_CR96","doi-asserted-by":"crossref","unstructured":"Yang Y, Tung AKH (2020) Efficient radial pattern keyword search on knowledge graphs in parallel. arXiv:Databases","DOI":"10.1109\/ICDE.2019.00038"},{"key":"154_CR97","doi-asserted-by":"crossref","unstructured":"Yao B, Tang M, Li F (2011) Multi-approximate-keyword routing in GIS data. In: Proceedings of the 19th ACM SIGSPATIAL international conference on advances in geographic information systems, pp 201\u2013210","DOI":"10.1145\/2093973.2094001"},{"key":"154_CR98","doi-asserted-by":"publisher","first-page":"20309","DOI":"10.1109\/ACCESS.2018.2819992","volume":"6","author":"X Yin","year":"2018","unstructured":"Yin X, Qu C, Wang Q, Wu F, Liu B, Chen F, Chen X, Fang D (2018) Social connection aware team formation for participatory tasks. IEEE Access 6:20309\u201320319","journal-title":"IEEE Access"},{"key":"154_CR99","unstructured":"Yu JX, Qin L, Chang L (2010) Keyword search in relational databases: a survey. IEEE BULLETIN, pp 67\u201378"},{"key":"154_CR100","doi-asserted-by":"crossref","unstructured":"Zhang C, Zhang Y, Zhang W, Lin X (2013) Inverted linear quadtree: efficient top k spatial keyword search. In: ICDE, pp 1706\u20131721","DOI":"10.1109\/TKDE.2016.2530060"},{"issue":"7","key":"154_CR101","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1109\/TKDE.2016.2530060","volume":"28","author":"C Zhang","year":"2016","unstructured":"Zhang C, Zhang Y, Zhang W, Lin X (2016) Inverted linear quadtree: efficient top k spatial keyword search. IEEE Trans Knowl Data Eng 28(7):1706\u20131721","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"154_CR102","unstructured":"Zhang C, Zhang Y, Zhang W, Lin X, Cheema MA, Wang X (2013) Diversified spatial keyword search on road networks. In: EDBT, pp 367\u2013378"},{"key":"154_CR103","doi-asserted-by":"crossref","unstructured":"Zhang D, Chan CY, Tan KL (2014) Processing spatial keyword query as a top-k aggregation query. In: SIGIR, pp 355\u2013364","DOI":"10.1145\/2600428.2609562"},{"key":"154_CR104","doi-asserted-by":"crossref","unstructured":"Zhao J, Gao Y, Chen G, Chen R (2018) Why-not questions on top-k geo-social keyword queries in road networks. In: ICDE, pp 965\u2013976","DOI":"10.1109\/ICDE.2018.00091"},{"key":"154_CR105","doi-asserted-by":"crossref","unstructured":"Zha, J, Gao Y, Chen G, Jensen CS, Chen R, Cai D (2017) Reverse top-k geo-social keyword queries in road networks. In: ICDE, pp 387\u2013398","DOI":"10.1109\/ICDE.2017.97"},{"key":"154_CR106","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1016\/j.ins.2019.10.021","volume":"512","author":"J Zhao","year":"2020","unstructured":"Zhao J, Gao Y, Ma C, Jin P, Wen S (2020) On efficiently diversified top-k geo-social keyword query processing in road networks. Inf Sci 512:813\u2013829","journal-title":"Inf Sci"},{"key":"154_CR107","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10707-017-0299-9","volume":"21","author":"S Zhao","year":"2017","unstructured":"Zhao S, Cheng X, Su S, Shuang K (2017) Popularity-aware collective keyword queries in road networks. GeoInformatica 21:485\u2013518","journal-title":"GeoInformatica"},{"key":"154_CR108","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.03.058","author":"S Zhao","year":"2018","unstructured":"Zhao S, Zhao L, Su S, Cheng X, Xiong L (2018) Group-based keyword-aware route querying in road networks. Inf Sci. https:\/\/doi.org\/10.1016\/j.ins.2018.03.058","journal-title":"Inf Sci"},{"key":"154_CR109","doi-asserted-by":"crossref","unstructured":"Zheng B, Zheng K, Xiao X, Su H, Yin H, Zhou X, Li G (2016) Keyword-aware continuous KNN query on road networks. In: ICDE, pp 871\u2013882","DOI":"10.1109\/ICDE.2016.7498297"},{"key":"154_CR110","doi-asserted-by":"crossref","unstructured":"Zhong R, Li G, Tan KL, Zhou L (2013) G-tree: an efficient index for KNN search on road networks. In: CIKM, pp 39\u201348","DOI":"10.1145\/2505515.2505749"},{"key":"154_CR111","doi-asserted-by":"publisher","first-page":"2175","DOI":"10.1109\/TKDE.2015.2399306","volume":"27","author":"R Zhong","year":"2015","unstructured":"Zhong R, Li G, Tan KL, Zhou L, Gong Z (2015) G-tree: an efficient and scalable index for spatial search on road networks. IEEE Trans Knowl Data Eng 27:2175\u20132189","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"154_CR112","doi-asserted-by":"crossref","unstructured":"Zhou Q, Wang C, Xiong M, Wang H, Yu Y (2007) Spark: adapting keyword query to semantic search. In: International semantic web conference, pp 694\u2013707","DOI":"10.1007\/978-3-540-76298-0_50"},{"key":"154_CR113","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s00778-017-0464-7","volume":"26","author":"Q Zhu","year":"2017","unstructured":"Zhu Q, Cheng H, Huang X (2017) I\/O-efficient algorithms for top-k nearest keyword search in massive graphs. VLDBJ 26:563\u2013583","journal-title":"VLDBJ"},{"key":"154_CR114","doi-asserted-by":"crossref","unstructured":"Zhu Y, Zhang Q, Qin L, Chang L, Yu JX (2018) Querying cohesive subgraphs by keywords. In: ICDE, pp 1324\u20131327","DOI":"10.1109\/ICDE.2018.00141"},{"key":"154_CR115","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2975793","author":"Y Zhu","year":"2020","unstructured":"Zhu Y, Zhang Q, Qin L, Chang L, Yu JX (2020) Cohesive subgraph search using keywords in large networks. IEEE Trans Knowl Data Eng. https:\/\/doi.org\/10.1109\/TKDE.2020.2975793","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"154_CR116","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959","author":"J Zobel","year":"2006","unstructured":"Zobel J, Moffat A (2006) Inverted files for text search engines. ACM Comput Surv. https:\/\/doi.org\/10.1145\/1132956.1132959","journal-title":"ACM Comput Surv"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-021-00154-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-021-00154-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-021-00154-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T00:45:40Z","timestamp":1671756340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-021-00154-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,31]]},"references-count":116,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["154"],"URL":"https:\/\/doi.org\/10.1007\/s41019-021-00154-4","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,31]]},"assertion":[{"value":"30 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}