Multidimensional data structures are applied in many areas, e.g. in data mining, indexing multimedia data and text documents, and so on. There are some applications where the range...
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
In this paper, we consider a special type of triangular range search for a planar point set S in the I/O-model. Here, two sides of the query triangle are parallel to the coordinat...