I/O-Efficient Statistical Computing with RIOT

被引:43
|
作者
Zhang, Yi [1 ]
Zhang, Weiping [1 ]
Yang, Jun [1 ]
机构
[1] Duke Univ, Dept Comp Sci, Durham, NC 27708 USA
关键词
D O I
10.1109/ICDE.2010.5447819
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Statistical analysis of massive data is becoming indispensable to science, commerce, and society today. Such analysis requires efficient, flexible storage support and special optimization techniques. In this demo, we present RIOT (R with I/O Transparency), a system that extends R, a popular computing environment for statistical data analysis. RIOT makes R programs I/O-efficient in a way transparent to users. It features a flexible array storage manager and an optimization engine suitable for statistical and numerical operations. RIOT also seamlessly integrates with external database systems, offering additional opportunities for processing data that reside in databases by blurring the boundary between database and host-language processing. This demo will show how statistical computation can be effectively and efficiently handled by RIOT.
引用
收藏
页码:1157 / 1160
页数:4
相关论文
共 50 条
  • [1] I/O-Efficient Algorithms for Computing Contours on a Terrain
    Agarwal, Pankaj K.
    Arge, Lars
    Molhave, Thomas
    Sadri, Bardia
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SGG'08), 2008, : 129 - 138
  • [2] I/O-efficient algorithms for computing planar geometric spanners
    Maheshwari, Anil
    Smid, Michiel
    Zeh, Norbert
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2008, 40 (03): : 252 - 271
  • [3] I/O-efficient planar separators
    Maheshwari, Anil
    Zeh, Norbert
    [J]. SIAM JOURNAL ON COMPUTING, 2008, 38 (03) : 767 - 801
  • [4] Hybrid Pulling/Pushing for I/O-Efficient Distributed and Iterative Graph Computing
    Wang, Zhigang
    Gu, Yu
    Bao, Yubin
    Yu, Ge
    Yu, Jeffrey Xu
    [J]. SIGMOD'16: PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2016, : 479 - 494
  • [5] I/O-Efficient Similarity Join
    Pagh, Rasmus
    Pham, Ninh
    Silvestri, Francesco
    Stockel, Morten
    [J]. ALGORITHMICA, 2017, 78 (04) : 1263 - 1283
  • [6] I/O-Efficient Similarity Join
    Rasmus Pagh
    Ninh Pham
    Francesco Silvestri
    Morten Stöckel
    [J]. Algorithmica, 2017, 78 : 1263 - 1283
  • [7] I/O-Efficient Similarity Join
    Paghl, Rasmus
    Phaml, Ninh
    Silvestril, Francesco
    Stockel, Morten
    [J]. ALGORITHMS - ESA 2015, 2015, 9294 : 941 - 952
  • [8] I/O-Efficient Contour Queries on Terrains
    Agarwal, Pankaj K.
    Molhave, Thomas
    Sadri, Bardia
    [J]. PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 268 - 284
  • [9] HGraph: I/O-Efficient Distributed and Iterative Graph Computing by Hybrid Pushing/Pulling
    Wang, Zhigang
    Gu, Yu
    Bao, Yubin
    Yu, Ge
    Yu, Jeffrey Xu
    Wei, Zhiqiang
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2021, 33 (05) : 1973 - 1987
  • [10] I/O-Efficient Contour Tree Simplification
    Arge, Lars
    Revsbaek, Morten
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 1155 - 1165