Knowledge Discovery in Spatial Databases

Abstract

Both, the number and the size of spatial databases, such as geographic or medical databases, are rapidly growing because of the large amount of data obtained from satellite images, computer tomography or other scientific equipment. Knowledge discovery in databases (KDD) is the process of discovering valid, novel and potentially useful patterns from large databases. Typical tasks for knowledge discovery in spatial databases include clustering, characterization and trend detection. The major difference between knowledge discovery in relational databases and in spatial databases is that attributes of the neighbors of some object of interest may have an influence on the object itself. Therefore, spatial knowledge discovery algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a single run of a typical algorithm. Thus, providing general concepts for neighborhood relations as well as an efficient implementation of these concepts will allow a tight integeration of spatial knowledge discovery algorithms with a spatial database management system. This will speed-up both, the development and the execution of spatial KDD algorithms. For this purpose, we define a small set of database primitives, and we demonstrate that typical spatial KDD algorithms are well supported by the proposed database primitives. By implementing the database primitives on top of a commercial database management system, we show the effectiveness and efficiency of our approach, experimentally as well as analytically. The paper concludes by outlining some interesting issues for future research in the emerging field of knowledge discovery in spatial databases.