Identifying XML Schema Constraints Using Temporal Logic
| Autor: | Zongyan Qiu, Ruifang Zhao, Ke Liu, Hongli Yang |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Document Structure Description
Theoretical computer science Computer science Schematron Semi-structured model Database schema XML validation computer.software_genre XML Schema Editor Star schema ComputingMethodologies_DOCUMENTANDTEXTPROCESSING XML schema Data mining computer computer.programming_language |
| Zdroj: | Dependable Software Engineering: Theories, Tools, and Applications ISBN: 9783319476766 SETTA |
| DOI: | 10.1007/978-3-319-47677-3_9 |
| Popis: | Twig pattern minimization is an important aspect of XML query optimization. During the minimizing process, it usually needs to take advantage of the constraints of XML Schema. The traditional methods for identifying constraints is to develop corresponding algorithms based on the type of constraints. It is inflexible because the constraints may be changed as new Twig pattern optimizing rules are found. Since the constraints of XML Schema mainly depict the sequence relationship of nodes, it is natural to be described by temporal logic. Based on the recognition, this paper proposes a method of identifying XML Schema constraints using temporal logic. Concretely, an XML Schema is modeled as a graph. In order to easily represent constraints related to parent and ancestor nodes, we made some modifications to Computational Tree Logic(CTL) with backward temporal operators, and developed model checking algorithms for automatically identifying XML Schema constraints. Compared with traditional methods, our method is more flexibility. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|