HIGHLIGHTS
- who: Wojciech Czerwiński and colleagues from the University of Warsaw, Warsaw, Poland have published the research work: Reasoning About Integrity Constraints for Tree-structured Data, in the Journal: (JOURNAL)
- what: Equivalently the authors show that validity and containment of unions of conjunctive queries using navigational axes labels data equalities and inequalities is decidable as long as none of the conjunctive queries uses both equalities and inequalities; without this restriction both problems are known to be undecidable. The authors examine the expressive power of non-mixing constraints further by comparing them to other existing formalisms . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.