Abstract
We consider answering queries over incomplete XML trees. Barceló et al. identified a class of shallow queries for which the problem is efficiently solvable with node ids on trees while it is coNP-complete without them. We show that their result is essentially tight. In other words, we provide a slightly extended class of queries where node ids help no more.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
