Parallelism of spatial data mining based on autocorrelation decision tree

1.INTRODUCTION Oneofmostimportantoperationsisspatialparallel processinginspatialdatabase.Itisnecessaryforusto retrievalallspatialpredictionsformtwoormorespa tialdatasets.Ingeneral,thequeryconsistsoftwo procedures:filtrationandsimplification.Sincethe complexityofspatialobjects,filtrationprocesscan generateaholdingitemsetofsatisfyingcertaincondi tionsintermsofparallelprocessingrules.Inorderto measuretheaccuracyofquerycondition,weneedre trievalpreciseshapeinformationofeachobjectfrom anotherm…

Parallelism of spatial data mining based on autocorrelation decision tree

Define and theory of autocorrelation decision tree (ADT) is introduced. In spatial data mining, spatial parallel query are very expensive operations. A new parallel algorithm in terms of autocorrelation decision tree is presented. And the new method reduces CPU and I/Otime and improves the query efficiency of spatial data. For dynamic load balancing, there are better control and optimization. Experimental performance comparison shows that the improved algorithm can obtain a optimal accelerator with the same quantities of processors. There are more completely accesses on nodes. And an individual implement of intelligent information retrieval for spatial data mining is presented.