An Improved Dynamic Vertical Partitioning Technique for Semi-Structured Data

扫码查看

原文链接

NETL
IEEE

外文摘要：Semi-structured data such as JSON has become the de facto standard for supporting data exchange on the Web。 At the same time， relational support for JSON data poses new challenges due to the large number of attributes， sparse attributes and dynamic changes in both workload and data set， which are all typical in such data。 In this paper， we address these challenges through a lightweight， in-memory relational database engine prototype and a flexible vertical partitioning algorithm that uses simple heuristics to adapt the data layout for the workload， on the fly。 Our experimental evaluation using the Nobench dataset for JSON data， shows that we outperform Argo， a state-of-the-art data model that also maps the JSON data format into relational databases， by a factor of 3。 We also outperform Hyrise， a state-of-the-art vertical partitioning algorithm designed for in-memory databases， by 24%。 Furthermore， our algorithm is able to achieve around 40% better cache utilization and 35% better TLB utilization。 Our experiments also show that our partitioning algorithm adapts to workload changes within a few seconds。

外文关键词：

LayoutPartitioning algorithmsNull valueData modelsArraysRelational databases

作者：

Sahel Sharify、Alan Lu、Jin Chen、Arnamoy Bhattacharyya、Ali Hashemi、Nick Koudas、Cristiana Amza

展开 >

作者单位：

University of Toronto

会议名称：

IEEE International Symposium on Performance Analysis of Systems and Softwar

会议地点：

Madison(US)

会议母体文献：

2019 IEEE International Symposium on Performance Analysis of Systems and Software

页码：

243-256

出版时间：

2019

DOI：

10.1109/ISPASS.2019.00037