25 search results - page 2 / 5 » Efficient Tradeoff Schemes in Data Structures for Querying M... |
DEXA
2003
Springer
13 years 10 months ago
2003
Springer
Moving-objects databases need a spatio-temporal indexing scheme for moving objects to efficiently process queries over continuously changing locations of the objects. A simple exte...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
GEOINFORMATICA
2007
13 years 4 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...
ICDE
2005
IEEE
14 years 6 months ago
2005
IEEE
Index structures are designed to optimize search performance, while at the same time supporting efficient data updates. Although not explicit, existing index structures are typica...
COMAD
2008
13 years 6 months ago
2008
Answering aggregate queries like sum, count, min, max over regions containing moving objects is often needed for virtual world applications, real-time monitoring systems, etc. Sin...