Schema Validation via Streaming Circuits

Filip Murlak (1) , Charles Paperman (1, 2) , Michał Pilipczuk (1)

1 UW - University of Warsaw
2 CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189

XML schema validation can be performed in constant memory in the streaming model if and only if the schema admits only trees of bounded depth - an acceptable assumption from the practical view-point. In this paper we refine this analysis by taking into account that data can be streamed block-by-block, rather then letter-by-letter, which provides opportunities to speed up the computation by parallelizing the processing of each block. For this purpose we introduce the model of streaming circuits, which process words of arbitrary length in blocks of fixed size, passing constant amount of information between blocks. This model allows us to transfer fundamental results about the circuit complexity of regular languages to the setting of streaming schema validation, which leads to effective constructions of streaming circuits of depth logarithmic in the block size, or even constant under certain assumptions on the input schema. For nested-relational DTDs, a practically motivated class of bounded-depth XML schemas, we provide an efficient construction yielding constant-depth streaming circuits with particularly good parameters.

Mots clés: semi-structured data; XML; streaming; schema validation; Boolean circuits; nested-relational DTDs

Domaines: Informatique [cs]

Filip Murlak, Charles Paperman, Michał Pilipczuk. Schema Validation via Streaming Circuits. 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS '16), 2016, San Francisco, CA, United States. pp.237-249, ⟨10.1145/2902251.2902299⟩. ⟨hal-02126626⟩