79 search results - page 3 / 16 » Efficient indexing structure for scalable processing of spat... |
102
Voted
HIPC
2009
Springer
14 years 7 months ago
2009
Springer
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...
COMPSAC
2004
IEEE
15 years 1 months ago
2004
IEEE
Recently distributed hash table (DHT) mechanisms have been proposed to manage data in very large, structured peer-to-peer (P2P) systems. DHT algorithms provide efficient exact-mat...
184
Voted
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...
161
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
81
Voted
DEXA
2004
Springer
15 years 2 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...