Publication: Disjoint interval partitioning
Disjoint interval partitioning
Date
Date
Date
Citations
Cafagna, F., & Böhlen, M. H. (2017). Disjoint interval partitioning. The VLDB Journal, 26(3), 447–466. https://doi.org/10.1007/s00778-017-0456-7
Abstract
Abstract
Abstract
In databases with time interval attributes, query processing techniques that are based on sort-merge or sort-aggregate deteriorate. This happens because for intervals no total order exists and either the start or end point is used for the sorting. Doing so leads to inefficient solutions with lots of unproductive comparisons that do not produce an output tuple. Even if just one tuple with a long interval is present in the data, the number of unproductive comparisons of sort-merge and sort-aggregate gets quadratic. In this paper we prop
Additional indexing
Creators (Authors)
- Cafagna, Francesco
Volume
Volume
Volume
Number
Number
Number
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
Keywords
Scope
Scope
Scope
Language
Language
Language
Publication date
Publication date
Publication date
Date available
Date available
Date available
ISSN or e-ISSN
ISSN or e-ISSN
ISSN or e-ISSN
OA Status
OA Status
OA Status
Publisher DOI
Other Identification Number
Other Identification Number
Other Identification Number
Citations
Cafagna, F., & Böhlen, M. H. (2017). Disjoint interval partitioning. The VLDB Journal, 26(3), 447–466. https://doi.org/10.1007/s00778-017-0456-7
