{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:28:57Z","timestamp":1743121737657,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031306365"},{"type":"electronic","value":"9783031306372"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30637-2_3","type":"book-chapter","created":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T10:08:13Z","timestamp":1681380493000},"page":"35-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Index-Based Regular Expression Matching with\u00a0Optimal Query Plan Tree"],"prefix":"10.1007","author":[{"given":"Tao","family":"Qiu","sequence":"first","affiliation":[]},{"given":"Xiaochun","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chuanyu","family":"Zong","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Xiufeng","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,14]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(86)90088-5","volume":"48","author":"G Berry","year":"1986","unstructured":"Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theoret. Comput. Sci. 48, 117\u2013126 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR2","unstructured":"Cho, J., Rajagopalan, S.: A fast regular expression indexing engine. In: ICDE, vol. 2, p. 0419 (2002)"},{"key":"3_CR3","unstructured":"Cox, R.: https:\/\/swtch.com\/rsc\/regexp\/regexp4.html"},{"key":"3_CR4","unstructured":"DeRose, P., Shen, W., Chen, F., Lee, Y., et al.: DBLife: a community information management platform for the database research community. In: CIDR, pp. 169\u2013172 (2007)"},{"key":"3_CR5","unstructured":"GNUgrep. http:\/\/reality.sgiweb.org\/freeware\/relnotes\/ fw-5.3\/fw_gnugrep\/gnugrep.html"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.artint.2005.09.002","volume":"170","author":"R Greiner","year":"2006","unstructured":"Greiner, R., Hayward, R., et al.: Finding optimal satisficing strategies for and-or trees. Artif. Intell. 170(1), 19\u201358 (2006)","journal-title":"Artif. Intell."},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1093\/nar\/27.1.215","volume":"27","author":"K Hofmann","year":"1999","unstructured":"Hofmann, K., Bucher, P., Falquet, L., Bairoch, A.: The PROSITE database. Nucleic Acids Res. 27(1), 215\u2013219 (1999)","journal-title":"Nucleic Acids Res."},{"issue":"1\u20132","key":"3_CR8","first-page":"1173","volume":"3","author":"R Kandhan","year":"2010","unstructured":"Kandhan, R., Teletia, N., Patel, J.M.: SigMatch: fast and scalable multi-pattern matching. VLDB 3(1\u20132), 1173\u20131184 (2010)","journal-title":"VLDB"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Majumder, A., Rastogi, R., Vanama, S.: Scalable regular expression matching on data streams. In: SIGMOD, pp. 161\u2013172. ACM (2008)","DOI":"10.1145\/1376616.1376635"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IEEE Trans. Electron. Comput. 1(EC-9), 39\u201347 (1960)","DOI":"10.1109\/TEC.1960.5221603"},{"issue":"2","key":"3_CR11","first-page":"217","volume":"4","author":"M Mohri","year":"1997","unstructured":"Mohri, M.: String-matching with automata. Nord. J. Comput. 4(2), 217\u2013231 (1997)","journal-title":"Nord. J. Comput."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1002\/spe.411","volume":"31","author":"C Navarro","year":"2001","unstructured":"Navarro, C.: NR-grep: a fast and flexible pattern matching tool. Softw. Pract. Experience (SPE) 31, 1265\u20131312 (2001)","journal-title":"Softw. Pract. Experience (SPE)"},{"key":"3_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316135228","volume-title":"Flexible Pattern Matching in Strings: Practical Online Search Algorithms for Texts and Biological Sequences","author":"G Navarro","year":"2002","unstructured":"Navarro, G., Raffinot, M.: Flexible Pattern Matching in Strings: Practical Online Search Algorithms for Texts and Biological Sequences. Cambridge University Press, Cambridge (2002)"},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s00453-004-1120-3","volume":"41","author":"G Navarro","year":"2005","unstructured":"Navarro, G., Raffinot, M.: New techniques for regular expression searching. Algorithmica 41(2), 89\u2013116 (2005). https:\/\/doi.org\/10.1007\/s00453-004-1120-3","journal-title":"Algorithmica"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1109\/TKDE.2020.2992295","volume":"34","author":"T Qiu","year":"2020","unstructured":"Qiu, T., Yang, X., Wang, B., Wang, W.: Efficient regular expression matching based on positional inverted index. IEEE Trans. Knowl. Data Eng. 34, 1133\u20131148 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-61680-2_68","volume-title":"Algorithms\u2014ESA\u201996","author":"BW Watson","year":"1996","unstructured":"Watson, B.W.: A new regula grammar pattern matching algorithm. In: Diaz, J., Serna, M. (eds.) ESA 1996. LNCS, vol. 1136, pp. 364\u2013377. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61680-2_68"},{"issue":"4","key":"3_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/2847525","volume":"40","author":"X Yang","year":"2016","unstructured":"Yang, X., Qiu, T., Wang, B., Zheng, B., Wang, Y., Li, C.: Negative factor: improving regular-expression matching in strings. ACM Trans. Database Syst. 40(4), 25 (2016)","journal-title":"ACM Trans. Database Syst."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Yu, F., Chen, Z., Diao, Y., Lakshman, T., Katz, R.H.: Fast and memory-efficient regular expression matching for deep packet inspection. In: ANCS, 2006, pp. 93\u2013102. IEEE (2006)","DOI":"10.1145\/1185347.1185360"}],"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-30637-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:08:46Z","timestamp":1710263326000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30637-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306365","9783031306372"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30637-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"14 April 2023","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":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/dasfaa2023\/","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"652","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":"125","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":"66","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":"19% - 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":"7.3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}