Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
128
click to vote
CORR
2006
Springer
122
views
Education
»
more
CORR 2006
»
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
15 years 3 months ago
Download
ls1-www.cs.uni-dortmund.de
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
claim paper
Read More »