The present paper investigates the dynamic complexity of document spanners, a formal framework for information extraction introduced by Fagin, Kimelfeld, Reiss, and Vansummeren (JACM 2015). We first look at the class of regular spanners and prove that any regular spanner can be maintained in the dynamic complexity class DynPROP. This result follows from work done previously on the dynamic complexity of formal languages by Gelade, Marquardt, and Schwentick (TOCL 2012). To investigate core spanners we use SpLog, a concatenation logic that exactly captures core spanners. We show that the dynamic complexity class DynCQ, is more expressive than SpLog and therefore can maintain any core spanner. This result is then extended to show that DynFO can maintain any generalized core spanner and that DynFO is at least as powerful as SpLog with negation.

翻译：本文件调查了文件打包员的动态复杂性,这是Fagin、Kimelfeld、Reiss和Vansummeren(JACM 2015年)推出的信息提取正式框架,我们首先审视正常打包员的级别,并证明任何正常打包员都可以在动态复杂等级DynPROP中保持。这是Gelade、Marquardt和Schwentick(TOCL 2012年)先前就正式语言的动态复杂性所做工作的结果。为了调查核心打包员,我们使用了SpLog(一种精确捕捉核心打包员的拼拼逻辑),我们展示了动态复杂等级DynCQ(DynCQ)比SpLog(SpLog)更直观,因此可以维持任何核心打包员。这个结果随后被扩展,以表明DynFO(DynFO)可以保存任何通用的核心打包员,DynFO至少像SpLog(Splog)一样强大。