Take the 2-minute tour ×
Database Administrators Stack Exchange is a question and answer site for database professionals who wish to improve their database skills and learn from others in the community. It's 100% free, no registration required.

Indexing time series (like in this article) is done by reducing dimensionality and indexing it using some spatial access method (like R-tree). How does that improve performance, though? It's not like this way let's speed up queries like:

select ID 
from smallTable 
where (x1-X1)^2 + (y1-Y1)^2 + (x2-X2)^2 + (y2-Y2)^2 < 100, 
having table smallTable(ID int, x1 float, y1 float, x2 float, y2 float) 
and desirable points (X1, Y1) and (X2, Y2).
share|improve this question

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.