Abstract
Assume that a database stores a set of intervals associatedwith types and weights. Typed intervals enrich the datarepresentation and support applications involving differentkinds of intervals. Given a query time and type, the systemreportskintervals that intersect the time, contain the typeand have the largest weight. We develop a new structure tomanage typed intervals based on the standard interval treeand propose efficient query algorithms. Experiments withsynthetic datasets are conducted to verify the performanceadvantage of our solution over alternative methods
Originalsprog | Engelsk |
---|---|
Titel | Proceedings of the 19th International Conference on Extending Database Technology, EDBT 2016, Bordeaux, France, March 15-16, 2016, Bordeaux, France, March 15-16, 2016 |
Redaktører | Evaggelia Pitoura, Sofian Maabout, Georgia Koutrika, Amélie Marian, Letizia Tanca, Ioana Manolescu, Kostas Stefanidis |
Antal sider | 2 |
Forlag | OpenProceedings.org |
Publikationsdato | 2016 |
Sider | 658-659 |
ISBN (Elektronisk) | 9783893180707 |
DOI | |
Status | Udgivet - 2016 |
Udgivet eksternt | Ja |