277 search results - page 23 / 56 » Opportunistic Data Structures for Range Queries |
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to a parallel or distributed setting and present three concurrent CO B-trees. Our ...
SSDBM
2000
IEEE
14 years 10 days ago
2000
IEEE
Multidimensional data cubes are used in large data warehouses as a tool for online aggregation of information. As the number of dimensions increases, supporting efficient queries ...
VLDB
2005
ACM
14 years 2 months ago
2005
ACM
In an “uncertain database”, an object o is associated with a multi-dimensional probability density function (pdf), which describes the likelihood that o appears at each positi...
SSDBM
2008
IEEE
14 years 3 months ago
2008
IEEE
Bitmap indexes are known to be efficient for ad-hoc range queries that are common in data warehousing and scientific applications. However, they suffer from the curse of cardina...
ESA
2004
Springer
14 years 2 months ago
2004
Springer
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...