{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T23:59:12Z","timestamp":1771977552596,"version":"3.50.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030731939","type":"print"},{"value":"9783030731946","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-73194-6_12","type":"book-chapter","created":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T19:03:01Z","timestamp":1617735781000},"page":"158-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Keyword-Centric Community Search over Large Heterogeneous Information Networks"],"prefix":"10.1007","author":[{"given":"Lianpeng","family":"Qiao","sequence":"first","affiliation":[]},{"given":"Zhiwei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ye","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,6]]},"reference":[{"key":"12_CR1","unstructured":"Batagelj, V., Zaversnik, M.: An O(m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)"},{"key":"12_CR2","unstructured":"Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword searching and browsing in databases using banks. In: ICDE, pp. 431\u2013440. IEEE (2002)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Khan, A., Severini, L.: Distance-generalized core decomposition. In: ICDM, pp. 1006\u20131023 (2019)","DOI":"10.1145\/3299869.3324962"},{"issue":"10","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.14778\/3231751.3231755","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. Proc. VLDB Endow. 11(10), 1233\u20131246 (2018)","journal-title":"Proc. VLDB Endow."},{"key":"12_CR5","unstructured":"Cohen, J.: Trusses: cohesive subgraphs for social network analysis. National Security Agency Technical Report 16, pp. 3\u201329 (2008)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Lu, Y., Wang, W.: Online search of overlapping communities. In: SIGMOD, pp. 277\u2013288 (2013)","DOI":"10.1145\/2463676.2463722"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: SIGMOD, pp. 991\u20131002 (2014)","DOI":"10.1145\/2588555.2612179"},{"key":"12_CR8","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. IEEE (2007)","DOI":"10.1109\/ICDE.2007.367929"},{"issue":"12","key":"12_CR9","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.14778\/2994509.2994538","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J.: Effective community search for large attributed graphs. Proc. VLDB Endow. 9(12), 1233\u20131244 (2016)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00778-019-00556-x","volume":"29","author":"Y Fang","year":"2020","unstructured":"Fang, Y., et al.: A survey of community search over big graphs. VLDB J. 29(1), 353\u2013392 (2020)","journal-title":"VLDB J."},{"issue":"6","key":"12_CR11","doi-asserted-by":"publisher","first-page":"854","DOI":"10.14778\/3380750.3380756","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. Proc. VLDB Endow. 13(6), 854\u2013867 (2020)","journal-title":"Proc. VLDB Endow."},{"issue":"3\u20135","key":"12_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Golenberg, K., Kimelfeld, B., Sagiv, Y.: Keyword proximity search in complex data graphs. In: SIGMOD, pp. 927\u2013940 (2008)","DOI":"10.1145\/1376616.1376708"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Papakonstantinou, Y.: DISCOVER: keyword search in relational databases. In: VLDB, pp. 670\u2013681. Elsevier (2002)","DOI":"10.1016\/B978-155860869-6\/50065-2"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: SIGMOD, pp. 1311\u20131322 (2014)","DOI":"10.1145\/2588555.2610495"},{"issue":"9","key":"12_CR16","doi-asserted-by":"publisher","first-page":"949","DOI":"10.14778\/3099622.3099626","volume":"10","author":"X Huang","year":"2017","unstructured":"Huang, X., Lakshmanan, L.V.: Attribute-driven community search. Proc. VLDB Endow. 10(9), 949\u2013960 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"12_CR17","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"},{"key":"12_CR18","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":"12_CR19","doi-asserted-by":"publisher","first-page":"681","DOI":"10.14778\/2021017.2021025","volume":"4","author":"M Kargar","year":"2011","unstructured":"Kargar, M., An, A.: Keyword search in graphs: finding r-cliques. Proc. VLDB Endow. 4(10), 681\u2013692 (2011)","journal-title":"Proc. VLDB Endow."},{"issue":"7","key":"12_CR20","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"EL Lawler","year":"1972","unstructured":"Lawler, E.L.: A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Manage. Sci. 18(7), 401\u2013405 (1972)","journal-title":"Manage. Sci."},{"key":"12_CR21","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":"12_CR22","doi-asserted-by":"crossref","unstructured":"Liu, F., Yu, C., Meng, W., Chowdhury, A.: Effective keyword search in relational databases. In: SIGMOD, pp. 563\u2013574 (2006)","DOI":"10.1145\/1142473.1142536"},{"key":"12_CR23","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"},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"12_CR25","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: KDD, pp. 939\u2013948 (2010)","DOI":"10.1145\/1835804.1835923"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Sun, Y., Han, J., Zhao, P., Yin, Z., Cheng, H., Wu, T.: RankClus: integrating clustering with ranking for heterogeneous information network analysis. In: EDBT, pp. 565\u2013576 (2009)","DOI":"10.1145\/1516360.1516426"},{"issue":"3","key":"12_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2500492","volume":"7","author":"Y Sun","year":"2013","unstructured":"Sun, Y., Norick, B., Han, J., Yan, X., Yu, P.S., Yu, X.: PathSelClus: integrating meta-path selection with user-guided object clustering in heterogeneous information networks. TKDD 7(3), 1\u201323 (2013)","journal-title":"TKDD"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Sun, Y., Yu, Y., Han, J.: Ranking-based clustering of heterogeneous information networks with star network schema. In: KDD, pp. 797\u2013806 (2009)","DOI":"10.1145\/1557019.1557107"},{"issue":"5","key":"12_CR30","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TKDE.2017.2783933","volume":"30","author":"L Yuan","year":"2017","unstructured":"Yuan, L., Qin, L., Zhang, W., Chang, L., Yang, J.: Index-based densest clique percolation community search in networks. IEEE Trans. Knowl. Data Eng. 30(5), 922\u2013935 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yu, J.X.: Unboundedness and efficiency of truss maintenance in evolving graphs. In: SIGMOD, pp. 1024\u20131041 (2019)","DOI":"10.1145\/3299869.3300082"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Huang, X., Xu, J., Choi, B., Shang, Z.: Keyword-centric community search. In: ICDE, pp. 422\u2013433. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00045"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Liu, L.: Social influence based clustering of heterogeneous information networks. In: KDD, pp. 338\u2013346 (2013)","DOI":"10.1145\/2487575.2487640"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-73194-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T19:11:47Z","timestamp":1617736307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-73194-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030731939","9783030731946"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73194-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dm.iis.sinica.edu.tw\/DASFAA2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"490","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"98","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}