{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T19:51:59Z","timestamp":1779911519975,"version":"3.53.1"},"reference-count":62,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T00:00:00Z","timestamp":1629763200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMOD Rec."],"published-print":{"date-parts":[[2021,8,24]]},"abstract":"<jats:p>A common conceptual view of text analysis is that of a two-step process, where we first extract relations from text documents and then apply a relational query over the result. Hence, text analysis shares technical challenges with, and can draw ideas from, relational databases. A framework that formally instantiates this connection is that of the document spanners. In this article, we review recent advances in various research efforts that adapt fundamental database concepts to text analysis through the lens of document spanners. Among others, we discuss aspects of query evaluation, aggregate queries, provenance, and distributed query planning.<\/jats:p>","DOI":"10.1145\/3484622.3484624","type":"journal-article","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T20:31:09Z","timestamp":1630441869000},"page":"6-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Database Principles and Challenges in Text Analysis"],"prefix":"10.1145","volume":"50","author":[{"given":"Johannes","family":"Doleschal","sequence":"first","affiliation":[{"name":"University of Bayreuth &amp; Hasselt University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benny","family":"Kimelfeld","sequence":"additional","affiliation":[{"name":"Technion, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wim","family":"Martens","sequence":"additional","affiliation":[{"name":"University of Bayreuth"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,8,31]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"1","volume-title":"ICALP","author":"Amarilli A.","year":"2017","unstructured":"A. Amarilli , P. Bourhis , L. Jachiet , and S. Mengel . A circuit-based approach to efficient enumeration . In ICALP , pages 111: 1 -- 111 :15, 2017 . A. Amarilli, P. Bourhis, L. Jachiet, and S. Mengel. A circuit-based approach to efficient enumeration. In ICALP, pages 111:1--111:15, 2017."},{"key":"e_1_2_1_2_1","first-page":"1","volume-title":"ICDT","author":"Amarilli A.","year":"2018","unstructured":"A. Amarilli , P. Bourhis , and S. Mengel . Enumeration on trees under relabelings . In ICDT , pages 5: 1 -- 5 :18, 2018 . A. Amarilli, P. Bourhis, and S. Mengel. Enumeration on trees under relabelings. In ICDT, pages 5:1--5:18, 2018."},{"key":"e_1_2_1_3_1","first-page":"1","volume-title":"ICDT","author":"Amarilli A.","year":"2019","unstructured":"A. Amarilli , P. Bourhis , S. Mengel , and M. Niewerth . Constant-delay enumeration for nondeterministic document spanners . In ICDT , pages 22: 1 -- 22 :19, 2019 . A. Amarilli, P. Bourhis, S. Mengel, and M. Niewerth. Constant-delay enumeration for nondeterministic document spanners. In ICDT, pages 22:1--22:19, 2019."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3436487"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3106412"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3294052.3319704"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2392389.2392412"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321486"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1862919.1862926"},{"key":"e_1_2_1_10_1","first-page":"1","volume-title":"ICDT","author":"Bourhis P.","year":"2021","unstructured":"P. Bourhis , A. Grez , L. Jachiet , and C. Riveros . Ranked enumeration of MSO logic on words . In ICDT , pages 20: 1 -- 20 :19, 2021 . P. Bourhis, A. Grez, L. Jachiet, and C. Riveros. Ranked enumeration of MSO logic on words. In ICDT, pages 20:1--20:19, 2021."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-019-09937-9"},{"key":"e_1_2_1_12_1","volume-title":"IJCNLP","author":"Chen J.","year":"2005","unstructured":"J. Chen , D. Ji , C. L. Tan , and Z. Niu . Unsupervised feature selection for relation extraction . In IJCNLP , 2005 . J. Chen, D. Ji, C. L. Tan, and Z. Niu. Unsupervised feature selection for relation extraction. In IJCNLP, 2005."},{"key":"e_1_2_1_13_1","first-page":"128","volume-title":"ACL","author":"Chiticariu L.","year":"2010","unstructured":"L. Chiticariu , R. Krishnamurthy , Y. Li , S. Raghavan , F. Reiss , and S. Vaithyanathan . SystemT: An algebraic approach to declarative information extraction . In ACL , pages 128 -- 137 , 2010 . L. Chiticariu, R. Krishnamurthy, Y. Li, S. Raghavan, F. Reiss, and S. Vaithyanathan. SystemT: An algebraic approach to declarative information extraction. In ACL, pages 128--137, 2010."},{"key":"e_1_2_1_15_1","first-page":"1","volume-title":"ICDT","author":"Doleschal J.","year":"2021","unstructured":"J. Doleschal , N. Bratman , B. Kimelfeld , and W. Martens . The Complexity of Aggregates over Extractions by Regular Expressions . In ICDT , pages 10: 1 -- 10 :20, 2021 . J. Doleschal, N. Bratman, B. Kimelfeld, and W. Martens. The Complexity of Aggregates over Extractions by Regular Expressions. In ICDT, pages 10:1--10:20, 2021."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3294052.3319684"},{"key":"e_1_2_1_17_1","volume-title":"Split-correctness in information extraction. CoRR, abs\/1810.03367","author":"Doleschal J.","year":"2021","unstructured":"J. Doleschal , B. Kimelfeld , W. Martens , F. Neven , and M. Niewerth . Split-correctness in information extraction. CoRR, abs\/1810.03367 , 2021 . J. Doleschal, B. Kimelfeld, W. Martens, F. Neven, and M. Niewerth. Split-correctness in information extraction. CoRR, abs\/1810.03367, 2021."},{"key":"e_1_2_1_18_1","first-page":"1","volume-title":"ICDT","author":"Doleschal J.","year":"2020","unstructured":"J. Doleschal , B. Kimelfeld , W. Martens , and L. Peterfreund . Weight annotation in information extraction . In ICDT , pages 8: 1 -- 8 :18, 2020 . J. Doleschal, B. Kimelfeld, W. Martens, and L. Peterfreund. Weight annotation in information extraction. In ICDT, pages 8:1--8:18, 2020."},{"key":"e_1_2_1_19_1","volume-title":"CoRR","author":"Doleschal J.","year":"2020","unstructured":"J. Doleschal , B. Kimelfeld , W. Martens , and L. Peterfreund . Weight annotation in information extraction . CoRR , 2020 . J. Doleschal, B. Kimelfeld, W. Martens, and L. Peterfreund. Weight annotation in information extraction. CoRR, 2020."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3389130"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699442"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935694.2935696"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2877202"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196987"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-018-9874-1"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-017-9770-0"},{"key":"e_1_2_1_27_1","volume-title":"Finite models and the theory of concatenation. CoRR, abs\/1912.06110","author":"Freydenberger D. D.","year":"2019","unstructured":"D. D. Freydenberger and L. Peterfreund . Finite models and the theory of concatenation. CoRR, abs\/1912.06110 , 2019 . D. D. Freydenberger and L. Peterfreund. Finite models and the theory of concatenation. CoRR, abs\/1912.06110, 2019."},{"key":"e_1_2_1_28_1","first-page":"1","volume-title":"ICDT","author":"Freydenberger D. D.","year":"2020","unstructured":"D. D. Freydenberger and S. M. Thompson . Dynamic complexity of document spanners . In ICDT , pages 11: 1 -- 11 :21, 2020 . 16 SIGMOD Record , June 2021 (Vol. 50, No. 2) D. D. Freydenberger and S. M. Thompson. Dynamic complexity of document spanners. In ICDT, pages 11:1--11:21, 2020. 16 SIGMOD Record, June 2021 (Vol. 50, No. 2)"},{"key":"e_1_2_1_29_1","volume-title":"EACL","author":"Giuliano C.","year":"2006","unstructured":"C. Giuliano , A. Lavelli , and L. Romano . Exploiting shallow linguistic information for relation extraction from biomedical literature . In EACL , 2006 . C. Giuliano, A. Lavelli, and L. Romano. Exploiting shallow linguistic information for relation extraction from biomedical literature. In EACL, 2006."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265535"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/972684.972687"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90174-X"},{"key":"e_1_2_1_33_1","first-page":"551","volume-title":"SODA","author":"Kannan S.","year":"1995","unstructured":"S. Kannan , Z. Sweedyk , and S. Mahaney . Counting and random generation of strings in regular languages . In SODA , pages 551 -- 557 . SIAM , 1995 . S. Kannan, Z. Sweedyk, and S. Mahaney. Counting and random generation of strings in regular languages. In SODA, pages 551--557. SIAM, 1995."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N16-1030"},{"key":"e_1_2_1_35_1","first-page":"652","volume-title":"PSB","author":"Leaman R.","year":"2008","unstructured":"R. Leaman and G. Gonzalez . BANNER: an executable survey of advances in biomedical named entity recognition . In PSB , pages 652 -- 663 , 2008 . R. Leaman and G. Gonzalez. BANNER: an executable survey of advances in biomedical named entity recognition. In PSB, pages 652--663, 2008."},{"key":"e_1_2_1_36_1","first-page":"28","volume-title":"CoNLL","author":"Lee H.","year":"2011","unstructured":"H. Lee , Y. Peirsman , A. Chang , N. Chambers , M. Surdeanu , and D. Jurafsky . Stanford's multi-pass sieve coreference resolution system at the conll-2011 shared task . In CoNLL , pages 28 -- 34 , 2011 . H. Lee, Y. Peirsman, A. Chang, N. Chambers, M. Surdeanu, and D. Jurafsky. Stanford's multi-pass sieve coreference resolution system at the conll-2011 shared task. In CoNLL, pages 28--34, 2011."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3401832.3402681"},{"key":"e_1_2_1_38_1","first-page":"319","volume-title":"DSMML","author":"Li Y.","year":"2004","unstructured":"Y. Li , K. Bontcheva , and H. Cunningham . SVM based learning system for information extraction . In DSMML , pages 319 -- 339 , 2004 . Y. Li, K. Bontcheva, and H. Cunningham. SVM based learning system for information extraction. In DSMML, pages 319--339, 2004."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603137"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/3016100.3016288"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196968"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209144"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196961"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3003665.3003667"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.3115\/1218955.1218990"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/645505.656442"},{"key":"e_1_2_1_47_1","first-page":"210","volume-title":"PODS","author":"Patnaik S.","year":"1994","unstructured":"S. Patnaik and N. Immerman . Dyn-fo: A parallel, dynamic complexity class . In PODS , pages 210 -- 221 , 1994 . S. Patnaik and N. Immerman. Dyn-fo: A parallel, dynamic complexity class. In PODS, pages 210--221, 1994."},{"key":"e_1_2_1_48_1","first-page":"1","volume-title":"ICDT","author":"Peterfreund L.","year":"2021","unstructured":"L. Peterfreund . Grammars for document spanners . In ICDT , pages 7: 1 -- 7 :18, 2021 . L. Peterfreund. Grammars for document spanners. In ICDT, pages 7:1--7:18, 2021."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3294052.3319699"},{"key":"e_1_2_1_50_1","first-page":"1","volume-title":"ICDT","author":"Peterfreund L.","year":"2019","unstructured":"L. Peterfreund , B. ten Cate , R. Fagin , and B. Kimelfeld . Recursive Programs for Document Spanners . In ICDT , pages 13: 1 -- 13 :18, 2019 . L. Peterfreund, B. ten Cate, R. Fagin, and B. Kimelfeld. Recursive Programs for Document Spanners. In ICDT, pages 13:1--13:18, 2019."},{"key":"e_1_2_1_51_1","first-page":"913","volume-title":"AAAI","author":"Poon H.","year":"2007","unstructured":"H. Poon and P. M. Domingos . Joint inference in information extraction . In AAAI , pages 913 -- 918 , 2007 . H. Poon and P. M. Domingos. Joint inference in information extraction. In AAAI, pages 913--918, 2007."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187958"},{"key":"e_1_2_1_53_1","first-page":"492","volume-title":"EMNLP","author":"Raghunathan K.","year":"2010","unstructured":"K. Raghunathan , H. Lee , S. Rangarajan , N. Chambers , M. Surdeanu , D. Jurafsky , and C. D. Manning . A multi-pass sieve for coreference resolution . In EMNLP , pages 492 -- 501 , 2010 . K. Raghunathan, H. Lee, S. Rangarajan, N. Chambers, M. Surdeanu, D. Jurafsky, and C. D. Manning. A multi-pass sieve for coreference resolution. In EMNLP, pages 492--501, 2010."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/3157794.3157797"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000003"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/AIKE.2019.00036"},{"key":"e_1_2_1_57_1","first-page":"1","volume-title":"ICDT","author":"Schmid M. L.","year":"2021","unstructured":"M. L. Schmid and N. Schweikardt . A purely regular approach to non-regular core spanners . In ICDT , pages 4: 1 -- 4 :19, 2021 . M. L. Schmid and N. Schweikardt. A purely regular approach to non-regular core spanners. In ICDT, pages 4:1--4:19, 2021."},{"key":"e_1_2_1_58_1","volume-title":"PODS","author":"Schmid M. L.","year":"2021","unstructured":"M. L. Schmid and N. Schweikardt . Spanner evaluation over SLP-compressed documents . In PODS , 2021 . M. L. Schmid and N. Schweikardt. Spanner evaluation over SLP-compressed documents. In PODS, 2021."},{"key":"e_1_2_1_59_1","first-page":"1033","volume-title":"VLDB","author":"Shen W.","year":"2007","unstructured":"W. Shen , A. Doan , J. F. Naughton , and R. Ramakrishnan . Declarative information extraction using Datalog with embedded extraction predicates . In VLDB , pages 1033 -- 1044 , 2007 . W. Shen, A. Doan, J. F. Naughton, and R. Ramakrishnan. Declarative information extraction using Datalog with embedded extraction predicates. In VLDB, pages 1033--1044, 2007."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809991"},{"key":"e_1_2_1_61_1","first-page":"129","volume-title":"ICML","author":"Socher R.","year":"2011","unstructured":"R. Socher , C. C. Lin , A. Y. Ng , and C. D. Manning . Parsing natural scenes and natural language with recursive neural networks . In ICML , pages 129 -- 136 , 2011 . R. Socher, C. C. Lin, A. Y. Ng, and C. D. Manning. Parsing natural scenes and natural language with recursive neural networks. In ICML, pages 129--136, 2011."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000013"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1203"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3484622.3484624","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3484622.3484624","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:14Z","timestamp":1750191434000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3484622.3484624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,24]]},"references-count":62,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,8,24]]}},"alternative-id":["10.1145\/3484622.3484624"],"URL":"https:\/\/doi.org\/10.1145\/3484622.3484624","relation":{},"ISSN":["0163-5808"],"issn-type":[{"value":"0163-5808","type":"print"}],"subject":[],"published":{"date-parts":[[2021,8,24]]},"assertion":[{"value":"2021-08-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}