{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T06:13:30Z","timestamp":1764828810528,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030590505"},{"type":"electronic","value":"9783030590512"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-59051-2_8","type":"book-chapter","created":{"date-parts":[[2020,9,12]],"date-time":"2020-09-12T19:02:51Z","timestamp":1599937371000},"page":"111-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Extending Graph Pattern Matching with\u00a0Regular Expressions"],"prefix":"10.1007","author":[{"given":"Xin","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Ji","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xueyan","family":"Zhong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,8]]},"reference":[{"key":"8_CR1","unstructured":"Full version. https:\/\/github.com\/xgnaw\/sun\/raw\/master\/regularGPM.pdf"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bagan, G., Bonifati, A., Groz, B.: A trichotomy for regular simple path queries on graphs. In: PODS, pp. 261\u2013272 (2013)","DOI":"10.1145\/2463664.2467795"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Brynielsson, J., H\u00f6gberg, J., Kaati, L., Martenson, C., Svenson, P.: Detecting social positions using simulation. In: ASONAM (2010)","DOI":"10.1109\/ASONAM.2010.52"},{"key":"8_CR4","unstructured":"Cheng, J., Zeng, X., Yu, J.X.: Top-k graph pattern matching over large graphs. In: ICDE, pp. 1033\u20131044 (2013)"},{"key":"8_CR5","unstructured":"Cheng, X., Dale, C., Liu, J.: Youtube (2008). http:\/\/netsg.cs.sfu.ca\/youtubedata\/"},{"issue":"10","key":"8_CR6","doi-asserted-by":"publisher","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. TPAMI 26(10), 1367\u20131372 (2004)","journal-title":"TPAMI"},{"issue":"1","key":"8_CR7","first-page":"83","volume":"58","author":"R Fagin","year":"1999","unstructured":"Fagin, R.: Combining fuzzy information from multiple systems. JCSS 58(1), 83\u201399 (1999)","journal-title":"JCSS"},{"issue":"4","key":"8_CR8","first-page":"614","volume":"66","author":"R Fagin","year":"2003","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. JCSS 66(4), 614\u2013656 (2003)","journal-title":"JCSS"},{"key":"8_CR9","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":"8_CR10","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":"11","key":"8_CR11","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":"8_CR12","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"},{"key":"8_CR13","unstructured":"Fletcher, G.H.L., Peters, J., Poulovassilis, A.: Efficient regular path query evaluation using path indexes. In: EDBT, pp. 636\u2013639 (2016)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Garg, S., Gupta, T., Carlsson, N., Mahanti, A.: Evolution of an online social aggregation network: an empirical study. In: IMC (2009)","DOI":"10.1145\/1644893.1644931"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Gou, G., Chirkova, R.: Efficient algorithms for exact ranked twig-pattern matching over graphs. In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376676"},{"key":"8_CR16","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: FOCS (1995)"},{"issue":"4","key":"8_CR17","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1006\/jcss.2001.1748","volume":"62","author":"J Hromkovic","year":"2001","unstructured":"Hromkovic, J., Seibert, S., Wilke, T.: Translating regular expressions into small -free nondeterministic finite automata. J. Comput. Syst. Sci. 62(4), 565\u2013588 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"8_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1391729.1391730","volume":"40","author":"IF Ilyas","year":"2008","unstructured":"Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top- k query processing techniques in relational database systems. ACM Comput. Surv. 40(4), 1\u201358 (2008)","journal-title":"ACM Comput. Surv."},{"key":"8_CR19","unstructured":"Leskovec, J., Krevl, A.: Amazon dataset, June 2014. http:\/\/snap.stanford.edu\/data\/index.html"},{"key":"8_CR20","unstructured":"Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. In: VLDB, pp. 185\u2013193 (1989)"},{"key":"8_CR21","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00224-016-9676-2","volume":"61","author":"JL Reutter","year":"2017","unstructured":"Reutter, J.L., Romero, M., Vardi, M.Y.: Regular queries on graph databases. Theory Comput. Syst. 61(1), 31\u201383 (2017). https:\/\/doi.org\/10.1007\/s00224-016-9676-2","journal-title":"Theory Comput. Syst."},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1145\/1096737.1096740","volume":"12","author":"LG Terveen","year":"2005","unstructured":"Terveen, L.G., McDonald, D.W.: Social matching: a framework and research agenda. ACM Trans. Comput.-Hum. Interact. 12, 401\u2013434 (2005)","journal-title":"ACM Trans. Comput.-Hum. Interact."},{"key":"8_CR24","unstructured":"Wang, H., Han, J., Shao, B., Li, J.: Regular expression matching on billion-nodes graphs. CoRR, abs\/1904.11653 (2019)"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-319-98809-2_25","volume-title":"Database and Expert Systems Applications","author":"X Wang","year":"2018","unstructured":"Wang, X., Zhan, H.: Approximating diversified top-k graph pattern matching. In: Hartmann, S., Ma, H., Hameurlain, A., Pernul, G., Wagner, R.R. (eds.) DEXA 2018. LNCS, vol. 11029, pp. 407\u2013423. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98809-2_25"},{"key":"8_CR26","unstructured":"Wikipedia. Prim\u2019s algorithm (2019). https:\/\/en.wikipedia.org\/wiki\/Prim\u2019s_algorithm"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., Lu, Y.: Top-k subgraph matching query in a large graph. In: Ph.D. Workshop in CIKM (2007)","DOI":"10.1145\/1316874.1316897"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59051-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:37:14Z","timestamp":1709811434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59051-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030590505","9783030590512"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59051-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2020","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"190","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":"38","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":"20","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-6","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":"3-4","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 COVID-19 pandemic the conference was held online. DEXA Workshops volume: submissions sent - 15, full papers accepted - 6, short papers accepted - 4, reviewers per paper 3, papers per reviewer 1-2","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)"}}]}}