期刊
出版社
ROYAL SOC
DOI: 10.1098/rspa.2019.0034
关键词
big data; database systems; structured query language; bounded evaluation; approximate query answering
资金
- ERC [652976]
- Royal Society Wolfson Research Merit Award [WRM/R1/180014]
- EPSRC [EP/M025268/1]
- Foundation for Innovative Research Groups of NSFC
- NSFC [61421003]
- Beijing Advanced Innovation Centre for Big Data and Brain Computing
- Shenzhen Institute of Computing Sciences
- Joint Lab between Edinburgh and Huawei
- EPSRC [EP/M025268/1] Funding Source: UKRI
Big data analytics is often prohibitively costly and is typically conducted by parallel processing with a cluster of machines. Is big data analytics beyond the reach of small companies that can only afford limited resources? This paper tackles this question by presenting Boundedly EvAlable SQL (BEAS), a system for querying big relations with constrained resources. The idea is to make big data small. To answer a query posed on a dataset, it often suffices to access a small fraction of the data no matter how big the dataset is. In the light of this, BEAS answers queries on big data by identifying and fetching a small set of the data needed. Under available resources, it computes exact answers whenever possible and otherwise approximate answers with accuracy guarantees. Underlying BEAS are principled approaches of bounded evaluation and data-driven approximation, the focus of this paper.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据