University of Lübeck, Institute of Information Systems, www.ifis.uni-luebeck.de
Implemented by Khaled Haj-Yahya (khaled.h at gmx.de)
Supervised by B.C.Hammerschmidt (former)
This is a Java implementation of the theoretical work of
Gerome Miklau and Dan Suciu (Containment and Equivalence
for a Fragment of XPath. J. ACM 51(1): 2-45 (2004) and Containment
and Equivalence for a Fragment of XPath. PODS 2002)
Enter two XPath expressions in the abbreviated syntax and press the button.
if p = /a[b] and p' = /a[*]
the algorithm will detect that p is a subset of p'.
Or if p = /a//*/b and p' = /a/*//b
the algorithm will detect that p is equal to p'
because the subset equation holds in both directions.
Download the Java Source Code
Download Khaled's bachelor thesis (in German)
If there is no application on the right side please contact
our system administrator.