1888 search results - page 2 / 378 » Algorithms for Querying by Spatial Structure |
SIGMOD
2000
ACM
15 years 2 months ago
2000
ACM
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
104
click to vote
SUTC
2008
IEEE
15 years 4 months ago
2008
IEEE
Most of research efforts have elaborated on k-anonymity for location privacy. The general architecture for implementing k-anonymity is that there is one trusted server (referred t...
GIS
2007
ACM
15 years 1 months ago
2007
ACM
Spatial join is an important yet costly operation in spatial databases. In order to speed up the execution of a spatial join, the input tables are often indexed based on their spa...
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...
101
click to vote
IWMMDBMS
1996
14 years 11 months ago
1996
The maintenance of large raster images under spatial operations is still a major performance bottleneck. For reasons of storage space, images in a collection, such as satellite pi...