2724 search results - page 346 / 545 » Optimizing Queries on Files |
175
click to vote
PODS
2002
ACM
16 years 4 months ago
2002
ACM
We consider the fundamental operation of applying a conjunction of selection conditions to a set of records. With large main memories available cheaply, systems may choose to keep...
126
click to vote
GIS
2007
ACM
15 years 7 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...
161
Voted
CCS
2008
ACM
15 years 5 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...
140
click to vote
DELOS
2000
15 years 5 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...
197
click to vote
CORR
1999
Springer
15 years 3 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...