{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:52:20Z","timestamp":1742914340356,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031001222"},{"type":"electronic","value":"9783031001239"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-00123-9_26","type":"book-chapter","created":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T21:14:54Z","timestamp":1651007694000},"page":"325-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Pivoted Subgraph Filtering with Partial Coding Trees on GPU"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0582-4223","authenticated-orcid":false,"given":"Yang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2227-1296","authenticated-orcid":false,"given":"Chuanwen","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"key":"26_CR1","unstructured":"Abdelhamid, E., Abdelaziz, I., Khayyat, Z., Kalnis, P.: Pivoted subgraph isomorphism: The optimist, the pessimist and the realist. In: EDBT, pp. 361\u2013372 (2019)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Bonnici, V., Giugno, R., Bombieri, N.: An efficient implementation of a subgraph isomorphism algorithm for GPUs. In: 2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), pp. 2674\u20132681. IEEE (2018)","DOI":"10.1109\/BIBM.2018.8621444"},{"issue":"1","key":"26_CR3","first-page":"30","volume":"14","author":"YR Cho","year":"2009","unstructured":"Cho, Y.R., Zhang, A.: Predicting protein function by frequent functional association pattern mining in protein interaction networks. IEEE Trans. Inf. Technol. Biomed. 14(1), 30\u201336 (2009)","journal-title":"IEEE Trans. Inf. Technol. Biomed."},{"issue":"7","key":"26_CR4","doi-asserted-by":"publisher","first-page":"517","DOI":"10.14778\/2732286.2732289","volume":"7","author":"M Elseidy","year":"2014","unstructured":"Elseidy, M., Abdelhamid, E., Skiadopoulos, S., Kalnis, P.: Grami: frequent subgraph and pattern mining in a single large graph. Proc. VLDB Endowment 7(7), 517\u2013528 (2014)","journal-title":"Proc. VLDB Endowment"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Han, J., Wen, J.R.: Mining frequent neighborhood patterns in a large labeled graph. In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, pp. 259\u2013268 (2013)","DOI":"10.1145\/2505515.2505530"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Moorman, J.D., Chen, Q., Tu, T.K., Boyd, Z.M., Bertozzi, A.L.: Filtering methods for subgraph matching on multiplex networks. In: 2018 IEEE International Conference on Big Data (Big Data), pp. 3980\u20133985. IEEE (2018)","DOI":"10.1109\/BigData.2018.8622566"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-319-18120-2_18","volume-title":"Database Systems for Advanced Applications","author":"H-N Tran","year":"2015","unstructured":"Tran, H.-N., Kim, J., He, B.: Fast subgraph matching on large graphs using graphics processors. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M.A. (eds.) DASFAA 2015. LNCS, vol. 9049, pp. 299\u2013315. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18120-2_18"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s41019-019-0090-z","volume":"4","author":"X Wang","year":"2019","unstructured":"Wang, X., et al.: Efficient subgraph matching on large RDF graphs using mapreduce. Data Sci. Eng. 4(1), 24\u201343 (2019)","journal-title":"Data Sci. Eng."},{"issue":"3","key":"26_CR9","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/s41019-021-00163-3","volume":"6","author":"Y Wu","year":"2021","unstructured":"Wu, Y., Zhao, J., Sun, R., Chen, C., Wang, X.: Efficient personalized influential community search in large networks. Data Sci. Eng. 6(3), 310\u2013322 (2021)","journal-title":"Data Sci. Eng."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., Yu, J.X., Lu, Y.: A novel spectral coding in a large graph database. In: Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology, pp. 181\u2013192 (2008)","DOI":"10.1145\/1353343.1353369"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-00123-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T21:17:39Z","timestamp":1651007859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-00123-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031001222","9783031001239"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-00123-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"8 April 2022","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dasfaa2022.org\/","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":"543","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":"72","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":"76","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":"13% - 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":"3","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":"6","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":"Conference was originally planned to take place in Hyberabad, India. 24 other papers are included in the volume.","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)"}}]}}