Checking determinism of XML Schema content models in optimal time

Kilpeläinen, Pekka

doi:10.1016/j.is.2010.10.001

Cited by 18 publications

(11 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently it was proved that even in the presence of numeric occurrence indicators (as used in XML Schema), determinism of expressions can be tested in time O(σ|e|) [18]. We show that our result extends to this case: even in the presence of numeric occurrence indicators we can decide determinism in time O(|e|).…”

Section: Introductionsupporting

confidence: 50%

“…This improves upon the complexity O(σ|e|) from [18], where σ = |Σ|. Actually, in Theorem 3.3 from [18], the complexity is stated as n 2 /(log(n)), with n representing the size of the binary representation of the regular expression.…”

Section: Testing Numeric Occurrencesmentioning

confidence: 91%

“…Actually, in Theorem 3.3 from [18], the complexity is stated as n 2 /(log(n)), with n representing the size of the binary representation of the regular expression. But with our notations, this translates into a quadratic O(σ|e|).…”

Section: Testing Numeric Occurrencesmentioning

confidence: 99%

See 2 more Smart Citations

Deterministic regular expressions in linear time

Groz

Maneth

Staworko

2012

Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

View full text Add to dashboard Cite

Deterministic regular expressions are widely used in XML processing. For instance, all regular expressions in DTDs and XML Schemas are required to be deterministic. In this paper we show that determinism of a regular expression e can be tested in linear time. The best known algorithms, based on the Glushkov automaton, require O(σ|e|) time, where σ is the number of distinct symbols in e. We further show that matching a word w against an expression e can be achieved in combined linear time O(|e| + |w|), for a wide range of deterministic regular expressions: (i) star-free (for multiple input words), (ii) bounded-occurrence, i.e., expressions in which each symbol appears a bounded number of times, and (iii) bounded plus-depth, i.e., expressions in which the nesting depth of alternating plus (union) and concatenation symbols is bounded. Our algorithms use a new structural decomposition of the parse tree of e. For matching arbitrary deterministic regular expressions we present an O(|e| + |w| log log |e|) time algorithm.

show abstract

Section: Introductionsupporting

confidence: 50%

Section: Testing Numeric Occurrencesmentioning

confidence: 91%

See 1 more Smart Citation

Deterministic regular expressions in linear time

Groz

Maneth

Staworko

2012

Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

View full text Add to dashboard Cite

show abstract

“…Determinism. To determine whether a standard RE is deterministic, Brüggemann-Klein [13] gave an O(|Σ E ||E|) time algorithm, where |Σ E | is the set of distinct symbols in E. For REs with counting, Kilpeläinen [22] presented an O(|Σ E ||E|) time algorithm by examining the marked expression. Chen and Lu [15] investigated algorithms that check the determinism of the input standard RE and provide diagnostic information if the expression is not deterministic, they also gave an O(|Σ E ||E|) time algorithm for checking determinism of REs with counting [16].…”

Section: Introductionmentioning

confidence: 99%

Practical Study of Deterministic Regular Expressions from Large-scale XML and Schema Data

Chu

Mou

et al. 2018

Proceedings of the 22nd International Database Engineering &Amp; Applications Symposium on - IDEAS 2018

View full text Add to dashboard Cite

Regular expressions are a fundamental concept in computer science and widely used in various applications. In this paper we focused on deterministic regular expressions (DREs). Considering that researchers didn't have large datasets as evidence before, we first harvested a large corpus of real data from the Web then conducted a practical study to investigate the usage of DREs. One feature of our work is that the data set is sufficiently large compared with previous work, which is obtained using several data collection strategies we proposed. The results show more than 98% of expressions in Relax NG are DRE, and more than 56% of expressions from RegExLib are DRE, while both Relax NG and RegExLib do not have the determinism constraint. These observations indicate that DREs are commonly used in practice. The results also show further study of subclasses of DREs is necessary. As far as we know, we are the first to analyze the determinism and the subclasses of DREs of Relax NG and RegExLib, and give these results. Furthermore, we give some discussions and applications of the data set. We obtain a DRE data set from the original data, which will be useful in practice and it has value in its own right. We find current research in new subclasses of DREs is insufficient, therefore it is necessary to do further study. We also analyze the referencing relationships among XSDs and define SchemaRank, which can be used in XML Schema design.

show abstract

“…Determinism for expressions with counters seems to pose more challenges than without the counting operator. For example, already testing whether an expression with counters is deterministic is non-trivial [18].…”

Section: Introductionmentioning

confidence: 99%

Deciding Definability by Deterministic Regular Expressions

Czerwiński

David²,

Losemann

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We investigate the complexity of deciding whether a given regular language can be defined with a deterministic regular expression. Our main technical result shows that the problem is PSPACE-complete if the input language is represented as a regular expression or nondeterministic finite automaton. The problem becomes EXPSPACE-complete if the language is represented as a regular expression with counters.

show abstract

Checking determinism of XML Schema content models in optimal time

Cited by 18 publications

References 20 publications

Deterministic regular expressions in linear time

Deterministic regular expressions in linear time

Practical Study of Deterministic Regular Expressions from Large-scale XML and Schema Data

Deciding Definability by Deterministic Regular Expressions

Contact Info

Product

Resources

About