Which XML schemas are streaming bounded repairable?

DOI10.1007/S00224-015-9611-YzbMATH Open1352.68078OpenAlexW2085216072MaRDI QIDQ269345FDOQ269345

Authors: Pierre Bourhis, Gabriele Puppis, Cristian Riveros 

Publication date: 18 April 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-015-9611-y

Recommendations

• Bounded repairability for regular tree languages
• Bounded repairability of word languages
• Evolving schemas for streaming XML
• Rewriting-based repairing strategies for XML repositories
• scientific article; zbMATH DE number 1953123

zbMATH Keywords

bounded repairDTDstreaming repairtop-down deterministic tree automatonXML schema

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• One-unambiguous regular languages
• Automata, logics, and infinite games. A guide to current research
• The Cost of Traveling between Languages
• Deterministic top-down tree automata: past, present, and future
• Adding nesting structure to words
• Bounded repairability of word languages
• The Tree-to-Tree Correction Problem
• Title not available (Why is that?)
• The String-to-String Correction Problem
• Bounded repairability for regular tree languages
• Fundamentals of Computation Theory
• A survey on tree edit distance and related problems
• A relation between edit distance for ordered trees and edit distance for Euler strings
• Streaming tree automata

Cited In (5)

• Evolving schemas for streaming XML
• Rewriting-based repairing strategies for XML repositories
• Bounded repairability of word languages
• Repairing XML functional dependency violations
• Bounded repairability for regular tree languages

This page was built for publication: Which XML schemas are streaming bounded repairable?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269345)