Sciweavers

5 search results - page 1 / 1
» XPath Containment in the Presence of Disjunction, DTDs, and ...
Sort
View
CORR
2006
Springer
122views Education» more  CORR 2006»
13 years 4 months ago
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
Frank Neven, Thomas Schwentick
ICDT
2003
ACM
125views Database» more  ICDT 2003»
13 years 10 months ago
XPath Containment in the Presence of Disjunction, DTDs, and Variables
XPath is a simple language for navigating an XML tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various fragm...
Frank Neven, Thomas Schwentick
ICDT
2010
ACM
259views Database» more  ICDT 2010»
14 years 2 months ago
Forward-XPath and extended register automata on data-trees
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
Diego Figueira
SIGMOD
2004
ACM
198views Database» more  SIGMOD 2004»
14 years 4 months ago
Secure XML Querying with Security Views
The prevalent use of XML highlights the need for a generic, flexible access-control mechanism for XML documents that supports efficient and secure query access, without revealing ...
Wenfei Fan, Chee Yong Chan, Minos N. Garofalakis
ISSRE
2007
IEEE
13 years 6 months ago
Improving Constraint-Based Testing with Dynamic Linear Relaxations
Constraint-Based Testing (CBT) is the process of generating test cases against a testing objective by using constraint solving techniques. In CBT, testing objectives are given und...
Tristan Denmat, Arnaud Gotlieb, Mireille Ducass&ea...