{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:39:54Z","timestamp":1742942394910,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030161415"},{"type":"electronic","value":"9783030161422"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-16142-2_20","type":"book-chapter","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T02:50:37Z","timestamp":1554346237000},"page":"249-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Large-Scale Repository of Deterministic Regular Expression Patterns and Its Applications"],"prefix":"10.1007","author":[{"given":"Haiming","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yeting","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunmei","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyu","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoying","family":"Mou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Min","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,20]]},"reference":[{"key":"20_CR1","unstructured":"igraph - the network analysis package. http:\/\/igraph.org\/"},{"key":"20_CR2","unstructured":"RegExLib. www.regexlib.com"},{"key":"20_CR3","unstructured":"Software for complex networks. http:\/\/networkx.github.io\/"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Milo, T., Benjelloun, O.: Regular rewriting of active XML and unambiguity. In: PODS 2005, pp. 295\u2013303. ACM (2005)","DOI":"10.1145\/1065167.1065204"},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s11280-006-8437-6","volume":"9","author":"D Barbosa","year":"2006","unstructured":"Barbosa, D., Mignet, L., Veltri, P.: Studying the XML Web: gathering statistics from an XML sample. World Wide Web 9(2), 187\u2013212 (2006)","journal-title":"World Wide Web"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Bex, G.J., Martens, W., Neven, F., Schwentick, T.: Expressiveness of XSDs: from practice to theory, there and back again. In: WWW 2005, pp. 712\u2013721. ACM (2005)","DOI":"10.1145\/1060745.1060848"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Bex, G.J., Neven, F., Van den Bussche, J.: DTDs versus XML schema: a practical study. In: WebDB 2004, pp. 79\u201384. ACM (2004)","DOI":"10.1145\/1017074.1017095"},{"key":"20_CR8","unstructured":"Bex, G.J., Neven, F., Schwentick, T., Tuyls, K.: Inference of concise DTDs from XML data. In: VLDB 2006, pp. 115\u2013126. VLDB Endowment (2006)"},{"key":"20_CR9","unstructured":"Bex, G.J., Neven, F., Vansummeren, S.: Inferring XML schema definitions from XML data. In: VLDB 2007, pp. 998\u20131009 (2007)"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, H., Martens, W., Timm, T.: Efficient incremental evaluation of succinct regular expressions. In: CIKM 2015, pp. 1541\u20131550. ACM (2015)","DOI":"10.1145\/2806416.2806434"},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1006\/inco.1997.2695","volume":"142","author":"A Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Inf. Comput. 142(2), 182\u2013206 (1998)","journal-title":"Inf. Comput."},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-85762-4_7","volume-title":"Theoretical Aspects of Computing - ICTAC 2008","author":"H Chen","year":"2008","unstructured":"Chen, H., Chen, L.: Inclusion test algorithms for one-unambiguous regular expressions. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol. 5160, pp. 96\u2013110. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85762-4_7"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.ic.2014.12.001","volume":"241","author":"H Chen","year":"2015","unstructured":"Chen, H., Lu, P.: Checking determinism of regular expressions with counting. Inf. Comput. 241, 302\u2013320 (2015)","journal-title":"Inf. Comput."},{"key":"20_CR14","unstructured":"Choi, B.: What are real DTDs like. Technical reports (CIS), p. 17 (2002)"},{"key":"20_CR15","unstructured":"Ciucanu, R., Staworko, S.: Learning schemas for unordered XML. arXiv:1307.6348 [cs.DB] (2013)"},{"issue":"2013","key":"20_CR16","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.tcs.2013.04.023","volume":"492","author":"D Colazzo","year":"2013","unstructured":"Colazzo, D., Ghelli, G., Pardini, L., Sartiani, C.: Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking. Theor. Comput. Sci. 492(2013), 88\u2013116 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"20_CR17","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/3132701","volume":"42","author":"D Colazzo","year":"2017","unstructured":"Colazzo, D., Ghelli, G., Sartiani, C.: Linear time membership in a class of regular expressions with counting, interleaving, and unordered concatenation. ACM Trans. Database Syst. (TODS) 42(4), 24 (2017)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.1007\/s00224-014-9559-3","volume":"57","author":"DD Freydenberger","year":"2015","unstructured":"Freydenberger, D.D., K\u00f6tzing, T.: Fast learning of restricted regular expressions and DTDs. Theory Comput. Syst. 57, 1114\u20131158 (2015)","journal-title":"Theory Comput. Syst."},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Grijzenhout, S., Marx, M.: The quality of the XML web. In: CIKM 2011, pp. 1719\u20131724 (2011)","DOI":"10.1145\/2063576.2063824"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Huang, X., Bao, Z., Davidson, S.B., Milo, T., Yuan, X.: Answering regular path queries on workflow provenance, pp. 375\u2013386. IEEE (2015)","DOI":"10.1109\/ICDE.2015.7113299"},{"key":"20_CR21","unstructured":"Boneva, I., Ciucanu, R., Staworko, S.: Simple schemas for unordered XML. In: WebDB 2013, pp. 13\u201318 (2013)"},{"issue":"3","key":"20_CR22","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1016\/j.is.2010.10.001","volume":"36","author":"P Kilpel\u00e4inen","year":"2011","unstructured":"Kilpel\u00e4inen, P.: Checking determinism of XML Schema content models in optimal time. Inf. Syst. 36(3), 596\u2013617 (2011)","journal-title":"Inf. Syst."},{"issue":"1","key":"20_CR23","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1558334.1558338","volume":"38","author":"AH Laender","year":"2009","unstructured":"Laender, A.H., Moro, M.M., Nascimento, C., Martins, P.: An X-ray on web-available XML schemas. ACM SIGMOD Rec. 38(1), 37\u201342 (2009)","journal-title":"ACM SIGMOD Rec."},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Li, Y., Chu, X., Mou, X., Dong, C., Chen, H.: Practical study of deterministic regular expressions from large-scale XML and schema files. In: IDEAS 2018, pp. 45\u201353. ACM (2018)","DOI":"10.1145\/3216122.3216126"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-319-45817-5_29","volume-title":"Web Technologies and Applications","author":"Y Li","year":"2016","unstructured":"Li, Y., Zhang, X., Peng, F., Chen, H.: Practical study of subclasses of regular expressions in DTD and XML schema. In: Li, F., Shim, K., Zheng, K., Liu, G. (eds.) APWeb 2016. LNCS, vol. 9932, pp. 368\u2013382. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45817-5_29"},{"issue":"4","key":"20_CR26","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/2494529","volume":"38","author":"K Losemann","year":"2013","unstructured":"Losemann, K., Martens, W.: The complexity of regular expressions and property paths in SPARQL. ACM Trans. Database Syst. 38(4), 24:1\u201324:39 (2013)","journal-title":"ACM Trans. Database Syst."},{"key":"20_CR27","unstructured":"Makoto, M.: RELAX NG home page (2014). http:\/\/relaxng.org\/. Accessed 25 Feb 2014"},{"key":"20_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-25255-1_9","volume-title":"Web Technologies and Applications","author":"F Peng","year":"2015","unstructured":"Peng, F., Chen, H.: Discovering restricted regular expressions with interleaving. In: Cheng, R., Cui, B., Zhang, Z., Cai, R., Xu, J. (eds.) APWeb 2015. LNCS, vol. 9313, pp. 104\u2013115. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25255-1_9"},{"key":"20_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-25150-9_13","volume-title":"Theoretical Aspects of Computing - ICTAC 2015","author":"F Peng","year":"2015","unstructured":"Peng, F., Chen, H., Mou, X.: Deterministic regular expressions with interleaving. In: Leucker, M., Rueda, C., Valencia, F.D. (eds.) ICTAC 2015. LNCS, vol. 9399, pp. 203\u2013220. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25150-9_13"},{"key":"20_CR30","unstructured":"Thompson, H.S., Beech, D., Maloney, M., Mendelsohn, N.: XML Schema part 1: structures second edition. W3C Recommendation (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16142-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:19:45Z","timestamp":1709813985000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-16142-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030161415","9783030161422"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16142-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"20 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.pakdd2019.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":"Microsoft Conf. Man. Toolkit CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"542","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":"137","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":"0","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":"25% - 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.79","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":"5.85","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":"In addition, there were 31 PAKDD 2019 Workshops' papers accepted for publication","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)"}}]}}