External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates
نویسنده
چکیده
An external memory data structure is presented for maintaining a dynamic set ofN two-dimensional points under the insertion and deletion of points, and supporting unsorted 3-sided range reporting queries and top-k queries, where top-k queries report the k points with highest y-value within a given x-range. For any constant 0 < ε ≤ 1 2 , a data structure is constructed that supports updates in amortized O( 1 εB1−ε logB N) IOs and queries in amortized O( 1 ε logB N + K/B) IOs, where B is the external memory block size, and K is the size of the output to the query (for top-k queries K is the minimum of k and the number of points in the query interval). The data structure uses linear space. The update bound is a significant factor B1−ε improvement over the previous best update bounds for these two query problems, while staying within the same query
منابع مشابه
Shared-Constraint Range Reporting
Orthogonal range reporting is one of the classic and most fundamental data structure problems. (2,1,1) query is a 3 dimensional query with two-sided constraint on the first dimension and one sided constraint on each of the 2nd and 3rd dimension. Given a set of N points in three dimension, a particular formulation of such a (2, 1, 1) query (known as four-sided range reporting in threedimension) ...
متن کاملDynamic Data Structures: Orthogonal Range Queries and Update Efficiency
English) We study dynamic data structures for different variants of orthogonal range reporting query problems. In particular, we consider (1) the planar orthogonal 3-sided range reporting problem: given a set of points in the plane, report the points that lie within a given 3-sided rectangle with one unbounded side, (2) the planar orthogonal range maxima reporting problem: given a set of points...
متن کاملI/O-Efficient Top-k Range Reporting with Logarithmic Update Cost∗
In the top-k range reporting problem, the input set S consists of n points in the real domain, each of which is associated with a distinct real-valued score. Given an interval q = [x1, x2] and an integer k ∈ [1, n], a query returns the k points in q having the largest scores. Specially, if q covers less than k points of S, all of them are returned. We want to store S in a dynamic structure so t...
متن کاملOptimal Planar Range Skyline Reporting with Linear Space in External Memory
Let P be a set of n points in R. Given a rectangle Q = [α1, α2] × [β1, β2], a range skyline query returns the maxima of the points in P ∩Q. An important variant is the so-called topopen queries, where Q is a 3-sided rectangle whose upper edge is grounded at y = ∞ (that is, β2 = ∞). These queries are crucial in numerous database applications. In internal memory, extensive research has been devot...
متن کاملDynamic Planar Range Maxima Queries
We consider the dynamic two-dimensional maxima query problem. Let P be a set of n points in the plane. A point is maximal if it is not dominated by any other point in P . We describe two data structures that support the reporting of the t maximal points that dominate a given query point, and allow for insertions and deletions of points in P . In the pointer machine model we present a linear spa...
متن کامل