{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T08:32:36Z","timestamp":1785227556798,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T00:00:00Z","timestamp":1654992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["416776735, 431183758"],"award-info":[{"award-number":["416776735, 431183758"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,12]]},"DOI":"10.1145\/3517804.3524158","type":"proceedings-article","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T13:29:54Z","timestamp":1655126994000},"page":"79-89","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Query Evaluation over SLP-Represented Document Databases with Complex Document Editing"],"prefix":"10.1145","author":[{"given":"Markus L.","family":"Schmid","sequence":"first","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicole","family":"Schweikardt","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,6,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3436487"},{"key":"#cr-split#-e_1_3_2_2_2_1.1","unstructured":"K. Casel H. Fernau S. Gaspers B. Gras and M.L. Schmid. 2020. On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory of Computing Systems (2020). https:\/\/doi.org\/10.1007\/s00224-020--10013-w 10.1007\/s00224-020--10013-w"},{"key":"#cr-split#-e_1_3_2_2_2_1.2","doi-asserted-by":"crossref","unstructured":"K. Casel H. Fernau S. Gaspers B. Gras and M.L. Schmid. 2020. On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory of Computing Systems (2020). https:\/\/doi.org\/10.1007\/s00224-020--10013-w","DOI":"10.1007\/s00224-020-10013-w"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850116"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699442"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3351451"},{"key":"e_1_3_2_2_6_1","volume-title":"Proc. PODS'18","author":"Freydenberger D.","unstructured":"D. Freydenberger , B. Kimelfeld , and L. Peterfreund . 2018. Joining Extractions of Regular Expressions . In Proc. PODS'18 . 137--149. D. Freydenberger, B. Kimelfeld, and L. Peterfreund. 2018. Joining Extractions of Regular Expressions. In Proc. PODS'18. 137--149."},{"key":"e_1_3_2_2_7_1","volume-title":"29th Annual European Symposium on Algorithms, ESA 2021, September 6--8, 2021, Lisbon, Portugal (Virtual Conference). 45:1--45:16","author":"Ganardi Moses","year":"2021","unstructured":"Moses Ganardi . 2021 . Compression by Contracting Straight-Line Programs . In 29th Annual European Symposium on Algorithms, ESA 2021, September 6--8, 2021, Lisbon, Portugal (Virtual Conference). 45:1--45:16 . https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2021.45 10.4230\/LIPIcs.ESA.2021.45 Moses Ganardi. 2021. Compression by Contracting Straight-Line Programs. In 29th Annual European Symposium on Algorithms, ESA 2021, September 6--8, 2021, Lisbon, Portugal (Virtual Conference). 45:1--45:16. https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2021.45"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3457389"},{"key":"e_1_3_2_2_9_1","unstructured":"K. Goto S. Maruyama S. Inenaga H. Bannai H. Sakamoto and M. Takeda. 2011. Restructuring Compressed Texts without Explicit Decompression. CoRR abs\/1107.2729 (2011). http:\/\/arxiv.org\/abs\/1107.2729  K. Goto S. Maruyama S. Inenaga H. Bannai H. Sakamoto and M. Takeda. 2011. Restructuring Compressed Texts without Explicit Decompression. CoRR abs\/1107.2729 (2011). http:\/\/arxiv.org\/abs\/1107.2729"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.05.027"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.841160"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1515\/gcc-2012-0016"},{"key":"e_1_3_2_2_13_1","volume-title":"The Compressed Word Problem for Groups","author":"Lohrey M.","unstructured":"M. Lohrey . 2014. The Compressed Word Problem for Groups (Springer Briefs in Mathematics ed.). Springer . M. Lohrey. 2014. The Compressed Word Problem for Groups (Springer Briefs in Mathematics ed.). Springer."},{"key":"e_1_3_2_2_14_1","volume-title":"Proc. PODS'18","author":"Maturana F.","unstructured":"F. Maturana , C. Riveros , and D. Vrgoc . 2018. Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity . In Proc. PODS'18 . F. Maturana, C. Riveros, and D. Vrgoc. 2018. Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity. In Proc. PODS'18."},{"key":"e_1_3_2_2_15_1","volume-title":"Constant-delay enumeration algorithms for document spanners over nested documents. CoRR abs\/2010.06037","author":"Mu\u00f1oz Martin","year":"2020","unstructured":"Martin Mu\u00f1oz and Cristian Riveros . 2020. Constant-delay enumeration algorithms for document spanners over nested documents. CoRR abs\/2010.06037 ( 2020 ). arXiv:2010.06037 https:\/\/arxiv.org\/abs\/2010.06037 Martin Mu\u00f1oz and Cristian Riveros. 2020. Constant-delay enumeration algorithms for document spanners over nested documents. CoRR abs\/2010.06037 (2020). arXiv:2010.06037 https:\/\/arxiv.org\/abs\/2010.06037"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622776.1622780"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3294052.3319699"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00777-6"},{"key":"e_1_3_2_2_21_1","volume-title":"24th International Conference on Database Theory, ICDT 2021","author":"Markus","year":"2021","unstructured":"Markus L. Schmid and Nicole Schweikardt. 2021. A Purely Regular Approach to Non-Regular Core Spanners . In 24th International Conference on Database Theory, ICDT 2021 , March 23 --26 , 2021 , Nicosia, Cyprus. 4:1--4:19. https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2021.4 10.4230\/LIPIcs.ICDT.2021.4 Markus L. Schmid and Nicole Schweikardt. 2021. A Purely Regular Approach to Non-Regular Core Spanners. In 24th International Conference on Database Theory, ICDT 2021, March 23--26, 2021, Nicosia, Cyprus. 4:1--4:19. https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2021.4"},{"key":"e_1_3_2_2_22_1","volume-title":"PODS'21: Proceedings of the 40th ACM SIGMOD- SIGACT-SIGAI Symposium on Principles of Database Systems","author":"Markus","year":"2021","unstructured":"Markus L. Schmid and Nicole Schweikardt. 2021. Spanner Evaluation over SLP-Compressed Documents . In PODS'21: Proceedings of the 40th ACM SIGMOD- SIGACT-SIGAI Symposium on Principles of Database Systems , Virtual Event, China, June 20--25 , 2021 . 153--165. https:\/\/doi.org\/10.1145\/3452021.3458325 10.1145\/3452021.3458325 Markus L. Schmid and Nicole Schweikardt. 2021. Spanner Evaluation over SLP-Compressed Documents. In PODS'21: Proceedings of the 40th ACM SIGMOD- SIGACT-SIGAI Symposium on Principles of Database Systems, Virtual Event, China, June 20--25, 2021. 153--165. https:\/\/doi.org\/10.1145\/3452021.3458325"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/322344.322346"}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517804.3524158","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3517804.3524158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:04Z","timestamp":1750182544000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517804.3524158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,12]]},"references-count":22,"alternative-id":["10.1145\/3517804.3524158","10.1145\/3517804"],"URL":"https:\/\/doi.org\/10.1145\/3517804.3524158","relation":{},"subject":[],"published":{"date-parts":[[2022,6,12]]},"assertion":[{"value":"2022-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}