Comparing columnar, row and array DBMSs to process recursive queries on graphs

详细信息    查看全文

• 作者：Carlos Ordonez ; Wellington Cabrera ; ^{wcabrera@cs.uh.edu" class="auth_mail" title="E-mail the corresponding author} ; Achyuth Gurram
• 关键词：Graph ; SQL ; Recursive query ; Matrix ; Reachability ; Query optimization
• 刊名：Information Systems
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：63
• 期：Complete
• 页码：66-79
• 全文大小：345 K

文摘

Analyzing graphs is a fundamental problem in big data analytics, for which DBMS technology does not seem competitive. On the other hand, SQL recursive queries are a fundamental mechanism to analyze graphs in a DBMS, whose processing and optimization are significantly harder than traditional SPJ queries. Columnar DBMSs are a new faster class of database system, with significantly different storage and query processing mechanisms compared to row DBMSs, still the dominating technology. With that motivation in mind, we study the optimization of recursive queries on a columnar DBMS focusing on two fundamental and complementary graph problems: transitive closure and adjacency matrix multiplication. From a query processing perspective we consider the three fundamental relational operators: selection, projection and join (SPJ), where projection subsumes SQL group-by aggregation. We present comprehensive experiments comparing recursive query processing on columnar, row and array DBMSs to analyze large graphs with different shape and density. We study the relative impact of query optimizations and we compare raw speed of DBMSs to evaluate recursive queries on graphs. Results confirm classical query optimizations that keep working well in a columnar DBMS, but their relative impact is different. Most importantly, a columnar DBMS with tuned query optimization is uniformly faster than row and array systems to analyze large graphs, regardless of their shape, density and connectivity. On the other hand, there is no clear winner between the row and array DBMSs.