Publication: Supporting Set Operations in Temporal-Probabilistic Databases
Supporting Set Operations in Temporal-Probabilistic Databases
Date
Date
Date
Citations
Papaioannou, K., Theobald, M., & Böhlen, M. (2018). Supporting Set Operations in Temporal-Probabilistic Databases. 1180–1191. https://doi.org/10.1109/ICDE.2018.00109
Abstract
Abstract
Abstract
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, all of the existing solutions exhibit a quadratic runtime complexity. They suffer from redundant interval comparisons and additional joins for the formation of lineage expressions. In this paper, we formally define TP set operations and study their properties. For their efficient computation
Metrics
Downloads
Views
Additional indexing
Creators (Authors)
- Papaioannou, Katerina
- Theobald, Martin
- Böhlen, Michael
Event Title
Event Title
Event Title
Event Location
Event Location
Event Location
Event Country
Event Country
Event Country
Event Start Date
Event Start Date
Event Start Date
Event End Date
Event End Date
Event End Date
Publisher
Publisher
Publisher
Page range/Item number
Page range/Item number
Page range/Item number
Page end
Page end
Page end
Item Type
Item Type
Item Type
In collections
Dewey Decimal Classifikation
Dewey Decimal Classifikation
Dewey Decimal Classifikation
Scope
Scope
Scope
Language
Language
Language
Date available
Date available
Date available
OA Status
OA Status
OA Status
Publisher DOI
Other Identification Number
Other Identification Number
Other Identification Number
Metrics
Downloads
Views
Citations
Papaioannou, K., Theobald, M., & Böhlen, M. (2018). Supporting Set Operations in Temporal-Probabilistic Databases. 1180–1191. https://doi.org/10.1109/ICDE.2018.00109
