I/O Optimal data structures for categorical range skyline queries
Document Type
Conference Proceeding
Publication Date
1-1-2019
Abstract
The skyline of a set of two-dimensional points is the subset of points which are not dominated by any other point. In this paper, we deal with two-dimensional points (in rank space) which are assigned an additional category, or color. The goal is to preprocess n points so that given a three-sided region of the form [a, b]×[T-] we can return the set of colors on the skyline of the queried region. We approach the problem in the external memory model and present an I/O optimal data structure requiring O(n log∗n) words of space.
Publication Source (Journal or Book title)
Proceedings of the 31st Canadian Conference on Computational Geometry, CCCG 2019
First Page
9
Last Page
16
Recommended Citation
Ganguly, A., Gibney, D., Shah, R., & Thankachan, S. (2019). I/O Optimal data structures for categorical range skyline queries. Proceedings of the 31st Canadian Conference on Computational Geometry, CCCG 2019, 9-16. Retrieved from https://repository.lsu.edu/eecs_pubs/2625
