55 search results - page 10 / 11 » Cost models for distance joins queries using R-trees |
BTW
2005
Springer
15 years 3 months ago
2005
Springer
: Optimizers in modern DBMSs utilize a cost model to choose an efficient query execution plan (QEP) among all possible ones for a given query. The accuracy of the cost estimates de...
167
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Network data models are frequently used as a mechanism to describe the connectivity between spatial features in many emerging GIS applications (location-based services, transporta...
SSDBM
2003
IEEE
15 years 2 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
SIGMOD
2002
ACM
15 years 9 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
187
click to vote
VLDB
2006
ACM
15 years 9 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...