Sciweavers

277 search results - page 11 / 56
» Opportunistic Data Structures for Range Queries
Sort
View
MICS
2010
137views more  MICS 2010»
13 years 7 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun
NBIS
2007
Springer
14 years 2 months ago
Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Nuno Lopes, Carlos Baquero
ICALP
2010
Springer
14 years 1 months ago
Cell Probe Lower Bounds and Approximations for Range Mode
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] mus...
Mark Greve, Allan Grønlund Jørgensen...
IWMMDBMS
1996
64views more  IWMMDBMS 1996»
13 years 10 months ago
Spatial Indexing into Compressed Raster Images: How to Answer Range Queries Without Decompression
The maintenance of large raster images under spatial operations is still a major performance bottleneck. For reasons of storage space, images in a collection, such as satellite pi...
Renato Pajarola, Peter Widmayer
INFOSCALE
2007
ACM
13 years 10 months ago
SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou