Efficient polygon amalgamation methods for spatial OLAP and spatial data mining

Zhou, Xiaofang, Truflet, David and Han, Jiawei (1999). Efficient polygon amalgamation methods for spatial OLAP and spatial data mining. In: Ralf Hartmut Güting, Dimitris Papadias and Frederick H. Lochovsky, Lecture Notes In Computer Science: Proceedings of the 6th International Symposium, Advances in Spatial Databases. Advances in Spatial Databases, Hong Kong, (167-187). 20 - 23 July, 1999. doi:10.1007/3-540-48482-5_12


Author Zhou, Xiaofang
Truflet, David
Han, Jiawei
Title of paper Efficient polygon amalgamation methods for spatial OLAP and spatial data mining
Conference name Advances in Spatial Databases
Conference location Hong Kong
Conference dates 20 - 23 July, 1999
Proceedings title Lecture Notes In Computer Science: Proceedings of the 6th International Symposium, Advances in Spatial Databases   Check publisher's open access policy
Journal name Advances in Spatial Databases   Check publisher's open access policy
Place of Publication Germany
Publisher Springer
Publication Year 1999
Sub-type Fully published paper
DOI 10.1007/3-540-48482-5_12
ISBN 3540662472
ISSN 0302-9743
Editor Ralf Hartmut Güting
Dimitris Papadias
Frederick H. Lochovsky
Volume 1651
Start page 167
End page 187
Total pages 21
Collection year 1999
Language eng
Abstract/Summary The polygon amalgamation operation computes the boundary of the union of a set of polygons. This is an important operation for spatial on-line analytical processing and spatial data mining, where polygons representing different spatial objects often need to be amalgamated by varying criteria when the user wants to aggregate or reclassify these objects. The processing cost of this operation can be very high for a large number of polygons. Based on the observation that not all polygons to be amalgamated contribute to the boundary, we investigate in this paper efficient polygon amalgamation methods by excluding those internal polygons without retrieving them fr-om the database; Two novel algorithms, adjacency-based and occupancy-based, are proposed. While both algorithms can reduce the amalgamation cost significantly, the occupancy-based algorithm is particularly attractive because: 1) it retrieves a smaller amount of data than the adjacency-based algorithm; 2) it is based on a simple extension to a commonly used spatial indexing mechanism; and 3) it can handle fuzzy amalgamation.
Subjects E1
700103 Information processing services
280102 Information Systems Management
Keyword spatial databases
polygon amalgamation
on-line analytical processing (OLAP)
spatial indexing
Q-Index Code E1

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 7 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 6 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Fri, 06 Jun 2008, 15:39:44 EST