Lineage-Aware Temporal Windows: Supporting Set Operations in Temporal-Probabilistic Databases

by   Katerina Papaioannou, et al.

In temporal-probabilistic (TP) databases, the combination of the temporal and the probabilistic dimension adds significant overhead to the computation of set operations. Although set queries are guaranteed to yield linearly sized output relations, existing solutions exhibit quadratic runtime complexity. They suffer from redundant interval comparisons and additional joins for the formation of lineage expressions. In this paper, we formally define the semantics of set operations in TP databases and study their properties. For their efficient computation, we introduce the lineage-aware temporal window, a mechanism that directly binds intervals with lineage expressions. We suggest the lineage-aware window advancer (LAWA) for producing the windows of two TP relations in linearithmic time, and we implement all TP set operations based on LAWA. By exploiting the flexibility of lineage-aware temporal windows, we perform direct filtering of irrelevant intervals and finalization of output lineage expressions and thus guarantee that no additional computational cost or buffer space is needed. A series of experiments over both synthetic and real-world datasets show that (a) our approach has predictable performance, depending only on the input size and not on the number of time intervals per fact or their overlap, and that (b) it outperforms state-of-the-art approaches in both temporal and probabilistic databases.


page 1

page 2

page 3

page 4


Generalized Lineage-Aware Temporal Windows: Supporting Outer and Anti Joins in Temporal-Probabilistic Databases

The result of a temporal-probabilistic (TP) join with negation includes,...

Swin-Free: Achieving Better Cross-Window Attention and Efficiency with Size-varying Window

Transformer models have shown great potential in computer vision, follow...

Content-Aware Convolutional Neural Networks

Convolutional Neural Networks (CNNs) have achieved great success due to ...

An Integrated First-Order Theory of Points and Intervals over Linear Orders (Part II)

There are two natural and well-studied approaches to temporal ontology a...

Efficient Approximation of Certain and Possible Answers for Ranking and Window Queries over Uncertain Data (Extended version)

Uncertainty arises naturally inmany application domains due to, e.g., da...

Parallel Chen-Han (PCH) Algorithm for Discrete Geodesics

In many graphics applications, the computation of exact geodesic distanc...

Time-Aware Q-Networks: Resolving Temporal Irregularity for Deep Reinforcement Learning

Deep Reinforcement Learning (DRL) has shown outstanding performance on i...

Please sign up or login with your details

Forgot password? Click here to reset