Add to ORKGWe study absolute and relative keys for XML, and investigate their associated decision problems. We argue that these keys are important to many forms of hierarchically structured data including XML documents. In contrast to other proposals of keys for XML, these keys can be reasoned about efficiently. We show that the (finite) satisfiability problem for these keys is trivial, and their (finite) implication problem is finitely axiomatizable and decidable in PTIME in the size of keys
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...
Building on a notion of keys for XML, we propose a novel indexing scheme for hierarchical data that ...
We study two classes of XML keys introduced in [6], and investigate their associated (finite) implic...
The increasing popularity of XML for persistent data storage, processing and exchange has triggered ...
We study two classes of XML keys introduced in [6], and investigate their associated (finite) implic...
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...
Abstract. Ongoing efforts in academia and industry to advance the management of XML data have create...
This dissertation investigates how constraints can be used to check the consistency of data being ex...
Abstract. Keys for XML data trees can uniquely identify nodes based on the data values on some of th...
AbstractBoundaries occur naturally in everyday life. This paper introduces numerical constraints int...
Due to the hierarchical structure and syntactic flexibility of XML, mining keys from XML data is a m...
Previous research shows that decision problem of XML keys is far more intricate than its relational ...
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...
Building on a notion of keys for XML, we propose a novel indexing scheme for hierarchical data that ...
We study two classes of XML keys introduced in [6], and investigate their associated (finite) implic...
The increasing popularity of XML for persistent data storage, processing and exchange has triggered ...
We study two classes of XML keys introduced in [6], and investigate their associated (finite) implic...
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...
Abstract. Ongoing efforts in academia and industry to advance the management of XML data have create...
This dissertation investigates how constraints can be used to check the consistency of data being ex...
Abstract. Keys for XML data trees can uniquely identify nodes based on the data values on some of th...
AbstractBoundaries occur naturally in everyday life. This paper introduces numerical constraints int...
Due to the hierarchical structure and syntactic flexibility of XML, mining keys from XML data is a m...
Previous research shows that decision problem of XML keys is far more intricate than its relational ...
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...
Building on a notion of keys for XML, we propose a novel indexing scheme for hierarchical data that ...