277 search results - page 4 / 56 » Opportunistic Data Structures for Range Queries |
DATESO
2009
13 years 6 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 ...
SOFSEM
2005
Springer
14 years 2 months ago
2005
Springer
Different structures are used in peer-to-peer networks to represent their inherently distributed, self-organized and decentralized memory structure. In this paper, a simple range...
CCCG
2009
13 years 9 months ago
2009
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles...
EUROPAR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We introduce SONAR, a structured overlay to store and retrieve objects addressed by multi-dimensional names (keys). The overlay has the shape of a multi-dimensional torus...
LCN
2006
IEEE
14 years 2 months ago
2006
IEEE
Structured Peer-to-Peer systems are designed for a highly scalable, self organizing, and efficient lookup for data. The key space of the so-called Distributed Hash Tables (DHTs) ...