{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T15:00:23Z","timestamp":1770994823330,"version":"3.50.1"},"reference-count":243,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T00:00:00Z","timestamp":1605830400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T00:00:00Z","timestamp":1605830400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s11280-020-00849-0","type":"journal-article","created":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T07:03:16Z","timestamp":1605855796000},"page":"297-346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["A survey of typical attributed graph queries"],"prefix":"10.1007","volume":"24","author":[{"given":"Yanhao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yuchen","family":"Li","sequence":"additional","affiliation":[]},{"given":"Ju","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Chang","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Mingke","family":"Chai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,20]]},"reference":[{"key":"849_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Chaudhuri, S., Das, G.: DBXplorer: enabling keyword search over relational databases. In: SIGMOD, p 627 (2002)","DOI":"10.1145\/564691.564782"},{"issue":"5","key":"849_CR2","doi-asserted-by":"crossref","first-page":"68:1","DOI":"10.1145\/3104031","volume":"50","author":"R Angles","year":"2017","unstructured":"Angles, R., Arenas, M., Barcel\u00f3, P, Hogan, A., Reutter, J.L., Vrgoc, D.: Foundations of modern query languages for graph databases. ACM Comput. Surv. 50(5), 68:1\u201368:40 (2017)","journal-title":"ACM Comput. Surv."},{"key":"849_CR3","doi-asserted-by":"crossref","unstructured":"Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.G.: DBpedia: A nucleus for a Web of open data. In: ISWC, pp 722\u2013735 (2007)","DOI":"10.1007\/978-3-540-76298-0_52"},{"key":"849_CR4","doi-asserted-by":"crossref","unstructured":"Azimov, R., Grigorev, S.: Context-free path querying by matrix multiplication. In: GRADES-NDA, pp 5:1\u20135:10 (2018)","DOI":"10.1145\/3210259.3210264"},{"issue":"3","key":"849_CR5","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s11280-016-0401-5","volume":"20","author":"Y Bai","year":"2017","unstructured":"Bai, Y., Wang, C., Ying, X.: Para-g: Path pattern query processing on large graphs. World Wide Web 20(3), 515\u2013541 (2017)","journal-title":"World Wide Web"},{"key":"849_CR6","doi-asserted-by":"crossref","unstructured":"Balmin, A., Hristidis, V., Papakonstantinou, Y.: ObjectRank: Authority-based keyword search in databases. In: VLDB, pp 564\u2013575 (2004)","DOI":"10.1016\/B978-012088469-8.50051-6"},{"issue":"1","key":"849_CR7","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/2830544.2830547","volume":"17","author":"A Baltadzhieva","year":"2015","unstructured":"Baltadzhieva, A., Chrupala, G.: Question quality in community question answering forums: a survey. SIGKDD Explor. Newsl. 17(1), 8\u201313 (2015)","journal-title":"SIGKDD Explor. Newsl."},{"key":"849_CR8","doi-asserted-by":"crossref","unstructured":"Bao, J.-W., Duan, N., Zhou, M., Zhao, T.: Knowledge-based question answering as machine translation. In: ACL, pp 967\u2013976 (2014)","DOI":"10.3115\/v1\/P14-1091"},{"key":"849_CR9","doi-asserted-by":"crossref","unstructured":"Bao, Z., Zeng, Y., Jagadish, H.V., Ling, T.W.: Exploratory keyword search with interactive input. In: SIGMOD, pp 871\u2013876 (2015)","DOI":"10.1145\/2723372.2735361"},{"key":"849_CR10","doi-asserted-by":"crossref","unstructured":"Barrett, C.L., Bisset, K.R., Holzer, M., Konjevod, G., Marathe, M.V., Wagner, D.: Engineering label-constrained shortest-path algorithms. In: AAIM, pp 27\u201337 (2008)","DOI":"10.1007\/978-3-540-68880-8_5"},{"issue":"3","key":"849_CR11","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1137\/S0097539798337716","volume":"30","author":"CL Barrett","year":"2000","unstructured":"Barrett, C.L., Jacob, R., Marathe, M.V.: Formal-language-constrained path problems. SIAM J. Comput. 30(3), 809\u2013837 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"849_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2010.11.002","volume":"499","author":"M Barth\u00e9lemy","year":"2011","unstructured":"Barth\u00e9lemy, M: Spatial networks. Phys. Rep. 499(1), 1\u2013101 (2011)","journal-title":"Phys. Rep."},{"key":"849_CR13","doi-asserted-by":"crossref","unstructured":"Beheshti, S.-M.-R., Benatallah, B., Nezhad, H.R.M., Allahbakhsh, M.: A framework and a language for on-line analytical processing on graphs. In: WISE, pp 213\u2013227 (2012)","DOI":"10.1007\/978-3-642-35063-4_16"},{"key":"849_CR14","unstructured":"Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword searching and browsing in databases using BANKS. In: ICDE, pp 431\u2013440 (2002)"},{"key":"849_CR15","doi-asserted-by":"crossref","unstructured":"Bi, F., Chang, L., Lin, X., Qin, L., Zhang, W.: Efficient subgraph matching by postponing cartesian products. In: SIGMOD, pp 1199\u20131214 (2016)","DOI":"10.1145\/2882903.2915236"},{"issue":"9","key":"849_CR16","first-page":"1056","volume":"11","author":"F Bi","year":"2018","unstructured":"Bi, F., Chang, L., Lin, X., Zhang, W.: An optimal and progressive approach to online search of top-k influential communities. PVLDB 11 (9), 1056\u20131068 (2018)","journal-title":"PVLDB"},{"key":"849_CR17","doi-asserted-by":"crossref","unstructured":"Bollacker, K.D., Evans, C., Paritosh, P., Sturge, T., Taylor, J.: Freebase: a collaboratively created graph database for structuring human knowledge. In: SIGMOD, pp 1247\u20131250 (2008)","DOI":"10.1145\/1376616.1376746"},{"key":"849_CR18","unstructured":"Bonchi, F., Gionis, A., Gullo, F., Ukkonen, A.: Distance oracles in edge-labeled graphs. In: EDBT, pp 547\u2013558 (2014)"},{"key":"849_CR19","unstructured":"Bonifati, A., Ciucanu, R., Lemay, A.: Learning path queries on graph databases. In: EDBT, pp 109\u2013120 (2015)"},{"issue":"1","key":"849_CR20","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/TCBB.2016.2515595","volume":"14","author":"V Bonnici","year":"2017","unstructured":"Bonnici, V., Giugno, R.: On the variable ordering in subgraph isomorphism algorithms. IEEE\/ACM Trans. Comput. Biology Bioinform. 14(1), 193\u2013203 (2017)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"issue":"S-7","key":"849_CR21","doi-asserted-by":"crossref","first-page":"S13","DOI":"10.1186\/1471-2105-14-S7-S13","volume":"14","author":"V Bonnici","year":"2013","unstructured":"Bonnici, V., Giugno, R., Pulvirenti, A., Shasha, D.E., Ferro, A.: A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinforma. 14(S-7), S13 (2013)","journal-title":"BMC Bioinforma."},{"issue":"3-4","key":"849_CR22","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H Bunke","year":"1998","unstructured":"Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognit. Lett. 19(3-4), 255\u2013259 (1998)","journal-title":"Pattern Recognit. Lett."},{"issue":"9","key":"849_CR23","doi-asserted-by":"crossref","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai, H., Zheng, V.W., Chang, K.C.-C.: A comprehensive survey of graph embedding: Problems, techniques, and applications. IEEE Trans. Knowl. Data Eng. 30(9), 1616\u20131637 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"13","key":"849_CR24","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1093\/bioinformatics\/btn186","volume":"24","author":"Y Cao","year":"2008","unstructured":"Cao, Y., Jiang, T., Girke, T.: A maximum common substructure-based algorithm for searching and predicting drug-like compounds. Bioinformatics 24(13), 366\u2013374 (2008)","journal-title":"Bioinformatics"},{"key":"849_CR25","doi-asserted-by":"crossref","unstructured":"Chen, C., Yan, X., Zhu, F., Han, J., Yu, P.S.: Graph OLAP: Towards online analytical processing on graphs. In: ICDM, pp 103\u2013112 (2008)","DOI":"10.1109\/ICDM.2008.30"},{"key":"849_CR26","doi-asserted-by":"crossref","unstructured":"Chen, L., Liu, C., Liao, K., Li, J., Zhou, R.: Contextual community search over large social networks. In: ICDE, pp 88\u201399 (2019)","DOI":"10.1109\/ICDE.2019.00017"},{"key":"849_CR27","doi-asserted-by":"crossref","unstructured":"Chen, L., Liu, C., Yang, X., Wang, B., Li, J., Zhou, R.: Efficient batch processing for multiple keyword queries on graph data. In: CIKM, pp 1261\u20131270 (2016)","DOI":"10.1145\/2983323.2983806"},{"issue":"10","key":"849_CR28","first-page":"1233","volume":"11","author":"L Chen","year":"2018","unstructured":"Chen, L., Liu, C., Zhou, R., Li, J., Yang, X., Wang, B.: Maximum co-located community search in large scale social networks. PVLDB 11 (10), 1233\u20131246 (2018)","journal-title":"PVLDB"},{"key":"849_CR29","doi-asserted-by":"crossref","unstructured":"Chen, Q., Hu, Q., Huang, J.X., He, L., An, W.: Enhancing recurrent neural networks with positional attention for question answering. In: SIGIR, pp 993\u2013996 (2017)","DOI":"10.1145\/3077136.3080699"},{"key":"849_CR30","doi-asserted-by":"crossref","unstructured":"Chen, Y., Wang, W., Liu, Z.: Keyword-based search and exploration on databases. In: ICDE, pp 1380\u20131383 (2011)","DOI":"10.1109\/ICDE.2011.5767958"},{"issue":"2","key":"849_CR31","first-page":"25:1","volume":"5","author":"Y-C Chen","year":"2014","unstructured":"Chen, Y.-C., Zhu, W.-Y., Peng, W.-C., Lee, W.-C., Lee, S.-Y.: CIM: community-based influence maximization in social networks. ACM Trans. Intell. Syst. Technol. 5(2), 25:1\u201325:31 (2014)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"849_CR32","doi-asserted-by":"crossref","unstructured":"Cheng, J., Yu, J.X., Ding, B., Yu, P.S., Wang, H.: Fast graph pattern matching. In: ICDE, pp 913\u2013922 (2008)","DOI":"10.1109\/ICDE.2008.4497500"},{"key":"849_CR33","unstructured":"Cheng, J., Zeng, X., Yu, J.X.: Top-k graph pattern matching over large graphs. In: ICDE, pp 1033\u20131044 (2013)"},{"key":"849_CR34","unstructured":"Chondrogiannis, T., Bouros, P., Gamper, J., Leser, U.: Exact and approximate algorithms for finding k-shortest paths with limited overlap. In: EDBT, pp 414\u2013425 (2017)"},{"key":"849_CR35","doi-asserted-by":"crossref","unstructured":"Conte, A., Ferraro, G., Grossi, R., Marino, A., Sadakane, K., Uno, T.: Node similarity with q-grams for real-world labeled networks. In: KDD, pp 1282\u20131291 (2018)","DOI":"10.1145\/3219819.3220085"},{"key":"849_CR36","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: STOC, pp 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"issue":"10","key":"849_CR37","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"849_CR38","first-page":"565","volume":"10","author":"W Cui","year":"2017","unstructured":"Cui, W., Xiao, Y., Wang, H., Song, Y., Hwang, S.-W., Wang, W.: KBQA: Learning question answering over QA corpora and knowledge bases. PVLDB 10(5), 565\u2013576 (2017)","journal-title":"PVLDB"},{"key":"849_CR39","doi-asserted-by":"crossref","unstructured":"Dey, S.C., Cuevas-Vicentt\u00edn, V, K\u00f6hler, S, Gribkoff, E., Wang, M., Lud\u00e4scher, B: On implementing provenance-aware regular path queries with relational query engines. In: EDBT\/ICDT Workshops, pp 214\u2013223 (2013)","DOI":"10.1145\/2457317.2457353"},{"issue":"1","key":"849_CR40","first-page":"3.2:1","volume":"19","author":"J Dibbelt","year":"2014","unstructured":"Dibbelt, J., Pajor, T., Wagner, D.: User-constrained multimodal route planning. ACM J. Exp. Algorithmics 19(1), 3.2:1\u20133.2:19 (2014)","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"3","key":"849_CR41","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s10115-017-1100-y","volume":"55","author":"D Diefenbach","year":"2018","unstructured":"Diefenbach, D., L\u00f3pez, V, Singh, K.D., Maret, P.: Core techniques of question answering systems over knowledge bases: a survey. Knowl. Inf. Syst. 55(3), 529\u2013569 (2018)","journal-title":"Knowl. Inf. Syst."},{"key":"849_CR42","doi-asserted-by":"crossref","unstructured":"Ding, B., Wang, H., Jin, R., Han, J., Wang, Z.: Optimizing index for taxonomy keyword search. In: SIGMOD, pp 493\u2013504 (2012)","DOI":"10.1145\/2213836.2213892"},{"key":"849_CR43","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Wang, S., Qin, L., Zhang, X., Lin, X.: Finding top-k min-cost connected trees in databases. In: ICDE, pp 836\u2013845 (2007)","DOI":"10.1109\/ICDE.2007.367929"},{"key":"849_CR44","doi-asserted-by":"crossref","unstructured":"Dong, L., Wei, F., Zhou, M., Xu, K.: Question answering over freebase with multi-column convolutional neural networks. In: ACL-IJCNLP, pp 260\u2013269 (2015)","DOI":"10.3115\/v1\/P15-1026"},{"key":"849_CR45","doi-asserted-by":"crossref","unstructured":"Du, B., Zhang, S., Cao, N., Tong, H.: FIRST: Fast interactive attributed subgraph matching. In: KDD, pp 1447\u20131456 (2017)","DOI":"10.1145\/3097983.3098040"},{"key":"849_CR46","doi-asserted-by":"crossref","unstructured":"Dutta, S., Nayek, P., Bhattacharya, A.: Neighbor-aware search for approximate labeled graph matching using the chi-square statistics. In: WWW, pp 1281\u20131290 (2017)","DOI":"10.1145\/3038912.3052561"},{"key":"849_CR47","unstructured":"Fader, A., Soderland, S., Etzioni, O.: Identifying relations for open information extraction. In: EMNLP, pp 1535\u20131545 (2011)"},{"key":"849_CR48","doi-asserted-by":"crossref","unstructured":"Fan, J., Li, G., Zhou, L.: Interactive SQL query suggestion: Making databases user-friendly. In: ICDE, pp 351\u2013362 (2011)","DOI":"10.1109\/ICDE.2011.5767843"},{"key":"849_CR49","doi-asserted-by":"crossref","unstructured":"Fan, Q., Wang, Z., Chan, C.-Y., Tan, K.-L.: Towards neighborhood window analytics over large-scale graphs. In: DASFAA, pp 201\u2013217 (2016)","DOI":"10.1007\/978-3-319-32049-6_13"},{"key":"849_CR50","doi-asserted-by":"crossref","unstructured":"Fan, W.: Graph pattern matching revised for social network analysis. In: ICDT, pp 8\u201321 (2012)","DOI":"10.1145\/2274576.2274578"},{"key":"849_CR51","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y.: Adding regular expressions to graph reachability and pattern queries. In: ICDE, pp 39\u201350 (2011)","DOI":"10.1109\/ICDE.2011.5767858"},{"issue":"1","key":"849_CR52","first-page":"264","volume":"3","author":"W Fan","year":"2010","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: From intractable to polynomial time. PVLDB 3(1), 264\u2013275 (2010)","journal-title":"PVLDB"},{"issue":"1","key":"849_CR53","first-page":"1161","volume":"3","author":"W Fan","year":"2010","unstructured":"Fan, W., Li, J., Ma, S., Wang, H., Wu, Y.: Graph homomorphism revisited for graph matching. PVLDB 3(1), 1161\u20131172 (2010)","journal-title":"PVLDB"},{"issue":"11","key":"849_CR54","first-page":"1304","volume":"5","author":"W Fan","year":"2012","unstructured":"Fan, W., Wang, X., Wu, Y.: Performance guarantees for distributed reachability queries. PVLDB 5(11), 1304\u20131315 (2012)","journal-title":"PVLDB"},{"issue":"13","key":"849_CR55","first-page":"1510","volume":"6","author":"W Fan","year":"2013","unstructured":"Fan, W., Wang, X., Wu, Y.: Diversified top-k graph pattern matching. PVLDB 6(13), 1510\u20131521 (2013)","journal-title":"PVLDB"},{"issue":"3","key":"849_CR56","first-page":"241","volume":"5","author":"L Fang","year":"2011","unstructured":"Fang, L., Sarma, A.D., Yu, C., Bohannon, P.: REX: Explaining relationships between entity pairs. PVLDB 5(3), 241\u2013252 (2011)","journal-title":"PVLDB"},{"issue":"6","key":"849_CR57","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1007\/s00778-017-0482-5","volume":"26","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Chen, Y., Luo, S., Hu, J.: Effective and efficient attributed community search. VLDB J. 26(6), 803\u2013828 (2017)","journal-title":"VLDB J."},{"issue":"6","key":"849_CR58","first-page":"709","volume":"10","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Li, X., Luo, S., Hu, J.: Effective community search over large spatial graphs. PVLDB 10(6), 709\u2013720 (2017)","journal-title":"PVLDB"},{"issue":"12","key":"849_CR59","first-page":"1233","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J.: Effective community search for large attributed graphs. PVLDB 9(12), 1233\u20131244 (2016)","journal-title":"PVLDB"},{"issue":"1","key":"849_CR60","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00778-019-00556-x","volume":"29","author":"Y Fang","year":"2020","unstructured":"Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., Lin, X.: A survey of community search over big graphs. VLDB J. 29 (1), 353\u2013392 (2020)","journal-title":"VLDB J."},{"issue":"6","key":"849_CR61","first-page":"854","volume":"13","author":"Y Fang","year":"2020","unstructured":"Fang, Y., Yang, Y., Zhang, W., Lin, X., Cao, X.: Effective and efficient community search over large heterogeneous information networks. PVLDB 13(6), 854\u2013867 (2020)","journal-title":"PVLDB"},{"key":"849_CR62","doi-asserted-by":"crossref","unstructured":"Fang, Y., Lin, W., Zheng, V.W., Wu, M., Chang, K.C.-C., Li, X.: Semantic proximity search on graphs with metagraph-based learning. In: ICDE, pp 277\u2013288 (2016)","DOI":"10.1109\/ICDE.2016.7498247"},{"issue":"1","key":"849_CR63","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/2196-1115-1-1","volume":"1","author":"A Fard","year":"2014","unstructured":"Fard, A., Nisar, M.U., Miller, J.A., Ramaswamy, L.: Distributed and scalable graph pattern matching: models and algorithms. Int. J. Big Data 1(1), 1\u201314 (2014)","journal-title":"Int. J. Big Data"},{"key":"849_CR64","doi-asserted-by":"crossref","unstructured":"Fard, A., Nisar, M.U., Ramaswamy, L., Miller, J.A., Saltz, M.: A distributed vertex-centric approach for pattern matching in massive graphs. In: BigData, pp 403\u2013411 (2013)","DOI":"10.1109\/BigData.2013.6691601"},{"issue":"1","key":"849_CR65","doi-asserted-by":"crossref","first-page":"1450001","DOI":"10.1142\/S0218001414500013","volume":"28","author":"P Foggia","year":"2014","unstructured":"Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. Int. J. Pattern Recognit. Artif. Intell. 28(1), 1450001 (2014)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"849_CR66","doi-asserted-by":"crossref","unstructured":"Gallagher, B.: Matching structure and semantics: A survey on graph-based pattern matching. In: AAAI FS-06-02, pp 45\u201353 (2006)","DOI":"10.2172\/895418"},{"issue":"1","key":"849_CR67","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Anal. Appl. 13(1), 113\u2013129 (2010)","journal-title":"Pattern Anal. Appl."},{"key":"849_CR68","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","volume":"151","author":"P Goyal","year":"2018","unstructured":"Goyal, P., Ferrara, E.: Graph embedding techniques, applications, and performance: A survey. Knowl.-Based Syst. 151, 78\u201394 (2018)","journal-title":"Knowl.-Based Syst."},{"key":"849_CR69","doi-asserted-by":"crossref","unstructured":"Gu, Q., Zhang, C., Sun, T., Ji, Y., Hu, Z., Qiu, X.: Path sampling based relevance search in heterogeneous networks. In: BigCom, pp 453\u2013463 (2016)","DOI":"10.1007\/978-3-319-42553-5_39"},{"key":"849_CR70","doi-asserted-by":"crossref","unstructured":"Guo, L., Shao, F., Botev, C., Shanmugasundaram, J.: XRANK: Ranked keyword search over XML documents. In: SIGMOD, pp 16\u201327 (2003)","DOI":"10.1145\/872757.872762"},{"key":"849_CR71","doi-asserted-by":"crossref","unstructured":"Guo, L., Deng, Y., Liao, K., He, Q., Sellis, T., Hu, Z.: A fast algorithm for optimally finding partially disjoint shortest paths. In: IJCAI, pp 1456\u20131462 (2018)","DOI":"10.24963\/ijcai.2018\/202"},{"key":"849_CR72","doi-asserted-by":"crossref","unstructured":"Han, S., Zou, L., Yu, J.X., Zhao, D.: Keyword search on RDF graphs - A query graph assembly approach. In: CIKM, pp 227\u2013236 (2017)","DOI":"10.1145\/3132847.3132957"},{"key":"849_CR73","doi-asserted-by":"crossref","unstructured":"Han, W.-S., Lee, J., Lee, J.-H.: Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: SIGMOD, pp 337\u2013348 (2013)","DOI":"10.1145\/2463676.2465300"},{"issue":"10","key":"849_CR74","first-page":"778","volume":"21","author":"S Harris","year":"2013","unstructured":"Harris, S., Seaborne, A., Prud\u2019hommeaux, E.: Sparql 1.1 query language. W3C Recommendation 21(10), 778 (2013)","journal-title":"W3C Recommendation"},{"key":"849_CR75","doi-asserted-by":"crossref","unstructured":"Hassan, M.S., Aref, W.G., Aly, A.M.: Graph indexing for shortest-path finding over dynamic sub-graphs. In: SIGMOD, pp 1183\u20131197 (2016)","DOI":"10.1145\/2882903.2882933"},{"key":"849_CR76","doi-asserted-by":"crossref","unstructured":"He, H., Wang, H., Yang, J., Yu, P.S.: BLINKS: ranked keyword searches on graphs. In: SIGMOD, pp 305\u2013316 (2007)","DOI":"10.1145\/1247480.1247516"},{"key":"849_CR77","doi-asserted-by":"crossref","unstructured":"He, J., Bailey, J., Zhang, R.: Exploiting transitive similarity and temporal dynamics for similarity search in heterogeneous information networks. In: DASFAA, pp 141\u2013155 (2014)","DOI":"10.1007\/978-3-319-05813-9_10"},{"key":"849_CR78","doi-asserted-by":"crossref","unstructured":"He, S., Liu, K., Zhang, Y., Xu, L., Zhao, J.: Question answering over linked data using first-order logic. In: EMNLP, pp 1092\u20131103 (2014)","DOI":"10.3115\/v1\/D14-1116"},{"key":"849_CR79","unstructured":"Hellings, J.: Conjunctive context-free path queries. In: ICDT, pp 119\u2013130 (2014)"},{"key":"849_CR80","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: FOCS, pp 453\u2013462 (1995)"},{"issue":"6","key":"849_CR81","doi-asserted-by":"crossref","first-page":"895","DOI":"10.3233\/SW-160247","volume":"8","author":"K H\u00f6ffner","year":"2017","unstructured":"H\u00f6ffner, K., Walter, S., Marx, E., Usbeck, R., Lehmann, J., Ngomo, A.-C.N.: Survey on challenges of question answering in the semantic Web. Semantic Web 8(6), 895\u2013920 (2017)","journal-title":"Semantic Web"},{"issue":"3","key":"849_CR82","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519 (3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"key":"849_CR83","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Gravano, L., Papakonstantinou, Y.: Efficient IR-style keyword search over relational databases. In: VLDB, pp 850\u2013861 (2003)","DOI":"10.1016\/B978-012722442-8\/50080-X"},{"key":"849_CR84","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Papakonstantinou, Y.: DISCOVER: Keyword search in relational databases. In: VLDB, pp 670\u2013681 (2002)","DOI":"10.1016\/B978-155860869-6\/50065-2"},{"issue":"6","key":"849_CR85","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1089\/cmb.2005.12.657","volume":"12","author":"J Huan","year":"2005","unstructured":"Huan, J., Bandyopadhyay, D., Wang, W., Snoeyink, J., Prins, J., Tropsha, A.: Comparing graph representations of protein structure for mining family-specific residue-based packing motifs. J. Comput. Biol. 12(6), 657\u2013671 (2005)","journal-title":"J. Comput. Biol."},{"issue":"9","key":"849_CR86","first-page":"949","volume":"10","author":"X Huang","year":"2017","unstructured":"Huang, X., Lakshmanan, L.V.S.: Attribute-driven community search. PVLDB 10(9), 949\u2013960 (2017)","journal-title":"PVLDB"},{"key":"849_CR87","doi-asserted-by":"crossref","unstructured":"Huang, Z., Zheng, Y., Cheng, R., Sun, Y., Mamoulis, N., Li, X.: Meta structure: Computing relevance in large heterogeneous information networks. In: KDD, pp 1595\u20131604 (2016)","DOI":"10.1145\/2939672.2939815"},{"issue":"3","key":"849_CR88","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s00778-013-0322-1","volume":"23","author":"HH Hung","year":"2014","unstructured":"Hung, H.H., Bhowmick, S.S., Truong, B.Q., Choi, B., Zhou, S.: QUBLE: towards blending interactive visual subgraph search queries on large networks. VLDB J. 23(3), 401\u2013426 (2014)","journal-title":"VLDB J."},{"issue":"10","key":"849_CR89","doi-asserted-by":"crossref","first-page":"2672","DOI":"10.1109\/TKDE.2015.2432798","volume":"27","author":"MS Islam","year":"2015","unstructured":"Islam, M.S., Liu, C., Li, J.: Efficient answering of why-not questions in similar graph matching. IEEE Trans. Knowl. Data Eng. 27(10), 2672\u20132686 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"10","key":"849_CR90","doi-asserted-by":"crossref","first-page":"2797","DOI":"10.1109\/TKDE.2015.2426696","volume":"27","author":"N Jayaram","year":"2015","unstructured":"Jayaram, N., Khan, A., Li, C., Yan, X., Elmasri, R.: Querying knowledge graphs by example entity tuples. IEEE Trans. Knowl. Data Eng. 27(10), 2797\u20132811 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"849_CR91","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: SimRank: a measure of structural-context similarity. In: KDD, pp 538\u2013543 (2002)","DOI":"10.1145\/775047.775126"},{"key":"849_CR92","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized Web search. In: WWW, pp 271\u2013279 (2003)","DOI":"10.1145\/775152.775191"},{"key":"849_CR93","doi-asserted-by":"crossref","unstructured":"Jiang, M., Fu, A W-C, Wong, R C-W: Exact top-k nearest keyword search in large networks. In: SIGMOD, pp 393\u2013404 (2015)","DOI":"10.1145\/2723372.2749447"},{"key":"849_CR94","doi-asserted-by":"crossref","unstructured":"Jin, R., Hong, H., Wang, H., Ruan, N., Xiang, Y.: Computing label-constraint reachability in graph databases. In: SIGMOD, pp 123\u2013134 (2010)","DOI":"10.1145\/1807167.1807183"},{"key":"849_CR95","unstructured":"Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., Karambelkar, H.: Bidirectional expansion for keyword search on graph databases. In: VLDB, pp 505\u2013516 (2005)"},{"issue":"10","key":"849_CR96","first-page":"681","volume":"4","author":"M Kargar","year":"2011","unstructured":"Kargar, M., An, A.: Keyword search in graphs: Finding r-cliques. PVLDB 4(10), 681\u2013692 (2011)","journal-title":"PVLDB"},{"key":"849_CR97","doi-asserted-by":"crossref","unstructured":"Kargar, M., An, A.: Efficient top-k keyword search in graphs with polynomial delay. In: ICDE, pp 1269\u20131272 (2012)","DOI":"10.1109\/ICDE.2012.124"},{"issue":"2","key":"849_CR98","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10115-014-0736-0","volume":"43","author":"M Kargar","year":"2015","unstructured":"Kargar, M., An, A.: Finding top-k,r-cliques for keyword search from graphs in polynomial delay. Knowl. Inf. Syst. 43(2), 249\u2013280 (2015)","journal-title":"Knowl. Inf. Syst."},{"issue":"12","key":"849_CR99","first-page":"1566","volume":"8","author":"F Katsarou","year":"2015","unstructured":"Katsarou, F., Ntarmos, N., Triantafillou, P.: Performance and scalability of indexed subgraph query processing methods. PVLDB 8(12), 1566\u20131577 (2015)","journal-title":"PVLDB"},{"key":"849_CR100","doi-asserted-by":"crossref","unstructured":"Khan, A., Li, N., Yan, X., Guan, Z., Chakraborty, S., Tao, S.: Neighborhood based fast graph search in large networks. In: SIGMOD, pp 901\u2013912 (2011)","DOI":"10.1145\/1989323.1989418"},{"issue":"3","key":"849_CR101","first-page":"181","volume":"6","author":"A Khan","year":"2013","unstructured":"Khan, A., Wu, Y., Aggarwal, C.C., Yan, X.: NeMa: Fast graph search with label similarity. PVLDB 6(3), 181\u2013192 (2013)","journal-title":"PVLDB"},{"key":"849_CR102","doi-asserted-by":"crossref","unstructured":"Khashabi, D., Khot, T., Sabharwal, A., Roth, D.: Question answering as global reasoning over semantic abstractions. In: AAAI, pp 1905\u20131914 (2018)","DOI":"10.1609\/aaai.v32i1.11574"},{"key":"849_CR103","doi-asserted-by":"crossref","unstructured":"Koschmieder, A., Leser, U.: Regular path queries on large graphs. In: SSDBM, pp 177\u2013194 (2012)","DOI":"10.1007\/978-3-642-31235-9_12"},{"key":"849_CR104","doi-asserted-by":"crossref","unstructured":"Lao, N., Cohen, W.W.: Fast query execution for retrieval models based on path-constrained random walks. In: KDD, pp 881\u2013888 (2010)","DOI":"10.1145\/1835804.1835916"},{"issue":"1","key":"849_CR105","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10994-010-5205-8","volume":"81","author":"N Lao","year":"2010","unstructured":"Lao, N., Cohen, W.W.: Relational retrieval using a combination of path-constrained random walks. Mach. Learn. 81(1), 53\u201367 (2010)","journal-title":"Mach. Learn."},{"key":"849_CR106","doi-asserted-by":"crossref","unstructured":"Lappas, T., Liu, K., Terzi, E.: Finding a team of experts in social networks. In: KDD, pp 467\u2013476 (2009)","DOI":"10.1145\/1557019.1557074"},{"issue":"3","key":"849_CR107","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/3022860.3022863","volume":"45","author":"TN Le","year":"2016","unstructured":"Le, T.N., Ling, T.W.: Survey on keyword search over XML documents. SIGMOD Rec. 45(3), 17\u201328 (2016)","journal-title":"SIGMOD Rec."},{"issue":"11","key":"849_CR108","doi-asserted-by":"crossref","first-page":"2774","DOI":"10.1109\/TKDE.2014.2302294","volume":"26","author":"W Le","year":"2014","unstructured":"Le, W., Li, F., Kementsietsidis, A., Duan, S.: Scalable keyword search on large RDF data. IEEE Trans. Knowl. Data Eng. 26(11), 2774\u20132788 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"849_CR109","first-page":"133","volume":"6","author":"J Lee","year":"2012","unstructured":"Lee, J., Han, W.-S., Kasperovics, R., Lee, J.-H.: An in-depth comparison of subgraph isomorphism algorithms in graph databases. PVLDB 6(2), 133\u2013144 (2012)","journal-title":"PVLDB"},{"key":"849_CR110","doi-asserted-by":"crossref","unstructured":"Li, G., Ooi, B.C., Feng, J., Wang, J., Zhou, L.: EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data. In: SIGMOD, pp 903\u2013914 (2008)","DOI":"10.1145\/1376616.1376706"},{"key":"849_CR111","doi-asserted-by":"crossref","unstructured":"Li, J., Cao, Y., Ma, S.: Relaxing graph pattern matching with explanations. In: CIKM, pp 1677\u20131686 (2017)","DOI":"10.1145\/3132847.3132992"},{"key":"849_CR112","doi-asserted-by":"crossref","unstructured":"Li, J., Liu, C., Islam, M.S.: Keyword-based correlated network computation over large social media. In: ICDE, pp 268\u2013279 (2014)","DOI":"10.1109\/ICDE.2014.6816657"},{"key":"849_CR113","doi-asserted-by":"crossref","unstructured":"Li, J., Wang, X., Deng, K., Yang, X., Sellis, T., Yu, J.X.: Most influential community search over large social networks. In: ICDE, pp 871\u2013882 (2017)","DOI":"10.1109\/ICDE.2017.136"},{"key":"849_CR114","doi-asserted-by":"crossref","unstructured":"Li, R.-H., Qin, L., Ye, F., Yu, J.X., Xiao, X., Xiao, N., Zheng, Z.: Skyline community search in multi-valued networks. In: SIGMOD, pp 457\u2013472 (2018)","DOI":"10.1145\/3183713.3183736"},{"issue":"5","key":"849_CR115","first-page":"509","volume":"8","author":"R-H Li","year":"2015","unstructured":"Li, R.-H., Qin, L., Yu, J.X., Mao, R.: Influential community search in large networks. PVLDB 8(5), 509\u2013520 (2015)","journal-title":"PVLDB"},{"key":"849_CR116","doi-asserted-by":"crossref","unstructured":"Li, R.-H., Qin, L., Yu, J.X., Mao, R.: Efficient and progressive group steiner tree search. In: SIGMOD, pp 91\u2013106 (2016)","DOI":"10.1145\/2882903.2915217"},{"key":"849_CR117","doi-asserted-by":"crossref","unstructured":"Li, R.-H., Su, J., Qin, L., Yu, J.X., Dai, Q.: Persistent community search in temporal networks. In: ICDE, pp 797\u2013808 (2018)","DOI":"10.1109\/ICDE.2018.00077"},{"key":"849_CR118","doi-asserted-by":"crossref","unstructured":"Liang, J., Ajwani, D., Nicholson, P.K., Sala, A., Parthasarathy, S.: What links alice and bob?: Matching and ranking semantic patterns in heterogeneous networks. In: WWW, pp 879\u2013889 (2016)","DOI":"10.1145\/2872427.2883007"},{"key":"849_CR119","doi-asserted-by":"crossref","unstructured":"Liptchinsky, V., Satzger, B., Zabolotnyi, R., Dustdar, S.: Expressive languages for selecting groups from graph-structured data. In: WWW, pp 761\u2013770 (2013)","DOI":"10.1145\/2488388.2488455"},{"key":"849_CR120","doi-asserted-by":"crossref","unstructured":"Liu, C., Chen, C., Han, J., Yu, P.S.: GPLAG: detection of software plagiarism by program dependence graph analysis. In: KDD, pp 872\u2013881 (2006)","DOI":"10.1145\/1150402.1150522"},{"key":"849_CR121","doi-asserted-by":"crossref","unstructured":"Liu, F., Yu, C.T., Meng, W., Chowdhury, A.: Effective keyword search in relational databases. In: SIGMOD, pp 563\u2013574 (2006)","DOI":"10.1145\/1142473.1142536"},{"key":"849_CR122","doi-asserted-by":"crossref","unstructured":"Liu, G., Zheng, K., Wang, Y., Orgun, M.A., Liu, A., Zhao, L., Zhou, X.: Multi-constrained graph pattern matching in large-scale contextual social graphs. In: ICDE, pp 351\u2013362 (2015)","DOI":"10.1109\/ICDE.2015.7113297"},{"key":"849_CR123","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhao, M., Huang, X., Xu, J., Gao, Y.: Truss-based community search over large directed graphs. In: SIGMOD, pp 2183\u20132197 (2020)","DOI":"10.1145\/3318464.3380587"},{"key":"849_CR124","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhu, Y., Zhao, M., Huang, X., Xu, J., Gao, Y.: VAC: vertex-centric attributed community search. In: ICDE, pp 937\u2013948 (2020)","DOI":"10.1109\/ICDE48307.2020.00086"},{"issue":"3","key":"849_CR125","first-page":"62:1","volume":"51","author":"Y Liu","year":"2018","unstructured":"Liu, Y., Safavi, T., Dighe, A., Koutra, D.: Graph summarization methods and applications: A survey. ACM Comput. Surv. 51(3), 62:1\u201362:34 (2018)","journal-title":"ACM Comput. Surv."},{"key":"849_CR126","doi-asserted-by":"crossref","unstructured":"Liu, Z., Zheng, V.W., Zhao, Z., Li, Z., Yang, H., Wu, M., Ying, J.: Interactive paths embedding for semantic proximity search on heterogeneous graphs. In: KDD, pp 1860\u20131869 (2018)","DOI":"10.1145\/3219819.3219953"},{"key":"849_CR127","doi-asserted-by":"crossref","unstructured":"Liu, Z., Zheng, V.W., Zhao, Z., Yang, H., Chang, K.C.-C., Wu, M., Ying, J.: Subgraph-augmented path embedding for semantic user search on heterogeneous social network. In: WWW, pp 1613\u20131622 (2018)","DOI":"10.1145\/3178876.3186073"},{"key":"849_CR128","doi-asserted-by":"crossref","unstructured":"Liu, Z., Zheng, V.W., Zhao, Z., Zhu, F., Chang, K.C.-C., Wu, M., Ying, J.: Semantic proximity search on heterogeneous graph by proximity embedding. In: AAAI, pp 154\u2013160 (2017)","DOI":"10.1609\/aaai.v31i1.10486"},{"key":"849_CR129","doi-asserted-by":"crossref","unstructured":"Liu, Z., Zheng, V.W., Zhao, Z., Zhu, F., Chang, K.C.-C., Wu, M., Ying, J.: Distance-aware dag embedding for proximity search on heterogeneous graphs. In: AAAI, pp 2355\u20132362 (2018)","DOI":"10.1145\/3219819.3219953"},{"issue":"3","key":"849_CR130","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10044-012-0284-8","volume":"16","author":"L Livi","year":"2013","unstructured":"Livi, L., Rizzi, A.: The graph matching problem. Pattern Anal. Appl. 16(3), 253\u2013283 (2013)","journal-title":"Pattern Anal. Appl."},{"issue":"3","key":"849_CR131","doi-asserted-by":"crossref","first-page":"249","DOI":"10.3233\/SW-2011-0030","volume":"3","author":"V L\u00f3pez","year":"2012","unstructured":"L\u00f3pez, V, Fern\u00e1ndez, M, Motta, E., Stieler, N.: PowerAqua: Supporting users in querying and exploring the semantic Web. Semantic Web 3(3), 249\u2013265 (2012)","journal-title":"Semantic Web"},{"key":"849_CR132","doi-asserted-by":"crossref","unstructured":"Lukovnikov, D., Fischer, A., Lehmann, J., Auer, S.: Neural network-based question answering over knowledge graphs on word and character level. In: WWW, pp 1211\u20131220 (2017)","DOI":"10.1145\/3038912.3052675"},{"key":"849_CR133","doi-asserted-by":"crossref","unstructured":"Luo, Y., Lin, X., Wang, W., Zhou, X.: Spark: top-k keyword query in relational databases. In: SIGMOD, pp 115\u2013126 (2007)","DOI":"10.1145\/1247480.1247495"},{"issue":"12","key":"849_CR134","doi-asserted-by":"crossref","first-page":"1763","DOI":"10.1109\/TKDE.2011.60","volume":"23","author":"Y Luo","year":"2011","unstructured":"Luo, Y., Wang, W., Lin, X., Zhou, X., Wang, J., Li, K.: SPARK2: Top-k keyword query in relational databases. IEEE Trans. Knowl. Data Eng. 23(12), 1763\u20131780 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"849_CR135","doi-asserted-by":"crossref","unstructured":"Lyu, B., Qin, L., Lin, X., Chang, L., Yu, J.X.: Scalable supergraph search in large graph databases. In: ICDE, pp 157\u2013168 (2016)","DOI":"10.1109\/ICDE.2016.7498237"},{"issue":"4","key":"849_CR136","first-page":"310","volume":"5","author":"S Ma","year":"2011","unstructured":"Ma, S., Cao, Y., Fan, W., Huai, J., Wo, T.: Capturing topology in graph pattern matching. PVLDB 5(4), 310\u2013321 (2011)","journal-title":"PVLDB"},{"key":"849_CR137","doi-asserted-by":"crossref","first-page":"66621","DOI":"10.1109\/ACCESS.2018.2875262","volume":"6","author":"T Ma","year":"2018","unstructured":"Ma, T., Yu, S., Cao, J., Tian, Y., Al-Dhelaan, A., Al-Rodhaan, M.: A comparative study of subgraph matching isomorphic methods in social networks. IEEE Access 6, 66621\u201366631 (2018)","journal-title":"IEEE Access"},{"key":"849_CR138","doi-asserted-by":"crossref","unstructured":"Medeiros, C.M., Musicante, M.A., da Costa, U.S.: Efficient evaluation of context-free path queries for graph databases. In: SAC, pp 1230\u20131237 (2018)","DOI":"10.1145\/3167132.3167265"},{"issue":"6","key":"849_CR139","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1137\/S009753979122370X","volume":"24","author":"AO Mendelzon","year":"1995","unstructured":"Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. SIAM J. Comput. 24(6), 1235\u20131258 (1995)","journal-title":"SIAM J. Comput."},{"key":"849_CR140","doi-asserted-by":"crossref","unstructured":"Meng, C., Cheng, R., Maniu, S., Senellart, P., Zhang, W.: Discovering meta-paths in large heterogeneous information networks. In: WWW, pp 754\u2013764 (2015)","DOI":"10.1145\/2736277.2741123"},{"key":"849_CR141","doi-asserted-by":"crossref","unstructured":"Meng, X., Shi, C., Li, Y., Zhang, L., Wu, B.: Relevance measure in large-scale heterogeneous networks. In: APWeb, pp 636\u2013643 (2014)","DOI":"10.1007\/978-3-319-11116-2_61"},{"key":"849_CR142","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.knosys.2018.03.008","volume":"150","author":"Z Meng","year":"2018","unstructured":"Meng, Z., Shen, H.: Dissimilarity-constrained node attribute coverage diversification for novelty-enhanced top-k search in large attributed networks. Knowl.-Based Syst. 150, 85\u201394 (2018)","journal-title":"Knowl.-Based Syst."},{"key":"849_CR143","doi-asserted-by":"crossref","unstructured":"Mondal, J., Deshpande, A.: EAGr: supporting continuous ego-centric aggregate queries over large dynamic graphs. In: SIGMOD, pp 1335\u20131346 (2014)","DOI":"10.1145\/2588555.2612182"},{"issue":"5","key":"849_CR144","first-page":"365","volume":"7","author":"D Mottin","year":"2014","unstructured":"Mottin, D., Lissandrini, M., Velegrakis, Y., Palpanas, T.: Exemplar queries: Give me an example of what you need. PVLDB 7(5), 365\u2013376 (2014)","journal-title":"PVLDB"},{"key":"849_CR145","unstructured":"Nakashole, N., Weikum, G., Suchanek, F.M.: PATTY: A taxonomy of relational patterns with semantic types. In: EMNLP-CoNLL, pp 1135\u20131145 (2012)"},{"key":"849_CR146","doi-asserted-by":"crossref","unstructured":"Namaki, M.H., Wu, Y., Zhang, X.: GExp: Cost-aware graph exploration with keywords. In: SIGMOD, pp 1729\u20131732 (2018)","DOI":"10.1145\/3183713.3193550"},{"key":"849_CR147","doi-asserted-by":"crossref","unstructured":"Napolitano, G., Usbeck, R., Ngomo, A-C N: The scalable question answering over linked data (SQA) challenge 2018. In: SemWebEval, pp 69\u201375 (2018)","DOI":"10.1007\/978-3-030-00072-1_6"},{"key":"849_CR148","doi-asserted-by":"crossref","unstructured":"Nol\u00e9, M, Sartiani, C.: Regular path queries on massive graphs. In: SSDBM, pp 13:1\u201313:12 (2016)","DOI":"10.1145\/2949689.2949711"},{"key":"849_CR149","doi-asserted-by":"crossref","unstructured":"Pacaci, A., Bonifati, A., \u00d6zsu, M T: Regular path query evaluation on streaming graphs. In: SIGMOD, pp 1415\u20131430 (2020)","DOI":"10.1145\/3318464.3389733"},{"issue":"11","key":"849_CR150","first-page":"1382","volume":"10","author":"S Pande","year":"2017","unstructured":"Pande, S., Ranu, S., Bhattacharya, A.: SkyGraph: Retrieving regions of interest using skyline subgraph queries. PVLDB 10(11), 1382\u20131393 (2017)","journal-title":"PVLDB"},{"issue":"6","key":"849_CR151","first-page":"812","volume":"13","author":"Y Peng","year":"2020","unstructured":"Peng, Y., Zhang, Y., Lin, X., Qin, L., Zhang, W.: Answering billion-scale label-constrained reachability queries within microsecond. PVLDB 13(6), 812\u2013825 (2020)","journal-title":"PVLDB"},{"issue":"10","key":"849_CR152","first-page":"901","volume":"6","author":"M Qiao","year":"2013","unstructured":"Qiao, M., Qin, L., Cheng, H., Yu, J.X., Tian, W.: Top-k nearest keyword search on large graphs. PVLDB 6(10), 901\u2013912 (2013)","journal-title":"PVLDB"},{"issue":"11","key":"849_CR153","first-page":"1124","volume":"5","author":"L Qin","year":"2012","unstructured":"Qin, L., Yu, J.X., Chang, L.: Diversifying top-k results. PVLDB 5(11), 1124\u20131135 (2012)","journal-title":"PVLDB"},{"key":"849_CR154","doi-asserted-by":"crossref","unstructured":"Qu, Q., Zhu, F., Yan, X., Han, J., Yu, P.S., Li, H.: Efficient topological OLAP on information networks. In: DASFAA, pp 389\u2013403 (2011)","DOI":"10.1007\/978-3-642-20149-3_29"},{"key":"849_CR155","doi-asserted-by":"crossref","unstructured":"Ranu, S., Hoang, M.X., Singh, A.K.: Answering top-k representative queries on graph databases. In: SIGMOD, pp 1163\u20131174 (2014)","DOI":"10.1145\/2630602.2630609"},{"issue":"5","key":"849_CR156","first-page":"617","volume":"8","author":"X Ren","year":"2015","unstructured":"Ren, X., Wang, J.: Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs. PVLDB 8(5), 617\u2013628 (2015)","journal-title":"PVLDB"},{"issue":"2","key":"849_CR157","first-page":"69","volume":"4","author":"MN Rice","year":"2010","unstructured":"Rice, M.N., Tsotras, V.J.: Graph indexing of road networks for shortest path queries with label restrictions. PVLDB 4(2), 69\u201380 (2010)","journal-title":"PVLDB"},{"key":"849_CR158","doi-asserted-by":"crossref","unstructured":"Savenkov, D., Agichtein, E.: When a knowledge base is not enough: Question answering over knowledge bases with external text data. In: SIGIR, pp 235\u2013244 (2016)","DOI":"10.1145\/2911451.2911536"},{"issue":"Part 2","key":"849_CR159","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.is.2017.11.003","volume":"74","author":"J Schoenfisch","year":"2018","unstructured":"Schoenfisch, J., Meilicke, C., von St\u00fclpnagel, J, Ortmann, J., Stuckenschmidt, H.: Root cause analysis in it infrastructures using ontologies and abduction in markov logic networks. Inf. Syst. 74(Part 2), 103\u2013116 (2018)","journal-title":"Inf. Syst."},{"issue":"1","key":"849_CR160","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/TKDE.2018.2823754","volume":"31","author":"K Semertzidis","year":"2019","unstructured":"Semertzidis, K., Pitoura, E.: Top-k durable graph pattern queries on temporal graphs. IEEE Trans. Knowl. Data Eng. 31(1), 181\u2013194 (2019)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"849_CR161","doi-asserted-by":"crossref","unstructured":"Shang, H., Lin, X., Zhang, Y., Yu, J.X., Wang, W.: Connected substructure similarity search. In: SIGMOD, pp 903\u2013914 (2010)","DOI":"10.1145\/1807167.1807264"},{"issue":"1","key":"849_CR162","first-page":"364","volume":"1","author":"H Shang","year":"2008","unstructured":"Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB 1(1), 364\u2013375 (2008)","journal-title":"PVLDB"},{"key":"849_CR163","doi-asserted-by":"crossref","unstructured":"Shang, H., Zhu, K., Lin, X., Zhang, Y., Ichise, R.: Similarity search on supergraph containment. In: ICDE, pp 637\u2013648 (2010)","DOI":"10.1109\/ICDE.2010.5447846"},{"issue":"10","key":"849_CR164","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1109\/TKDE.2013.2297920","volume":"26","author":"C Shi","year":"2014","unstructured":"Shi, C., Kong, X., Huang, Y., Yu, P.S., Wu, B.: HeteSim: A general framework for relevance measure in heterogeneous networks. IEEE Trans. Knowl. Data Eng. 26(10), 2479\u20132492 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"849_CR165","doi-asserted-by":"crossref","unstructured":"Shi, C., Kong, X., Yu, P.S., Xie, S., Wu, B.: Relevance search in heterogeneous networks. In: EDBT, pp 180\u2013191 (2012)","DOI":"10.1145\/2247596.2247618"},{"issue":"1","key":"849_CR166","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/TKDE.2016.2598561","volume":"29","author":"C Shi","year":"2017","unstructured":"Shi, C., Li, Y., Zhang, J., Sun, Y., Yu, P.S.: A survey of heterogeneous information network analysis. IEEE Trans. Knowl. Data Eng. 29(1), 17\u201337 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"849_CR167","doi-asserted-by":"crossref","unstructured":"Shi, Y., Chan, P.-W., Zhuang, H., Gui, H., Han, J.: PReP: Path-based relevance from a probabilistic perspective in heterogeneous information networks. In: KDD, pp 425\u2013434 (2017)","DOI":"10.1145\/3097983.3097990"},{"key":"849_CR168","doi-asserted-by":"crossref","unstructured":"Shi, Y., Cheng, G., Kharlamov, E.: Keyword search over knowledge graphs via static and dynamic hub labelings. In: WWW, pp 235\u2013245 (2020)","DOI":"10.1145\/3366423.3380110"},{"issue":"3","key":"849_CR169","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s41019-019-00099-9","volume":"4","author":"A Shikha","year":"2019","unstructured":"Shikha, A., Junhu, W., Md. Saiful Islam: Modular Decomposition-Based Graph Compression for Fast Reachability Detection. Data Sci. Eng. 4(3), 193\u2013207 (2019)","journal-title":"Data Sci. Eng."},{"issue":"4","key":"849_CR170","doi-asserted-by":"crossref","first-page":"45:1","DOI":"10.1145\/2530531","volume":"46","author":"C Sommer","year":"2014","unstructured":"Sommer, C.: Shortest-path queries in static networks. ACM Comput. Surv. 46(4), 45:1\u201345:31 (2014)","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"849_CR171","first-page":"413","volume":"8","author":"C Song","year":"2014","unstructured":"Song, C., Ge, T., Chen, C.X., Wang, J.: Event pattern matching over graph streams. PVLDB 8(4), 413\u2013424 (2014)","journal-title":"PVLDB"},{"key":"849_CR172","doi-asserted-by":"crossref","unstructured":"Suchanek, F.M., Kasneci, G., Weikum, G.: Yago: a core of semantic knowledge. In: WWW, pp 697\u2013706 (2007)","DOI":"10.1145\/1242572.1242667"},{"issue":"11","key":"849_CR173","first-page":"992","volume":"4","author":"Y Sun","year":"2011","unstructured":"Sun, Y., Han, J., Yan, X., Yu, P.S., Wu, T.: PathSim: Meta path-based top-k similarity search in heterogeneous information networks. PVLDB 4(11), 992\u20131003 (2011)","journal-title":"PVLDB"},{"issue":"9","key":"849_CR174","first-page":"788","volume":"5","author":"Z Sun","year":"2012","unstructured":"Sun, Z., Wang, H., Wang, H., Shao, B., Li, J.: Efficient subgraph matching on billion node graphs. PVLDB 5(9), 788\u2013799 (2012)","journal-title":"PVLDB"},{"key":"849_CR175","doi-asserted-by":"crossref","unstructured":"Tabei, Y., Tsuda, K.: Kernel-based similarity search in massive graph databases with wavelet trees. In: SDM, pp 154\u2013163 (2011)","DOI":"10.1137\/1.9781611972818.14"},{"issue":"2","key":"849_CR176","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1093\/bioinformatics\/btl571","volume":"23","author":"Y Tian","year":"2007","unstructured":"Tian, Y., McEachin, R.C., Santos, C., States, D.J., Patel, J.M.: SAGA: a subgraph matching tool for biological graphs. Bioinformatics 23(2), 232\u2013239 (2007)","journal-title":"Bioinformatics"},{"key":"849_CR177","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Gallagher, B., Eliassi-Rad, T.: Fast best-effort pattern matching in large attributed graphs. In: KDD, pp 737\u2013746 (2007)","DOI":"10.1145\/1281192.1281271"},{"key":"849_CR178","doi-asserted-by":"crossref","unstructured":"Tran, Q.T., Chan, C.-Y.: How to conquer why-not questions. In: SIGMOD, pp 15\u201326 (2010)","DOI":"10.1145\/1807167.1807172"},{"key":"849_CR179","doi-asserted-by":"crossref","unstructured":"Tran, T., Wang, H., Rudolph, S., Cimiano, P.: Top-k exploration of query candidates for efficient keyword search on graph-shaped (RDF) data. In: ICDE, pp 405\u2013416 (2009)","DOI":"10.1109\/ICDE.2009.119"},{"key":"849_CR180","doi-asserted-by":"crossref","unstructured":"U, L.H., Yao, K., Mak, H.F.: PathSimExt: Revisiting pathsim in heterogeneous information networks. In: WAIM, pp 38\u201342 (2014)","DOI":"10.1007\/978-3-319-08010-9_6"},{"issue":"1","key":"849_CR181","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"849_CR182","doi-asserted-by":"crossref","unstructured":"Unger, C., B\u00fchmann, L, Lehmann, J., Ngomo, A.-C.N., Gerber, D., Cimiano, P.: Template-based question answering over RDF data. In: WWW, pp 639\u2013648 (2012)","DOI":"10.1145\/2187836.2187923"},{"key":"849_CR183","doi-asserted-by":"crossref","unstructured":"Unger, C., Cimiano, P.: Pythia: Compositional meaning construction for ontology-based question answering on the semantic Web. In: NLDB, pp 153\u2013160 (2011)","DOI":"10.1007\/978-3-642-22327-3_15"},{"issue":"2","key":"849_CR184","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s41019-019-0092-x","volume":"4","author":"S Vachik","year":"2019","unstructured":"Vachik, S., Dave, B. Z., Pin-Yu, C., Mohammad Al, H.: Neural-Brane: Neural Bayesian Personalized Ranking for Attributed Network Embedding. Data Sci. Eng. 4(2), 119\u2013131 (2019)","journal-title":"Data Sci. Eng."},{"key":"849_CR185","doi-asserted-by":"crossref","unstructured":"Valstar, L.D.J., Fletcher, G.H.L., Yoshida, Y.: Landmark indexing for evaluation of label-constrained reachability queries. In: SIGMOD, pp 345\u2013358 (2017)","DOI":"10.1145\/3035918.3035955"},{"key":"849_CR186","doi-asserted-by":"crossref","unstructured":"Wadhwa, S., Prasad, A., Ranu, S., Bagchi, A., Bedathur, S.: Efficiently answering regular simple path queries on large labeled networks. In: SIGMOD, pp 1463\u20131480 (2019)","DOI":"10.1145\/3299869.3319882"},{"key":"849_CR187","doi-asserted-by":"crossref","unstructured":"Wang, C., Song, Y., Li, H., Sun, Y., Zhang, M., Han, J.: Distant meta-path similarities for text-based heterogeneous information networks. In: CIKM, pp 1629\u20131638 (2017)","DOI":"10.1145\/3132847.3133029"},{"key":"849_CR188","doi-asserted-by":"crossref","unstructured":"Wang, C., Sun, Y., Song, Y., Han, J., Song, Y., Wang, L., Zhang, M.: RelSim: Relation similarity search in schema-rich heterogeneous information networks. In: SDM, pp 621\u2013629 (2016)","DOI":"10.1137\/1.9781611974348.70"},{"key":"849_CR189","doi-asserted-by":"crossref","unstructured":"Wang, H., Aggarwal, C.C.: A survey of algorithms for keyword search on graph data. In: Managing and Mining Graph Data, pp 249\u2013273, Springer (2010)","DOI":"10.1007\/978-1-4419-6045-0_8"},{"issue":"12","key":"849_CR190","doi-asserted-by":"crossref","first-page":"2724","DOI":"10.1109\/TKDE.2017.2754499","volume":"29","author":"Q Wang","year":"2017","unstructured":"Wang, Q., Mao, Z., Wang, B., Guo, L.: Knowledge graph embedding: A survey of approaches and applications. IEEE Trans. Knowl. Data Eng. 29(12), 2724\u20132743 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"849_CR191","doi-asserted-by":"crossref","unstructured":"Wang, X., Smalter, A.M., Huan, J., Lushington, G.H.: G-hash: towards fast kernel-based similarity search in large graph databases. In: EDBT, pp 472\u2013480 (2009)","DOI":"10.1145\/1516360.1516416"},{"issue":"3","key":"849_CR192","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1007\/s11280-019-00739-0","volume":"23","author":"X Wang","year":"2020","unstructured":"Wang, X., Wang, S., Xin, Y., Yang, Y., Li, J., Wang, X.: Distributed pregel-based provenance-aware regular path query processing on RDF knowledge graphs. World Wide Web 23(3), 1465\u20131496 (2020)","journal-title":"World Wide Web"},{"key":"849_CR193","doi-asserted-by":"crossref","unstructured":"Wang, Z., Fan, Q., Wang, H., Tan, K-L, Agrawal, D., Abbadi, A.E.: Pagrol: Parallel graph OLAP over large-scale attributed graphs. In: ICDE, pp 496\u2013507 (2014)","DOI":"10.1109\/ICDE.2014.6816676"},{"key":"849_CR194","doi-asserted-by":"crossref","unstructured":"Wang, Z., Wang, W., Wang, C., Gu, X., Li, B., Meng, D.: Community focusing: Yet another query-dependent community detection. In: AAAI, pp 329\u2013337 (2019)","DOI":"10.1609\/aaai.v33i01.3301329"},{"issue":"1","key":"849_CR195","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/2206869.2206879","volume":"41","author":"PT Wood","year":"2012","unstructured":"Wood, P.T.: Query languages for graph databases. SIGMOD Rec. 41(1), 50\u201360 (2012)","journal-title":"SIGMOD Rec."},{"issue":"14","key":"849_CR196","first-page":"1774","volume":"6","author":"Y Wu","year":"2013","unstructured":"Wu, Y., Yang, S., Srivatsa, M., Iyengar, A., Yan, X.: Summarizing answer graphs induced by keyword queries. PVLDB 6(14), 1774\u20131785 (2013)","journal-title":"PVLDB"},{"key":"849_CR197","unstructured":"Wu, Y., Yang, S., Yan, X.: Ontology-based subgraph querying. In: ICDE, pp 697\u2013708 (2013)"},{"issue":"7","key":"849_CR198","first-page":"798","volume":"8","author":"Y Wu","year":"2015","unstructured":"Wu, Y., Jin, R., Li, J., Zhang, X.: Robust local community detection: On free rider effect and its elimination. PVLDB 8(7), 798\u2013809 (2015)","journal-title":"PVLDB"},{"key":"849_CR199","doi-asserted-by":"crossref","unstructured":"Xin, Y., Wang, X., Jin, D., Wang, S.: Distributed efficient provenance-aware regular path queries on large RDF graphs. In: DASFAA, pp 766\u2013782 (2018)","DOI":"10.1007\/978-3-319-91452-7_49"},{"issue":"1","key":"849_CR200","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/s41019-019-0090-z","volume":"4","author":"W Xin","year":"2019","unstructured":"Xin, W., Lele, C., Qiang, X., Yajun, Y., Jianxin, L., Junhu, W., Yunpeng, C.: Efficient Subgraph Matching on Large RDF Graphs Using MapReduce. Data Sci. Eng. 4(1), 24\u201343 (2019)","journal-title":"Data Sci. Eng."},{"key":"849_CR201","doi-asserted-by":"crossref","unstructured":"Xu, Y., Papakonstantinou, Y.: Efficient keyword search for smallest LCAs in XML databases. In: SIGMOD, pp 537\u2013538 (2005)","DOI":"10.1145\/1066157.1066217"},{"key":"849_CR202","doi-asserted-by":"crossref","unstructured":"Yan, J., Yin, X.-C., Lin, W., Deng, C., Zha, H., Yang, X.: A short survey of recent advances in graph matching. In: ICMR, pp 167\u2013174 (2016)","DOI":"10.1145\/2911996.2912035"},{"key":"849_CR203","doi-asserted-by":"crossref","unstructured":"Yan, X., He, B., Zhu, F., Han, J.: Top-k aggregation queries over large networks. In: ICDE, pp 377\u2013380 (2010)","DOI":"10.1109\/ICDE.2010.5447863"},{"key":"849_CR204","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: A frequent structure-based approach. In: SIGMOD, pp 335\u2013346 (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"849_CR205","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. In: SIGMOD, pp 766\u2013777 (2005)","DOI":"10.1145\/1066157.1066244"},{"key":"849_CR206","doi-asserted-by":"crossref","unstructured":"Yang, M.-C., Duan, N., Zhou, M., Rim, H.-C.: Joint relational embeddings for knowledge-based question answering. In: EMNLP, pp 645\u2013650 (2014)","DOI":"10.3115\/v1\/D14-1071"},{"issue":"14","key":"849_CR207","first-page":"1809","volume":"7","author":"M Yang","year":"2014","unstructured":"Yang, M., Ding, B., Chaudhuri, S., Chakrabarti, K.: Finding patterns in a knowledge base using keywords to compose table answers. PVLDB 7 (14), 1809\u20131820 (2014)","journal-title":"PVLDB"},{"key":"849_CR208","doi-asserted-by":"crossref","unstructured":"Yang, S., Han, F., Wu, Y., Yan, X.: Fast top-k search in knowledge graphs. In: ICDE, pp 990\u20131001 (2016)","DOI":"10.1109\/ICDE.2016.7498307"},{"key":"849_CR209","doi-asserted-by":"crossref","unstructured":"Yang, Y., Agrawal, D., Jagadish, H.V., Tung, A.K.H., Wu, S.: An efficient parallel keyword search engine on knowledge graphs. In: ICDE, pp 338\u2013349 (2019)","DOI":"10.1109\/ICDE.2019.00038"},{"key":"849_CR210","doi-asserted-by":"crossref","unstructured":"Yang, Z., Fu, A.W.-C., Liu, R.: Diversified top-k subgraph querying in a large graph. In: SIGMOD, pp 1167\u20131182 (2016)","DOI":"10.1145\/2882903.2915216"},{"key":"849_CR211","doi-asserted-by":"crossref","unstructured":"Yao, X., Durme, B.V.: Information extraction over structured data: Question answering with freebase. In: ACL, pp 956\u2013966 (2014)","DOI":"10.3115\/v1\/P14-1090"},{"key":"849_CR212","doi-asserted-by":"crossref","unstructured":"Yih, W.-T., He, X., Meek, C.: Semantic parsing for single-relation question answering. In: ACL, pp 643\u2013648 (2014)","DOI":"10.3115\/v1\/P14-2105"},{"key":"849_CR213","doi-asserted-by":"crossref","unstructured":"Yih, W-T, Ma, H.: Question answering with knowledge base, Web and beyond. In: NAACL-HLT, pp 8\u201310 (2016)","DOI":"10.1145\/2911451.2914804"},{"key":"849_CR214","doi-asserted-by":"crossref","unstructured":"Yin, M., Wu, B., Zeng, Z.: HMGraph OLAP: a novel framework for multi-dimensional heterogeneous network analysis. In: DOLAP, pp 137\u2013144 (2012)","DOI":"10.1145\/2390045.2390067"},{"key":"849_CR215","doi-asserted-by":"crossref","unstructured":"Yu, J.X., Cheng, J.: Graph reachability queries: A survey. In: Managing and Mining Graph Data, pp 181\u2013215, Springer (2010)","DOI":"10.1007\/978-1-4419-6045-0_6"},{"issue":"1","key":"849_CR216","first-page":"67","volume":"33","author":"JX Yu","year":"2010","unstructured":"Yu, J.X., Qin, L., Chang, L.: Keyword search in relational databases: A survey. IEEE Data Eng. Bull. 33(1), 67\u201378 (2010)","journal-title":"IEEE Data Eng. Bull."},{"key":"849_CR217","doi-asserted-by":"crossref","unstructured":"Yu, X., Sun, Y., Norick, B., Mao, T., Han, J.: User guided entity similarity search using meta-path selection in heterogeneous information networks. In: CIKM, pp 2025\u20132029 (2012)","DOI":"10.1145\/2396761.2398565"},{"issue":"6","key":"849_CR218","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1109\/TKDE.2017.2656079","volume":"29","author":"Y Yuan","year":"2017","unstructured":"Yuan, Y., Lian, X., Chen, L., Yu, J.X., Wang, G., Sun, Y.: Keyword search over distributed graphs with compressed signature. IEEE Trans. Knowl. Data Eng. 29(6), 1212\u20131225 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"12","key":"849_CR219","doi-asserted-by":"crossref","first-page":"2767","DOI":"10.1109\/TKDE.2012.222","volume":"25","author":"Y Yuan","year":"2013","unstructured":"Yuan, Y., Wang, G., Chen, L., Wang, H.: Efficient keyword search on uncertain graph data. IEEE Trans. Knowl. Data Eng. 25(12), 2767\u20132779 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"849_CR220","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"},{"issue":"1","key":"849_CR221","first-page":"25","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng, Z., Tung, A.K.H., Wang, J., Feng, J., Zhou, L.: Comparing stars: On approximating graph edit distance. PVLDB 2(1), 25\u201336 (2009)","journal-title":"PVLDB"},{"issue":"2","key":"849_CR222","doi-asserted-by":"crossref","first-page":"13:1","DOI":"10.1145\/3086695","volume":"36","author":"J Zhang","year":"2017","unstructured":"Zhang, J., Tang, J., Ma, C., Tong, H., Jing, Y., Li, J., Luyten, W., Moens, M.-F.: Fast and flexible top-k similarity search on large networks. ACM Trans. Inf. Syst. 36(2), 13:1\u201313:30 (2017)","journal-title":"ACM Trans. Inf. Syst."},{"key":"849_CR223","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/j.ins.2018.04.022","volume":"453","author":"M Zhang","year":"2018","unstructured":"Zhang, M., Wang, J., Wang, W.: HeteRank: A general similarity measure in heterogeneous information networks by integrating multi-type relationships. Inf. Sci. 453, 389\u2013407 (2018)","journal-title":"Inf. Sci."},{"key":"849_CR224","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, S., Yang, J.: GADDI: distance index based subgraph matching in biological networks. In: EDBT, pp 192\u2013203 (2009)","DOI":"10.1145\/1516360.1516384"},{"issue":"1","key":"849_CR225","first-page":"1185","volume":"3","author":"S Zhang","year":"2010","unstructured":"Zhang, S., Yang, J., Jin, W.: SAPPER: Subgraph indexing and approximate matching in large graphs. PVLDB 3(1), 1185\u20131194 (2010)","journal-title":"PVLDB"},{"key":"849_CR226","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, J., Gao, H., Zou, Z.: A novel approach for efficient supergraph query processing on graph databases. In: EDBT, pp 204\u2013215 (2009)","DOI":"10.1145\/1516360.1516385"},{"issue":"4","key":"849_CR227","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TKDE.2015.2499201","volume":"28","author":"W Zhang","year":"2016","unstructured":"Zhang, W., Lin, X., Zhang, Y., Zhu, K., Zhu, G.: Efficient probabilistic supergraph search. IEEE Trans. Knowl. Data Eng. 28(4), 965\u2013978 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"849_CR228","first-page":"488","volume":"12","author":"X Zhang","year":"2019","unstructured":"Zhang, X., \u00d6zsu, M T: Correlation constraint shortest path over large multi-relation graphs. PVLDB 12(5), 488\u2013501 (2019)","journal-title":"PVLDB"},{"key":"849_CR229","doi-asserted-by":"crossref","unstructured":"Zhang, X., Feng, Z., Wang, X., Rao, G., Wu, W.: Context-free path queries on RDF graphs. In: ISWC, pp 632\u2013648 (2016)","DOI":"10.1007\/978-3-319-46523-4_38"},{"issue":"1","key":"849_CR230","first-page":"340","volume":"3","author":"P Zhao","year":"2010","unstructured":"Zhao, P., Han, J.: On graph query optimization in large networks. PVLDB 3(1), 340\u2013351 (2010)","journal-title":"PVLDB"},{"key":"849_CR231","doi-asserted-by":"crossref","unstructured":"Zhao, P., Li, X., Xin, D., Han, J.: Graph cube: on warehousing and OLAP multidimensional networks. In: SIGMOD, pp 853\u2013864 (2011)","DOI":"10.1145\/1989323.1989413"},{"issue":"3","key":"849_CR232","first-page":"169","volume":"7","author":"X Zhao","year":"2013","unstructured":"Zhao, X., Xiao, C., Lin, X., Liu, Q., Zhang, W.: A partition-based approach to structure similarity search. PVLDB 7(3), 169\u2013180 (2013)","journal-title":"PVLDB"},{"issue":"7","key":"849_CR233","doi-asserted-by":"crossref","first-page":"1805","DOI":"10.1109\/TKDE.2016.2530063","volume":"28","author":"W Zheng","year":"2016","unstructured":"Zheng, W., Lian, X., Zou, L., Hong, L., Zhao, D.: Online subgraph skyline analysis over knowledge graphs. IEEE Trans. Knowl. Data Eng. 28(7), 1805\u20131819 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"849_CR234","doi-asserted-by":"crossref","unstructured":"Zheng, W., Zou, L., Lian, X., Hong, L., Zhao, D.: Efficient subgraph skyline search over large graphs. In: CIKM, pp 1529\u20131538 (2014)","DOI":"10.1145\/2661829.2662037"},{"key":"849_CR235","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.knosys.2018.05.010","volume":"154","author":"Y Zhou","year":"2018","unstructured":"Zhou, Y., Huang, J., Li, H., Sun, H., Peng, Y., Xu, Y.: A semantic-rich similarity measure in heterogeneous information networks. Knowl.-Based Syst. 154, 32\u201342 (2018)","journal-title":"Knowl.-Based Syst."},{"key":"849_CR236","doi-asserted-by":"crossref","unstructured":"Zhu, G., Lin, X., Zhu, K., Zhang, W., Yu, J.X.: TreeSpan: efficiently computing similarity all-matching. In: SIGMOD, pp 529\u2013540 (2012)","DOI":"10.1145\/2213836.2213896"},{"issue":"4","key":"849_CR237","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s00778-017-0464-7","volume":"26","author":"Q Zhu","year":"2017","unstructured":"Zhu, Q., Cheng, H., Huang, X.: I\/O-efficient algorithms for top-k nearest keyword search in massive graphs. VLDB J. 26(4), 563\u2013583 (2017)","journal-title":"VLDB J."},{"key":"849_CR238","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Qin, L., Yu, J.X., Cheng, H.: Finding top-k similar graphs in graph databases. In: EDBT, pp 456\u2013467 (2012)","DOI":"10.1145\/2247596.2247650"},{"key":"849_CR239","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Zhang, Q., Qin, L., Chang, L., Yu, J.X.: Querying cohesive subgraphs by keywords. In: ICDE, pp 1324\u20131327 (2018)","DOI":"10.1109\/ICDE.2018.00141"},{"key":"849_CR240","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Zhang, Q., Qin, L., Chang, L., Yu, J.X.: Cohesive subgraph search using keywords in large networks. IEEE Trans. Knowl. Data Eng. (2020)","DOI":"10.1109\/TKDE.2020.2975793"},{"issue":"1","key":"849_CR241","first-page":"886","volume":"2","author":"L Zou","year":"2009","unstructured":"Zou, L., Chen, L., \u00d6zsu, M T: Distance-join: Pattern match query in a large graph database. PVLDB 2(1), 886\u2013897 (2009)","journal-title":"PVLDB"},{"key":"849_CR242","doi-asserted-by":"crossref","unstructured":"Zou, L., Huang, R., Wang, H., Yu, J.X., He, W., Zhao, D.: Natural language question answering over RDF: a graph data driven approach. In: SIGMOD, pp 313\u2013324 (2014)","DOI":"10.1145\/2588555.2610525"},{"key":"849_CR243","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.is.2013.10.003","volume":"40","author":"L Zou","year":"2014","unstructured":"Zou, L., Xu, K., Yu, J.X., Chen, L., Xiao, Y., Zhao, D.: Efficient processing of label-constraint reachability queries in large graphs. Inf. Syst. 40, 47\u201366 (2014)","journal-title":"Inf. Syst."}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-020-00849-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-020-00849-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-020-00849-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T00:23:08Z","timestamp":1669681388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-020-00849-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,20]]},"references-count":243,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["849"],"URL":"https:\/\/doi.org\/10.1007\/s11280-020-00849-0","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,20]]},"assertion":[{"value":"21 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}