55 search results - page 7 / 11 » Cost models for distance joins queries using R-trees |
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...
SIGMOD
1993
ACM
13 years 11 months ago
1993
ACM
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
NATO
1993
13 years 11 months ago
1993
METU Object-Oriented DBMS 1 includes the implementation of a database kernel, an object-oriented SQL-like language and a graphical user interface. Kernel functions are divided bet...
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...