arrow
返回

Effective and efficient data sampling using bitmap indices

delete2014-03-11
delete15
PRE
AI
Y
Yu Su *
G
Gagan Agrawal
J
Jonathan Woodring
K
Kary Myers
J
Joanne Wendelberger
J
James Ahrens
DOI:10.1007/s10586-014-0360-5delete
delete原文链接
delete分享
delete收藏
摘要

摘要

En 中文
With growing computational capabilities of parallel machines, scientific simulations are being performed at finer spatial and temporal scales, leading to a data explosion. The growing sizes are making it extremely hard to store, manage, disseminate, analyze, and visualize these datasets, especially as neither the memory capacity of parallel machines, memory access speeds, nor disk bandwidths are increasing at the same rate as the computing power. Sampling can be an effective technique to address the above challenges, but it is extremely important to ensure that dataset characteristics are preserved, and the loss of accuracy is within acceptable levels. In this paper, we address the data explosion problems by developing a novel sampling approach, and implementing it in a flexible system that supports server-side sampling and data subsetting. We observe that to allow subsetting over scientific datasets, data repositories are likely to use an indexing technique. Among these techniques, we see that bitmap indexing can not only effectively support subsetting over scientific datasets, but can also help create samples that preserve both value and spatial distributions over scientific datasets. We have developed algorithms for using bitmap indices to sample datasets. We have also shown how only a small amount of additional metadata stored with bitvectors can help assess loss of accuracy with a particular subsampling level. Some of the other properties of this novel approach include: (1) sampling can be flexibly applied to a subset of the original dataset, which may be specified using a value-based and/or a dimension-based subsetting predicate, and (2) no data reorganization is needed, once bitmap indices have been generated. We have extensively evaluated our method with different types of datasets and applications, and demonstrated the effectiveness of our approach.
Keyword:
Big data
Bitmap indexing
Data sampling
Multi-resolution
Parallel processing
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Cluster Computing-The Journal of Networks Software Tools and Applications
IF:
4.1
论文数:
5.1K
被引数:
9.4K

机构

U
University System of Ohio
学者数:
15.5W
论文数: 13.0W
被引数: 13.8W
O
Ohio State University
学者数:
592
论文数: 282
被引数: 1.9W
引用论文

引用论文

err分享
err收藏
The first samples from Almahata Sitta showing contacts between ureilitic and chondritic lithologies: Implications for the structure and composition of asteroid 2008TC3
err2019-10-15
err0
errOAAI
errCyrena Anne Goodrich; Michael E. Zolensky; Anna Maria Fioretti; Muawia H. Shaddad; Hilary Downes; Takahiro Hiroi; Issaku Kohl; Edward D. Young; Noriko T. Kita; Victoria E. Hamilton; My E. I. Riebe; Henner Busemann; Robert J. Macke; M. Fries; D. Kent Ross; Peter Jenniskens
err分享
err收藏
Biocatalytic Routes to Lactone Monomers for Polymer Production
err2018-03-13
err0
errOAAI
errHanan L. Messiha; Syed T. Ahmed; Vijaykumar Karuppiah; Reynier Suardíaz; Gabriel A. Ascue Avalos; Natalie Fey; Stephen Yeates; Helen S. Toogood; Adrian J. Mulholland; Nigel S. Scrutton
err分享
err收藏
Mycobacteria
err
IF0
err2009-04-17
err0
PREAI
err
err分享
err收藏
学者 查看更多内容