715 search results - page 40 / 143 » A Performance Evaluation of Spatial Join Processing Strategi... |
ADBIS
1998
Springer
15 years 1 months ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
VLDB
1990
ACM
15 years 1 months ago
1990
ACM
In applications such as vision and molecular biology, a common problem is to find the similar objects to a given target (according to some distance measure) in a large database. T...
SIGMOD
2009
ACM
15 years 4 months ago
2009
ACM
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
MASCOTS
2004
14 years 11 months ago
2004
The prominent role of the memory hierarchy as one of the major bottlenecks in achieving good program performance has motivated the search for ways of capturing the memory performa...
EDBT
2006
ACM
15 years 9 months ago
2006
ACM
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...