73 search results - page 2 / 15 » Data Structures for Range Minimum Queries in Multidimensiona... |
ICDE
1999
IEEE
14 years 7 months ago
1999
IEEE
Storage management of multidimensional arrays aims at supporting the array model needed by applications and insuring fast execution of access operations. Current approaches to sto...
ISAAC
2005
Springer
13 years 11 months ago
2005
Springer
This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-topeer network. The SkipTree supports range quer...
DATESO
2009
13 years 3 months ago
2009
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
CORR
2010
Springer
13 years 17 days 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...
STACS
2012
Springer
12 years 1 months ago
2012
Springer
A mode of a multiset S is an element a ∈ S of maximum multiplicity; that is, a occurs at least as frequently as any other element in S. Given an array A[1 : n] of n elements, we...