277 search results - page 10 / 56 » Opportunistic Data Structures for Range Queries |
WADS
2009
Springer
14 years 3 months ago
2009
Springer
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
MOBIQUITOUS
2007
IEEE
14 years 3 months ago
2007
IEEE
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we describe a dynamic external memory data structure that supports range reporting queries in three dimensions in O(log2 B N + k B ) I/O operations, where k is the nu...
ESA
2004
Springer
14 years 14 days ago
2004
Springer
The ability to represent and query continuously moving objects is important in many applications of spatio-temporal database systems. In this paper we develop data structures for ...
ESA
2010
Springer
13 years 9 months ago
2010
Springer
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...