31 search results - page 5 / 7 » Efficient processing of past-future spatiotemporal queries |
DEXA
2004
Springer
15 years 3 months ago
2004
Springer
Efficient storage and retrieval of trajectory indexes has become an essential requirement for moving objects databases. The existing 3DR-tree is known to be an effective trajectory...
AIA
2006
14 years 11 months ago
2006
Time series data is usually stored and processed in the form of discrete trajectories of multidimensional measurement points. In order to compare the measurements of a query traje...
174
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Given a region qR and a future timestamp qT, a "range aggregate" query estimates the number of objects expected to appear in qR at time qT. Currently the only methods fo...
100
click to vote
CCGRID
2009
IEEE
15 years 1 months ago
2009
IEEE
From personal software to advanced systems, caching mechanisms have steadfastly been a ubiquitous means for reducing workloads. It is no surprise, then, that under the grid and clu...
GEOINFORMATICA
2007
14 years 9 months ago
2007
Nearest Neighbor (NN) search has been in the core of spatial and spatiotemporal database research during the last decade. The literature on NN query processing algorithms so far d...