Interval processing with the UB-tree

R Fenk, V Markl, R Bayer - Proceedings International Database …, 2002 - ieeexplore.ieee.org
Advanced data warehouses and Web databases have set the demand for processing large
sets of time ranges, quality classes, fuzzy data, personalized data and extended objects.
Since, all of these data types can be mapped to intervals, interval indexing can dramatically
speed up or even be an enabling technology for these new applications. We introduce a
method for managing intervals by indexing the dual space with the UB-Tree. We show that
our method is an effective and efficient solution, benefitting from all good characteristics of …

[PDF][PDF] Interval processing with the UB-Tree

V Markl, R Bayer - Citeseer
Advanced data warehouses and web databases have set the demand for processing large
sets of time ranges, quality classes, fuzzy data, personalized data and extended objects.
Since, all of these data types can be mapped to intervals, interval indexing can dramatically
speed up or even be an enabling technology for these new applications. We introduce a
method for managing intervals by indexing the dual space with the UB-Tree. We show that
our method is an effective and efficient solution, benefitting from all good characteristics of …
Showing the best results for this search. See all results