197 search results - page 36 / 40 » Efficiently approximating query optimizer plan diagrams |
NIPS
1998
13 years 8 months ago
1998
Lazy learning is a memory-based technique that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered re...
CGF
2008
13 years 7 months ago
2008
We present a generalization of thin-plate splines for interpolation and approximation of manifold-valued data, and demonstrate its usefulness in computer graphics with several app...
COMCOM
2008
13 years 7 months ago
2008
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
DASFAA
2004
IEEE
13 years 11 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
SIGMOD
1999
ACM
13 years 11 months ago
1999
ACM
The database query optimizer requires the estimation of the query selectivity to find the most efficient access plan. For queries referencing multiple attributes from the same rel...