A normal form for XML documents
This article takes a first step towards the design and normalization theory for XML
documents. We show that, like relational databases, XML documents may contain redundant …
documents. We show that, like relational databases, XML documents may contain redundant …
Strong functional dependencies and their application to normal forms in XML
In this article, we address the problem of how to extend the definition of functional
dependencies (FDs) in incomplete relations to XML documents (called XFDs) using the well …
dependencies (FDs) in incomplete relations to XML documents (called XFDs) using the well …
EPC markup language (EPML): an XML-based interchange format for event-driven process chains (EPC)
J Mendling, M Nüttgens - Information systems and e-business …, 2006 - Springer
This article presents an XML-based interchange format for event-driven process chains
(EPC) that is called EPC markup language (EPML). EPML builds on EPC syntax related …
(EPC) that is called EPC markup language (EPML). EPML builds on EPC syntax related …
An online bibliography on schema evolution
E Rahm, PA Bernstein - ACM Sigmod Record, 2006 - dl.acm.org
An Online Bibliography on Schema Evolution Page 1 An Online Bibliography on Schema
Evolution Erhard Rahm Philip A. Bernstein University of Leipzig Microsoft Corporation rahm@informatik.uni-leipzig.de …
Evolution Erhard Rahm Philip A. Bernstein University of Leipzig Microsoft Corporation rahm@informatik.uni-leipzig.de …
A survey on mapping semi-structured data and graph data to relational data
The data produced by various services should be stored and managed in an appropriate
format for gaining valuable knowledge conveniently. This leads to the emergence of various …
format for gaining valuable knowledge conveniently. This leads to the emergence of various …
Relational database schema design for uncertain data
We investigate the impact of uncertainty on relational data\-base schema design.
Uncertainty is modeled qualitatively by assigning to tuples a degree of possibility with which …
Uncertainty is modeled qualitatively by assigning to tuples a degree of possibility with which …
The implication problem of data dependencies over SQL table definitions: axiomatic, algorithmic and logical characterizations
S Hartmann, S Link - ACM Transactions on Database Systems (TODS), 2012 - dl.acm.org
We investigate the implication problem for classes of data dependencies over SQL table
definitions. Under Zaniolo's “no information” interpretation of null markers we establish an …
definitions. Under Zaniolo's “no information” interpretation of null markers we establish an …
Closure via functional dependence simplification
In this paper, a method for computing the closure of a set of attributes according to a
specification of functional dependencies of the relational model is described. The main …
specification of functional dependencies of the relational model is described. The main …
The containment problem for real conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and
optimization. Under set semantics, the query-containment problem for conjunctive queries …
optimization. Under set semantics, the query-containment problem for conjunctive queries …
Semantic clustering of XML documents
A Tagarelli, S Greco - ACM Transactions on Information Systems (TOIS), 2010 - dl.acm.org
Dealing with structure and content semantics underlying semistructured documents is
challenging for any task of document management and knowledge discovery conceived for …
challenging for any task of document management and knowledge discovery conceived for …