External memory three-sided range reporting and top-k queries with sublogarithmic updates

Abstract: An external memory data structure is presented for maintaining a dynamic set of

N

two-dimensional points under the insertion and deletion of points, and supporting 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 < v a r e p s i l o n l e q f r a c 12

, a data structure is constructed that supports updates in amortized

O (f r a c 1 v a r e p s i l o n B^{1 - v a r e p s i l o n} l o g_{B} N)

IOs and queries in amortized

O (f r a c 1 v a r e p s i l o n l o g_{B} 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

B^{1 - v a r e p s i l o n}

improvement over the previous best update bounds for the two query problems, while staying within the same query and space bounds.

Recommendations

Cited in

(9)

This page was built for publication: External memory three-sided range reporting and top-\(k\) queries with sublogarithmic updates