6004 search results - page 586 / 1201 » Parallelizing query optimization |
165
click to vote
GIS
2007
ACM
15 years 10 months ago
2007
ACM
Spatial join is an important yet costly operation in spatial databases. In order to speed up the execution of a spatial join, the input tables are often indexed based on their spa...
207
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
175
click to vote
DELOS
2000
15 years 7 months ago
2000
User feedback has proven very successful to query large multimedia databases. Due to the nature of the data representation and the mismatch between mathematical models and human p...
235
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
146
click to vote
SPAA
2005
ACM
15 years 12 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 ...