A Parallel Tree Pattern Query Processing Algorithm for Graph Databases using a GPGPU
Computer Science Department, Technion
Proceedings of the Workshops of the EDBT/ICDT 2015 Joint Conference (EDBT/ICDT), 2015
@article{shnaiderman2015parallel,
title={A Parallel Tree Pattern Query Processing Algorithm for Graph Databases using a GPGPU},
author={Shnaiderman, Lila and Shmueli, Oded},
year={2015}
}
Large amounts of data are modeled and stored as graphs in order to express complex data relationships. Consequently, query processing on graph structures is becoming an important component in real-world applications. The most commonly used query format is that of tree pattern queries. We present a new parallel SIMD algorithm, GGQ (GPU Graph data base Query), for answering tree pattern queries on graph databases, using a GPU. We present the results of extensive experimentation of GGQ on large graph databases using known benchmarks that show that GGQ is an effective and competitive algorithm.
April 14, 2015 by hgpu
