Design and evaluation of efficient parellel join algorithms for multiprocessor database computers다중프로세서 데이타베이스 컴퓨터를 위한 효율적인 병렬 결합 알고리듬의 설계 및 분석

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 327
  • Download : 0
During the past decade, there have been constant efforts toward creating more powerful database systems, especially focusing on the relational database system and as a result, several relational database system have appeared. However, most of these systems exhibit poor performance in supporting a large class of database operations, since they are too large and complex to run on a conventional general purpose von Neumann computer which is particularly not suitable for database management. In order to overcome the drawbacks of the conventional database systems, the database computer approach has been inspired by parallel processing to support some or all of the functions of the relational database system, in particular to efficiently support the relational join operation because the join operation is the most important limiting factor on the performance of the relational database system. In this thesis, we extensively investigate the join processing algorithms under multiprocessor database computer environments. first, the problems of the existing join algorithms are addressed, and then we propose a new join algorithm referred to as hybrid join, which improves both the sort-merge and the hash-partitioned join algorithms by completely sorting only the smaller relation and partitioning the other one into ranged buckets according to the order statistics of the sorted relation. The key idea in the hybrid join is to determine the bound on the bucket sizes during the sort of the smaller relation. This guarantees a nice bound on the number of buffers necessary for any smaller relation bucket. Accordingly, the hybrid join requires relatively less sorting cost than that of the sort-merge join and also can prevent the bucket overflows which appear in the hash-partitioned join. Second, we extend this result to develop efficient parallel join algorithms on two types of multiprocessor database computers: a shared-memory multiprocessor and a distributed-memory multiprocessor. ...
Advisors
Kim, Myung-Hwanresearcher김명환researcher
Description
한국과학기술원 : 전기 및 전자공학과,
Publisher
한국과학기술원
Issue Date
1989
Identifier
61349/325007 / 000845350
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전기 및 전자공학과, 1989.8, [ viii, 109 p. ]

URI
http://hdl.handle.net/10203/36086
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=61349&flag=dissertation
Appears in Collection
EE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0