作者: Sungwoo Park , Taekyung Kim , Jonghyun Park , Jinha Kim , Hyeonseung Im
DOI: 10.1109/ICDE.2009.42
关键词:
摘要: With the advent of multicore processors,it has become imperative to write parallel programs if one wishes exploit next generation processors. This paper deals with skyline computation as a case study parallelizing database operations on architectures. We compare two algorithms: version branch-and-bound algorithm (BBS) and new based skeletal programming. Experimental results show despite its simple design, is comparable BBS in speed. For sequential computation, far outperforms when density tuples low.