I/O-optimal categorical 3-sided skyline queries

Document Type

Article

Publication Date

12-6-2021

Abstract

The skyline of a set of two-dimensional points is the subset of points not dominated by any other point. In this paper, we consider a set of two-dimensional points (in rank space) that are assigned an additional category, or color. The goal is to preprocess these points so that given a three-sided region of the form [a,b]×[τ,∞] we can return the set of distinct colors on the skyline of the queried region. We approach this problem in the external memory model and present an I/O-optimal data structure that answers a query using [Formula presented] I/Os and requires O(nlog⁎⁡n) words of space, where n is the number of points, k is the size of the solution, and B is the block size. Additionally, we provide a space-time trade-off by presenting a data structure that answers a query using [Formula presented] I/Os and requires O(n) words of space.

Publication Source (Journal or Book title)

Theoretical Computer Science

First Page

132

Last Page

144

This document is currently not available here.

Share

COinS