Add to ORKGAnswering queries in a relational database model often requires the computation of joins of relations. Losslessness of joins is an important property for joins of relations to be semantically meaningful. In this paper we present an $O(n^{3})$ algorithm for testing losslessness of joins in relational databases with functional dependencies, which improves the $O(n^{4})$ result by Aho, Beeri and Ullman
Abstract. This study develops the foundation for a simple, yet ecient method for uncovering function...
The inference problem for data dependencies in relational databases is the problem of deciding wheth...
AbstractInferring functional relations from relational databases is important for the discovery of s...
There is a well-known algorithm for determining when a decomposition ˆ {R 1, R 2,...,R m} of a datab...
We revisit two fundamental problems in database theory. The join-dependency (JD) testing problem is ...
Databases contain information about which relationships do and do not hold among entities. To make t...
We present a simple conceptual framework to think about computing the relational join. Using this fr...
Join is the most important operator in relational databases, and remains the most expensive one desp...
National audienceIn this paper, we define a framework in order to deal with a broad class of data mi...
Evaluating the relational join is one of the central algorithmic and most well-studied problems in d...
Data Mining (DM) represents the process of extracting interesting and previously unknown knowledge f...
Most unary relational database operators can be described through functions from tuples to tuples. ...
AbstractIn relational databases, a query can be formulated in terms of a relational algebra expressi...
Efficient join processing is one of the most fundamental and well-studied tasks in database research...
Abstract. A join of two relations in real databases is usually much smaller than their Cartesian pro...
Abstract. This study develops the foundation for a simple, yet ecient method for uncovering function...
The inference problem for data dependencies in relational databases is the problem of deciding wheth...
AbstractInferring functional relations from relational databases is important for the discovery of s...
There is a well-known algorithm for determining when a decomposition ˆ {R 1, R 2,...,R m} of a datab...
We revisit two fundamental problems in database theory. The join-dependency (JD) testing problem is ...
Databases contain information about which relationships do and do not hold among entities. To make t...
We present a simple conceptual framework to think about computing the relational join. Using this fr...
Join is the most important operator in relational databases, and remains the most expensive one desp...
National audienceIn this paper, we define a framework in order to deal with a broad class of data mi...
Evaluating the relational join is one of the central algorithmic and most well-studied problems in d...
Data Mining (DM) represents the process of extracting interesting and previously unknown knowledge f...
Most unary relational database operators can be described through functions from tuples to tuples. ...
AbstractIn relational databases, a query can be formulated in terms of a relational algebra expressi...
Efficient join processing is one of the most fundamental and well-studied tasks in database research...
Abstract. A join of two relations in real databases is usually much smaller than their Cartesian pro...
Abstract. This study develops the foundation for a simple, yet ecient method for uncovering function...
The inference problem for data dependencies in relational databases is the problem of deciding wheth...
AbstractInferring functional relations from relational databases is important for the discovery of s...