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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal R., Imielinski T., Swami A.: “Database Mining: A Performance Perspective”, IEEE Transactions on Knowledge and Data Engineering, Vol. 5, No. 6, 1993, pp. 914–925.
Bavarian State Bureau of Topography and Geodasy, CD-Rom, 1996.
Bill, Fritsch: “Fundamentals of Geographical Information Systems: Hardware, Software and Data” (in German), Wichmann Publishing, Heidelberg, Germany, 1991.
Brinkhoff T., Kriegel H.-P., Schneider R., and Seeger B.: “Efficient Multi-Step Processing of tSpatial Joins”. Proc. ACM SIGMOD’ 94, Minneapolis, MN, 1994, pp. 197–208.
Egenhofer M. J.: “Reasoning about Binary Topological Relations”, Proc. 2nd Int. Symp. On Large Spatial Databases, Zurich, Switzerland, 1991, pp. 143–160.
Ester M., Gundlach S., Kriegel H.-P., Sander J.: “Database Primitives for Spatial Data Mining”, Proc. Int. Conf. on Databases in Office, Engineering and Science (BTW’99), Freiburg, Germany, 1999.
Ester M., Kriegel H.-P., Sander J.: “Spatial Data Mining: A Database Approach”, Proc. 5th Int. Symp. on Large Spatial Databases, Berlin, Germany, 1997, pp. 47–66.
Ester M., Frommelt A., Kriegel H.-P., Sander J.: “Algorithms for Characterization and Trend Detection in Spatial Databases”, Proc. 4th Int. Conf. on Knowledge Discovery and Data Mining, New York City, NY, 1998, pp. 44–50.
Fayyad U. M.,.J., Piatetsky-Shapiro G., Smyth P.: “From Data Mining to Knowledge Discovery: An Overview”, in: Advances in Knowledge Discovery and Data Mining, AAAI Press, Menlo Park, 1996, pp. 1–34.
Gueting R. H.: “An Introduction to Spatial Database Systems”, Special Issue on Spatial Database Systems of the VLDB Journal, Vol. 3, No. 4, October 1994.
Guttman A.: “R-trees: A Dynamic Index Structure for Spatial Searching”, Proc. ACM SIGMOD’ 84, 1984, pp. 47–54.
Koperski K., Adhikary J., Han J.: “Knowledge Discovery in Spatial Databases: Progress and tChallenges”, Proc. SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Technical Report 96-08, UBC, Vancouver, Canada, 1996.
Lu W., Han J.: “Distance-Associated Join Indices for Spatial Range Search”, Proc. 8th Int. Conf. on Data Engineering, Phoenix, AZ, 1992, pp. 284–292.
Ng R. T., Han J.:“Efficient and Effective Clustering Methods for Spatial Data Mining”, Proc. 20th Int. Conf. on Very Large Data Bases, Santiago, Chile, 1994, pp. 144–155.
Rotem D.: “Spatial Join Indices”, Proc. 7th Int. Conf. on Data Engineering, Kobe, Japan, 1991, pp. 500–509.
Sander J., Ester M., Kriegel H.-P., Xu X.: “Density-Based Clustering in Spatial Databases: A New Algorithm and its Applications”, Data Mining and Knowledge Discovery, an International Journal, Kluwer Academic Publishers, Vol. 2, No. 2, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ester, M., Kriegel, HP., Sander, J. (1999). Knowledge Discovery in Spatial Databases. In: Burgard, W., Cremers, A.B., Cristaller, T. (eds) KI-99: Advances in Artificial Intelligence. KI 1999. Lecture Notes in Computer Science(), vol 1701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48238-5_5
Download citation
DOI: https://doi.org/10.1007/3-540-48238-5_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66495-6
Online ISBN: 978-3-540-48238-3
eBook Packages: Springer Book Archive