Satisfiability of XPath Expressions

Hidders, Jan

doi:10.1007/978-3-540-24607-7_3

Cited by 60 publications

(72 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Taken together, these results and the previous work [2,13,15,17] provide a detailed treatment of the satisfiability analysis for a large number of XPath fragments commonly found in practice, in a variety of DTD settings.…”

Section: Introductionsupporting

confidence: 59%

“…The satisfiability problem has been studied for a large number of XPath fragments [2,13,15,17], in the presence and in the absence of DTDs. The previous work has mostly focused on XPath queries with only vertical modalities We establish lower and upper bounds for the satisfiability analysis in these settings, which range from NLOGSPACE to undecidable.…”

Section: Introductionmentioning

confidence: 99%

“…The satisfiability problem has been studied in [2,13,15,17]. Complexity bounds were provided in [2] for various XPath fragment under a variety of DTDs.…”

Section: Introductionmentioning

confidence: 99%

“…The XPath queries considered in [15] are basically tree patterns with node equality, inequality and limited use of data joins; neither negation nor sibling axes were considered there; furthermore, DTDs were restricted to be non-recursive disjunction-free in [15]. In the absence of DTDs, [13] studied the satisfiability problem for XPath without negation and data-value joins. From the results of [2], we already know that these bounds do not hold in the presence of DTDs.…”

Section: Introductionmentioning

confidence: 99%

“…From the results of [2], we already know that these bounds do not hold in the presence of DTDs. In particular, [13] gave PTIME bounds for XPath fragments with qualifiers, sibling axes, upward axes, and a root test in the absence of DTDs. We show that in the presence of DTDs, the problem is NP-hard, and we give PTIME bounds in the absence of qualifiers, and in the presence of sibling, upward axes and DTDs.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Satisfiability of XPath Queries with Sibling Axes

Geerts

Fan

2005

Database Programming Languages

View full text Add to dashboard Cite

Abstract. We study the satisfiability problem for XPath fragments supporting the following-sibling and preceding-sibling axes. Although this problem was recently studied for XPath fragments without sibling axes, little is known about the impact of the sibling axes on the satisfiability analysis. To this end we revisit the satisfiability problem for a variety of XPath fragments with sibling axes, in the presence of DTDs, in the absence of DTDs, and under various restricted DTDs. In these settings we establish complexity bounds ranging from NLOGSPACE to undecidable. Our main conclusion is that in many cases, the presence of sibling axes complicates the satisfiability analysis. Indeed, we show that there are XPath satisfiability problems that are in PTIME and PSPACE in the absence of sibling axes, but that become NP-hard and EXPTIME-hard, respectively, when sibling axes are used instead of the corresponding vertical modalities (e.g., the wildcard and the descendant axis).

show abstract

Section: Introductionsupporting

confidence: 59%

Section: Introductionmentioning

confidence: 99%

“…The satisfiability problem has been studied in [2,13,15,17]. Complexity bounds were provided in [2] for various XPath fragment under a variety of DTDs.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Satisfiability of XPath Queries with Sibling Axes

Geerts

Fan

2005

Database Programming Languages

View full text Add to dashboard Cite

show abstract

Automatic property-based testing and path validation of XQuery programs

Almendros-Jiménez

Becerra-Terón

2017

Softw. Test. Verif. Reliab.

View full text Add to dashboard Cite

Property-based testing has gained popularity in recent years in many areas of software development. The specification of assertions/properties helps to understand the semantics of pieces of code, and in modern programming environments, it can serve to test the program behavior. In this paper an XQuery property-based testing tool is presented, which enables to automatically test XQuery programs. The tool is able to systematically generate XML instances (i.e., test cases) from a given XML schema, and to filter XML instances with input properties specified by the programmer. Additionally, the tool automatically checks output (respectively, input-output) properties in each output instance (respectively, each pair of input-output instances). The tool is able to report whether the XQuery program passes the test, that is, if all the test cases satisfy the (input-)output property, as well as the number of test cases used for testing. In addition, if the XQuery program fails the test, the tool shows counterexamples found in the test cases. Properties are specified with XQuery Boolean functions, and the testing tool has been implemented in XQuery. Additionally, an XQuery path validation tool is presented. This tool is able to detect wrong paths in XQuery expressions. The path validation tool takes as input an XML schema, and it reports those paths on the XQuery program that do not match the XML schema. The path validation tool is a complement to the testing tool rejecting XQuery programs that do not conform to the XML schema. The path validation tool has been also implemented in XQuery. Finally, a web tool has been developed enabling to test and validate XQuery programs.

show abstract

Finite Segmentation for XML Caching

Türling

Böttcher

Mobile Information Systems

View full text Add to dashboard Cite

XML data processing often relies on basic relations between two XML fragments like containment, subset, difference and intersection. Fast calculation of such relations based only on the representing XPath expression is known to be a major challenge. Recently XML patterns have been introduced to model and identify handy subclasses of XPath. We present the concept of ST-pattem segments that uses sets of adapted tree pattems in order to describe a finite and complete partitioning of the XML document's data space. Based on such segmentations, we present a fast evaluation of XML relations and show how to compute a set of pattems for an optimal segmentation based on frequent XPath queries.

show abstract

Satisfiability of XPath Expressions

Cited by 60 publications

References 11 publications

Satisfiability of XPath Queries with Sibling Axes

Satisfiability of XPath Queries with Sibling Axes

Automatic property-based testing and path validation of XQuery programs

Finite Segmentation for XML Caching

Contact Info

Product

Resources

About