Efficient window aggregate method on array database system

Li Jiang, Hideyuki Kawashima, Osamu Tatebe

研究成果: Article査読

2 被引用数 (Scopus)

抄録

An array database is effective for managing a massive amount of sensor data, and the window aggregate is a popular operator. We propose an efficient window aggregate method over multi-dimensional array data based on incremental computation. We improve five types of aggregates by exploiting different data structures: list for summation and average, heap for maximum and minimum, and balanced binary search tree for percentile. We design and fully implement the proposed method in SciDB using the plugin mechanism. In addition, we evaluate the performance through experiments using the synthetic and JRA-55 meteorological datasets. The results of our experiments on SciDB are consistent with our analytic findings. The proposed method achieves a 17.9x, 12.5x, and 10.2x performance improvement for minimum, summation, and percentile operators, respectively, compared with SciDB built-in operators. These results align with our time-complexity analysis results.

本文言語English
ページ(範囲)867-877
ページ数11
ジャーナルJournal of information processing
24
6
DOI
出版ステータスPublished - 2016
外部発表はい

ASJC Scopus subject areas

  • Computer Science(all)

フィンガープリント 「Efficient window aggregate method on array database system」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル