Sciweavers

1542 search results - page 38 / 309
» Redundancy in Spatial Databases
Sort
View
VLDB
1998
ACM
312views Database» more  VLDB 1998»
13 years 11 months ago
WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases
Many applications require the management of spatial data. Clustering large spatial databases is an important problem which tries to find the densely populated regions in the featu...
Gholamhosein Sheikholeslami, Surojit Chatterjee, A...
GEOINFO
2003
13 years 9 months ago
The Web as a Data Source for Spatial Databases
With the phenomenal growth of the WWW, rich data sources on many different subjects have become available online. Some of these sources store daily facts that often involve textual...
Karla A. V. Borges, Alberto H. F. Laender, Claudia...
ISCI
2007
141views more  ISCI 2007»
13 years 7 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
ICDE
2009
IEEE
180views Database» more  ICDE 2009»
14 years 9 months ago
Reverse Furthest Neighbors in Spatial Databases
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...
Bin Yao, Feifei Li, Piyush Kumar
DATAMINE
1999
113views more  DATAMINE 1999»
13 years 7 months ago
A Fast Parallel Clustering Algorithm for Large Spatial Databases
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
Xiaowei Xu, Jochen Jäger, Hans-Peter Kriegel