An Efficient Cross-Match Implementation Based on Directed Join Algorithm in MapReduce

2011 ◽  
Author(s):  
Cuncang Mi ◽  
Qian Chen ◽  
Taoying Liu
Keyword(s):  
Join Algorithm ◽  
Cross Match

Parallel massive data oriented astronomical cross-match

2010 ◽  
Vol 30 (8) ◽  
pp. 2056-2059 ◽  
Author(s):  
Qing ZHAO ◽  
Ji-zhou SUN ◽  
Ce YU ◽  
Chen-zhou CUI ◽  
Jian XIAO
Keyword(s):  
Massive Data ◽  
Cross Match

scholarly journals In-Memory Interval Joins

2021 ◽  
Author(s):  
Panagiotis Bouros ◽  
Nikos Mamoulis ◽  
Dimitrios Tsitsigkos ◽  
Manolis Terrovitis
Keyword(s):  
Parallel Computation ◽  
State Of The Art ◽  
Complex Data ◽  
Plane Sweep ◽  
Join Algorithm ◽  
Sweep Algorithm ◽  
Join Algorithms ◽  
Domain Partitioning ◽  
Complex Data Structure ◽  
Independent Tasks

AbstractThe interval join is a popular operation in temporal, spatial, and uncertain databases. The majority of interval join algorithms assume that input data reside on disk and so, their focus is to minimize the I/O accesses. Recently, an in-memory approach based on plane sweep (PS) for modern hardware was proposed which greatly outperforms previous work. However, this approach relies on a complex data structure and its parallelization has not been adequately studied. In this article, we investigate in-memory interval joins in two directions. First, we explore the applicability of a largely ignored forward scan (FS)-based plane sweep algorithm, for single-threaded join evaluation. We propose four optimizations for FS that greatly reduce its cost, making it competitive or even faster than the state-of-the-art. Second, we study in depth the parallel computation of interval joins. We design a non-partitioning-based approach that determines independent tasks of the join algorithm to run in parallel. Then, we address the drawbacks of the previously proposed hash-based partitioning and suggest a domain-based partitioning approach that does not produce duplicate results. Within our approach, we propose a novel breakdown of the partition-joins into mini-joins to be scheduled in the available CPU threads and propose an adaptive domain partitioning, aiming at load balancing. We also investigate how the partitioning phase can benefit from modern parallel hardware. Our thorough experimental analysis demonstrates the advantage of our novel partitioning-based approach for parallel computation.

scholarly journals Does a positive lymphocyte cross-match contraindicate living-donor liver transplantation?

Surgery ◽  
2010 ◽  
Vol 147 (6) ◽  
pp. 840-844 ◽  
Author(s):  
Tomohide Hori ◽  
Shinji Uemoto ◽  
Yasutsugu Takada ◽  
Fumitaka Oike ◽  
Yasuhiro Ogura ◽  
...  
Keyword(s):  
Liver Transplantation ◽  
Living Donor ◽  
Living Donor Liver Transplantation ◽  
Donor Liver ◽  
Donor Liver Transplantation ◽  
Cross Match

Optimisation de l’épreuve directe de compatibilité au laboratoire : cross match automatisé

2015 ◽  
Vol 22 (4) ◽  
pp. 254
Author(s):  
H. Brouk ◽  
I.H. Saouli ◽  
A. Amireche ◽  
N. Zeribi ◽  
D. Khemiss ◽  
...  
Keyword(s):  
Cross Match

SEPT: an efficient skyline join algorithm on massive data

2014 ◽  
Vol 43 (2) ◽  
pp. 355-388 ◽  
Author(s):  
Xixian Han ◽  
Jianzhong Li ◽  
Hong Gao ◽  
Chengyu Yang
Keyword(s):  
Massive Data ◽  
Join Algorithm

Parallel Structural Join Algorithm on Shared-Memory Multi-Core Systems

2008 ◽  
Author(s):  
Le Liu ◽  
Jianhua Feng ◽  
Guoliang Li ◽  
Qian Qian ◽  
Jianhui Li
Keyword(s):  
Shared Memory ◽  
Structural Join ◽  
Join Algorithm
Sign in / Sign up

Export Citation Format

Share Document