277 search results - page 2 / 56 » Opportunistic Data Structures for Range Queries |
ESA
2010
Springer
14 years 12 months ago
2010
Springer
The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m
105
click to vote
ISAAC
2005
Springer
15 years 5 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...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...
CCCG
2008
15 years 1 months ago
2008
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...
ISCIS
2005
Springer
15 years 5 months ago
2005
Springer
We introduce a novel data structure for solving the range query problem in generic metric spaces. It can be seen as a dynamic version of the List of Clusters data structure of Ch´...