Add to ORKGWe study two classes of XML keys introduced in [6], and investigate their associated (finite) implication problems. In contrast to other proposals of keys for XML, these two classes of keys can be reasoned about efficiently. In particular, we show that their (finite) implication problems are finitely axiomatizable and are decidable in square time and cubic time, respectively
A great deal of research into the learning of schemas from XML data has been conducted in recent yea...
This dissertation investigates how constraints can be used to check the consistency of data being ex...
We introduce soft cardinality constraints which need to be satisfied on average only, and thus permi...
We study two classes of XML keys introduced in [6], and investigate their associated (finite) implic...
We study absolute and relative keys for XML, and investigate their associated decision problems. We ...
The increasing popularity of XML for persistent data storage, processing and exchange has triggered ...
Abstract. We review key constraints in the context of XML as intro-duced by Buneman et al. We show t...
Abstract. Keys are fundamental for database management, indepen-dently of the particular data model ...
Constraints are important for a variety of XML recommen-dations and applications. Consequently, ther...
AbstractBoundaries occur naturally in everyday life. This paper introduces numerical constraints int...
Previous research shows that decision problem of XML keys is far more intricate than its relational ...
Abstract. Keys for XML data trees can uniquely identify nodes based on the data values on some of th...
Due to the hierarchical structure and syntactic flexibility of XML, mining keys from XML data is a m...
Abstract. Ongoing efforts in academia and industry to advance the management of XML data have create...
A great deal of research into the learning of schemas from XML data has been conducted in recent yea...
A great deal of research into the learning of schemas from XML data has been conducted in recent yea...
This dissertation investigates how constraints can be used to check the consistency of data being ex...
We introduce soft cardinality constraints which need to be satisfied on average only, and thus permi...
We study two classes of XML keys introduced in [6], and investigate their associated (finite) implic...
We study absolute and relative keys for XML, and investigate their associated decision problems. We ...
The increasing popularity of XML for persistent data storage, processing and exchange has triggered ...
Abstract. We review key constraints in the context of XML as intro-duced by Buneman et al. We show t...
Abstract. Keys are fundamental for database management, indepen-dently of the particular data model ...
Constraints are important for a variety of XML recommen-dations and applications. Consequently, ther...
AbstractBoundaries occur naturally in everyday life. This paper introduces numerical constraints int...
Previous research shows that decision problem of XML keys is far more intricate than its relational ...
Abstract. Keys for XML data trees can uniquely identify nodes based on the data values on some of th...
Due to the hierarchical structure and syntactic flexibility of XML, mining keys from XML data is a m...
Abstract. Ongoing efforts in academia and industry to advance the management of XML data have create...
A great deal of research into the learning of schemas from XML data has been conducted in recent yea...
A great deal of research into the learning of schemas from XML data has been conducted in recent yea...
This dissertation investigates how constraints can be used to check the consistency of data being ex...
We introduce soft cardinality constraints which need to be satisfied on average only, and thus permi...