Efficient inclusion checking for deterministic tree automata and XML schemas

被引：11
|
作者：
Champavere, Jerome [1 ,2 ]
Gilleron, Remi [1 ,2 ]
Lemay, Aurelien [1 ,2 ]
Niehren, Joachim [1 ]
机构：
[1] Inria Lille Nord Europe, Parc Sci Haute Borne, F-59650 Villeneuve Dascq, France
[2] Univ Lille, Lab Informat Fondamentale Lille, Lille, France
来源：
INFORMATION AND COMPUTATION | 2009年 / 207卷 / 11期
关键词：
Tree automata; Language inclusion; Algorithmic complexity; XML schemas; COMPLEXITY;
D O I：
10.1016/j.ic.2009.03.003
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present algorithms for testing language inclusion L(A) subset of L(B) between tree automata in time O(vertical bar A vertical bar . vertical bar B vertical bar) where B is deterministic (bottom-up or top-down). We extend our algorithms for testing inclusion of automata for unranked trees A in deterministic DTDs or deterministic EDTDs with restrained competition D in time O(vertical bar A vertical bar . vertical bar Sigma vertical bar . vertical bar D vertical bar). Previous algorithms were less efficient or less general. (C) 2009 Elsevier Inc. All rights reserved.
引用
收藏
页码：1181 / 1208
页数：28
相关论文
共 50 条
  • [1] Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
    Champavere, Jerome
    Gilleron, Remi
    Lemay, Aurelien
    Niehren, Joachim
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2008, 5196 : 184 - 195
  • [2] Using regular tree automata as XML schemas
    Chidlovskii, B
    [J]. IEEE ADVANCES IN DIGITAL LIBRARIES 2000, PROCEEDINGS, 2000, : 89 - 98
  • [3] On the minimization of XML Schemas and tree automata for unranked trees
    Martens, Wim
    Niehren, Joachim
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2007, 73 (04) : 550 - 583
  • [4] Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata
    Holik, Lukas
    Lengal, Ondrej
    Simacek, Jiri
    Vojnar, Tomas
    [J]. AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, 2011, 6996 : 243 - 258
  • [5] Active XML schema containment checking based on tree automata theory
    Ma, Haitao
    Hao, Zhongxiao
    Zhou, Yinghui
    [J]. 2007 CIT: 7TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY, PROCEEDINGS, 2007, : 11 - +
  • [6] Efficient implementation for deterministic finite tree automata minimization
    [J]. Guellouma, Younes (y.guellouma@mail.lagh-univ.dz), 1600, University of Zagreb, Faculty of Political Sciences (24):
  • [7] A FAST ALGORITHM FOR CHECKING THE INCLUSION FOR VERY SIMPLE DETERMINISTIC PUSHDOWN-AUTOMATA
    WAKATSUKI, M
    TOMITA, E
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1993, E76D (10) : 1224 - 1233
  • [8] Processing XML streams with deterministic automata
    Green, TJ
    Miklau, G
    Onizuka, M
    Suciu, D
    [J]. DATABASE THEORY ICDT 2003, PROCEEDINGS, 2003, 2572 : 173 - 189
  • [9] On Minimizing Deterministic Tree Automata
    Cleophas, Loek
    Kourie, Derrick C.
    Strauss, Tinus
    Watson, Bruce W.
    [J]. PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2009, 2009, : 173 - 182
  • [10] Schemas for Safe and Efficient XML Processing
    Colazzo, Dario
    Ghelli, Giorgio
    Sartiani, Carlo
    [J]. IEEE 27TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2011), 2011, : 1378 - +
12345