I/O-efficient planar range skyline and attrition priority queues

Abstract

We study the static and dynamic planar range skyline reporting problem in the external memory model with block size B, under a linear space budget. The problem asks for an O(n/B) space data structure that stores n points in the plane, and supports reporting the k maximal input points (a.k.a. skyline) among the points that lie within a givenone of its edges is grounded, two variants arise: topopen for β2 = ∞ and left-open for α1 = −∞ (symmetrically bottom-open and right-open) queries.We present optimal static data structures for top-open queries, for the cases where the universe is R 2 , a U × U grid, and rank space [O(n)] 2 . We also show that left-open queries are harder, as they require Ω((n/B) + k/B) I/Os for > 0, when only linear space is allowed. We show that the lower bound is tight, by a structure that supports 4-sided queries in matching complexities. Interestingly, these lower and upper bounds coincide with those of the planar orthogonal range reporting problem, i.e., the skyline requirement does not alter the problem difficulty at all! Finally, we present the first dynamic linear space data structure that supports top-open queries in O(log 2B n + k/B 1− ) and updates in O(log 2B n) worst case I/Os, for ∈ [0, 1]. This also yields a linear space data structure for 4-sided queries with optimal query I/Os and O(log(n/B)) amortized update I/Os. We consider of independent interest the main component of our dynamic structures, a new realtime I/O-efficient and catenable variant of the fundamental structure priority queue with attrition by Sundar. * The full version is found on http://arxiv.org under the same title.

Skyline Queries in O(1) time?

“…However, the modifications to support skyline queries are novel and non-trivial. The same problem (dynamic I/O-efficient range skyline reporting) but with worst case guarantees (logarithmic query I/Os, logarithmic amortized update I/Os and linear space) has been presented in [6].…”

Reporting and counting maximal points in a query orthogonal rectangle

“…Recently, Kejlberg-Rasmussen et al in [12] have studied the problem in the external memory model and have…”

DataGrinder: Fast, Accurate, Fully non-Parametric Classification Approach Using 2D Convex Hulls

“…Besides, we calculate the "constant" through probabilistic analysis, and our experiments show our calculated constant is reliable for different sizes of data. Database community has shown tremendous interest in solving problems formulated similar to convex hulls such as designing algorithms for finding Skylines [22,13,4].…”

“…Data mining topics such as classification [1,2,14,15,19,24,25,29], clustering [38,28,27,26,24,8,7,5,3], frequent pattern mining [37,36,11], frequent sub-structure mining [11,24], regression [21,20], data cleaning [18,8,1], ranking [6], data warehousing [5], recommender systems [23,16,10], bio-informatics [19], outlier detection [22,13,4], nearest neighbors [17,9] and social networks [31,32], have been widely discussed in data management and prediction.…”