5 citations · 15 across the 12 of their papers we have counts for
5 papers · 1 filter
Lineage-Aware Temporal Windows: Supporting Set Operations in Temporal-Probabilistic Databases
Katerina Papaioannou, Martin Theobald, Michael H. Böhlen
In temporal-probabilistic (TP) databases, the combination of the temporal and the probabilistic dimension adds significant overhead to the computation of set operations. Although s…
Generalized Lineage-Aware Temporal Windows: Supporting Outer and Anti Joins in Temporal-Probabilistic Databases
Katerina Papaioannou, Martin Theobald, Michael Böhlen
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 matches none of the…
A General Framework for Anytime Approximation in Probabilistic Databases
Maarten Van den Heuvel, Floris Geerts, Wolfgang Gatterbauer +1
Anytime approximation algorithms that compute the probabilities of queries over probabilistic databases can be of great use to statistical learning tasks. Those approaches have bee…
Learning Tuple Probabilities
Maximilian Dylla, Martin Theobald
Learning the parameters of complex probabilistic-relational models from labeled training data is a standard technique in machine learning, which has been intensively studied in the…
Distributed Processing of Generalized Graph-Pattern Queries in SPARQL 1.1
Sairam Gurajada, Martin Theobald
We propose an efficient and scalable architecture for processing generalized graph-pattern queries as they are specified by the current W3C recommendation of the SPARQL 1.1 "Query…