Sciweavers

168 search results - page 10 / 34
» Incremental Distance Join Algorithms for Spatial Databases
Sort
View
ICDE
2003
IEEE
116views Database» more  ICDE 2003»
14 years 9 months ago
Joining Massive High-Dimensional Datasets
We consider the problem of joining massive datasets. We propose two techniques for minimizing disk I/O cost of join operations for both spatial and sequence data. Our techniques o...
Tamer Kahveci, Christian A. Lang, Ambuj K. Singh
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
14 years 9 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal
GIS
2005
ACM
14 years 9 months ago
Finding corresponding objects when integrating several geo-spatial datasets
When integrating geo-spatial datasets, a join algorithm is used for finding sets of corresponding objects (i.e., objects that represent the same real-world entity). Algorithms for...
Catriel Beeri, Yerach Doytsher, Yaron Kanza, Eliya...
SSDBM
2009
IEEE
119views Database» more  SSDBM 2009»
14 years 2 months ago
Identifying the Most Endangered Objects from Spatial Datasets
Abstract. Real-life spatial objects are usually described by their geographic locations (e.g., longitude and latitude), and multiple quality attributes. Conventionally, spatial dat...
Hua Lu, Man Lung Yiu
VLDB
2007
ACM
116views Database» more  VLDB 2007»
14 years 2 months ago
K-Anonymization as Spatial Indexing: Toward Scalable and Incremental Anonymization
In this paper we observe that k-anonymizing a data set is strikingly similar to building a spatial index over the data set, so similar in fact that classical spatial indexing tech...
Tochukwu Iwuchukwu, Jeffrey F. Naughton