Sciweavers

25 search results - page 3 / 5
» Linear-Space Data Structures for Range Mode Query in Arrays
Sort
View
ICDE
1998
IEEE
119views Database» more  ICDE 1998»
14 years 6 months ago
Processing Incremental Multidimensional Range Queries in a Direct Manipulation Visual Query
We have developed a MultiMedia Visual Information Seeking (MMVIS) Environment that is the first system to support an integrated approach to the direct manipulation specification o...
Stacie Hibino, Elke A. Rundensteiner
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
13 years 11 months ago
Online Sorted Range Reporting
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 ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
ESA
2004
Springer
160views Algorithms» more  ESA 2004»
13 years 10 months ago
Optimal External Memory Planar Point Enclosure
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
Lars Arge, Vasilis Samoladas, Ke Yi
ICALP
2009
Springer
14 years 5 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 6 days ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
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...
Jérémy Barbay, Johannes Fischer