The result of a temporal-probabilistic (TP) join with negation includes, at each time point, the probability with which a tuple of a positive relation p matches none of the tuples in a negative relation n, for a given join condition θ. For the computation of TP joins with negation, we introduce generalized lineage-aware temporal windows, a mechanism that binds an interval to the lineages of all the matching valid tuples of each input relation. We compute these windows in an incremental manner, and we show that pipelined computations allow for the direct integration of our approach into PostgreSQL. We thereby alleviate the prevalent redundancies in the interval computations of existing approaches, which is proven by an extensive experimental...
This paper shows that any non-repeating conjunctive rela-tional query with negation has either polyn...
This article charts the tractability frontier of two classes of relational algebra queries in tuple-...
Dyreson and Snodgrass have drawn attention to the fact that in many temporal database applications, ...
The result of a temporal-probabilistic (TP) join with negation includes, at each time point, the pro...
In temporal-probabilistic (TP) databases, the combination of the temporal and the probabilistic dime...
Joins are arguably the most important relational operators. Poor implementations are tantamount to c...
We develop a family of efficient plane-sweeping interval join algorithms for evaluating a wide range...
Probabilistic databases store, query, and manage large amounts of uncertain information. This thesis...
Interval-based temporal data model is a popular data model in temporal data-bases. It uses time inte...
Interval-based temporal data model is a popular data model in temporal databases. It uses time inter...
There is a vast class of applications in which we know that a certain event occurred, but do not kn...
In order to process interval timestamped data, the sequenced semantics has been proposed. This paper...
Abstract. Probabilistic Databases (PDBs) lie at the expressive inter-section of databases, first-ord...
To appear in SIGMOD'16We study a particular kind of join, coined Ranked Temporal Join (RTJ), featuri...
Dyreson and Snodgrass have drawn attention to the fact that, in many temporal database appli-cations...
This paper shows that any non-repeating conjunctive rela-tional query with negation has either polyn...
This article charts the tractability frontier of two classes of relational algebra queries in tuple-...
Dyreson and Snodgrass have drawn attention to the fact that in many temporal database applications, ...
The result of a temporal-probabilistic (TP) join with negation includes, at each time point, the pro...
In temporal-probabilistic (TP) databases, the combination of the temporal and the probabilistic dime...
Joins are arguably the most important relational operators. Poor implementations are tantamount to c...
We develop a family of efficient plane-sweeping interval join algorithms for evaluating a wide range...
Probabilistic databases store, query, and manage large amounts of uncertain information. This thesis...
Interval-based temporal data model is a popular data model in temporal data-bases. It uses time inte...
Interval-based temporal data model is a popular data model in temporal databases. It uses time inter...
There is a vast class of applications in which we know that a certain event occurred, but do not kn...
In order to process interval timestamped data, the sequenced semantics has been proposed. This paper...
Abstract. Probabilistic Databases (PDBs) lie at the expressive inter-section of databases, first-ord...
To appear in SIGMOD'16We study a particular kind of join, coined Ranked Temporal Join (RTJ), featuri...
Dyreson and Snodgrass have drawn attention to the fact that, in many temporal database appli-cations...
This paper shows that any non-repeating conjunctive rela-tional query with negation has either polyn...
This article charts the tractability frontier of two classes of relational algebra queries in tuple-...
Dyreson and Snodgrass have drawn attention to the fact that in many temporal database applications, ...