Journal of KIISE:Software and Applications (한국정보과학회논문지:소프트웨어및응용)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Task Creation and Assignment based on Object Caching for Parallel Spatial Join

병렬공간 조인을 위한 객체 캐쉬 기반 태스크 생성 및 할당

  • Published : 1999.10.01

⟨ Previous Next ⟩

Abstract

A spatial join has the property that its execution time exponentially increases in proportion to the number of spatial objects. Recently, there have been many attempts for improving the performance of the spatial join by using parallel processing schemes, In the case of executing parallel spatial join using the parallel machine with shared disk architecture, the disk bottleneck of parallel processing of spatial join worsens in comparison with sequential spatial join. This paper presents the algorithms of task creation and assignment to reduce the disk bottleneck caused by accessing the shared disk at the same time, and to minimize message passing between processors, This paper proposes object caching which is a higher level of abstraction than page caching, and uses it to do creation and assignment of tasks according to temporal and spatial localities for minimizing disk access time. The object caching shows the performance improvement of 50%. The task creation and assignment using localities gives the gain of 30% and 20%. Overall performance evaluation of the proposed algorithms shows 7.2 times speed up than those of sequential execution of spatial joins.

Keywords

References

  1. Proc. 12th IEEE Data Engineering 1996 Parallel Processing of Spatial Joins Using R-trees Thomas Brinkhoff;Hans-Peter Kriegel ;Bernhard Seeger
  2. Int. Conf. on Parallel Processing Data-Parallel Spatial Join algorithms Erik g. Hoel;Hanam Samet
  3. 정보 과학회 논문지(B) v.26 no.1 벡터 사분트리를 이용한 병렬 공간 조인 김진덕;성원모;홍봉희
  4. 정보과학회 '97 가을 학술 발표논문집(Ⅰ) v.24 no.1 사분트리를 이용한 병렬공간 조인 알고리즘 성원모;김진덕;홍봉희;김장수
  5. Proc. ACM SIGMOD Int. Conf. Efficient Processing of Spatial Joins Using R-trees Thomas Brinkhoff;Hans-Peter Kriegel;Bernhard Seeger
  6. Proc. ACM SIGMOD Int. Conf. Multi-Step Processing of Spatial Joins Thomas Brinkhoff;Hans-Peter Kriegel;Ralf Schneider;Bernhard Seeger
  7. Proc. Of the 23rd VLDB Conference Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations Yun-Wu Huang;Ning Jing;Elke A. Rundensteiner
  8. IEEE Transactions on Knowledgement and Data Engineering v.10 no.1 The Design and Implementation of Seeded Trees : An Efficient Method for Spatial Joins Ming-Ling Lo;Chinya V. Ravishankar
  9. IEEE Computer Society 1997 Distributed Shared Memory concepts and Systems IEEE Computer society
  10. Proc. ACM SIGMOD Int. Conf. on Management of Data R-trees A Dynamic Index Structure for Spatial Searching Guttman A.
  11. GIS : A Computing Perspective Michael F. Worboys
  12. Sequoia 2000 FTP server home page
  13. Proc. ACM SIGMOD Int. Conf. on Management on Data The R*-tree : An Efficient and Robust Access Method for Points and Rectangles Beckmann N.;Kriegel H.-P.;Schneider R.;Seeger B.
  14. VLDB 97 Hilbert R-tree: An improved R-tree using fractals Ibrahim Kamel;Christos Faloutosos
  15. Parallelizing a GIS on a Shared Address Space Architecture IEEE Computer 1996 v.29 no.12 Shashi Shekhar;Sivakumar Ravada;Vipin Kumar;Douglas Chubb;Greg Turner
  16. The Design and Analysis of Spatial Data Structures Samet H.
  17. 정보과학회 '98 봄 학술발표 논문집(Ⅰ) v.25 no.1 R-tree 기반 병렬공간조인을 위한 태스크 생성 및 할당 알고리즘 서영덕;김진덕;홍봉희
  18. 정보과학회 '98 가을 학술 발표 논문집(Ⅰ) v.25 no.2 R-tree를 이용한 병렬 공간 조인의 태스크 생성/할당 알고리즘의 구현 및 성능평가 서영덕;김진덕;홍봉희