Sciweavers

1542 search results - page 28 / 309
» Redundancy in Spatial Databases
Sort
View
BTW
1999
Springer
157views Database» more  BTW 1999»
13 years 11 months ago
Database Primitives for Spatial Data Mining
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
Martin Ester, Stefan Grundlach, Hans-Peter Kriegel...
KDD
1997
ACM
146views Data Mining» more  KDD 1997»
13 years 11 months ago
Density-Connected Sets and their Application for Trend Detection in Spatial Databases
1 Several clustering algorithms have been proposed for class identification in spatial databases such as earth observation databases. The effectivity of the well-known algorithms ...
Martin Ester, Hans-Peter Kriegel, Jörg Sander...
GIS
2010
ACM
13 years 6 months ago
INTACT: a spatial query integrity assurance framework for location-based services
It is cost-effective for data owners to publicize their spatial databases via database outsourcing; however, data privacy and query integrity are major challenges. In this demonst...
Chih-Jye Wang, Wei-Shinn Ku, Ling Hu, Cyrus Shahab...
SIGMOD
2008
ACM
90views Database» more  SIGMOD 2008»
14 years 7 months ago
Capacity constrained assignment in spatial databases
Leong Hou U, Man Lung Yiu, Kyriakos Mouratidis, Ni...
CIKM
1994
Springer
13 years 11 months ago
Hashing by Proximity to Process Duplicates in Spatial Databases
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
Walid G. Aref, Hanan Samet