17 search results - page 2 / 4 » On Cartesian Trees and Range Minimum Queries |
CORR
2010
Springer
12 years 12 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
ICDCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Users and administrators of large distributed systems are frequently in need of monitoring and management of its various components, data items and resources. Though there exist s...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
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 ...
GIS
2005
ACM
14 years 6 months ago
2005
ACM
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...
FUN
2010
Springer
13 years 9 months ago
2010
Springer
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...