Affiliation:
1. University at Buffalo
2. The Pennsylvania State University
3. Alibaba
Abstract
There has been an increasing demand for real-time data analytics. Approximate Query Processing (AQP) is a popular option for that because it can use random sampling to trade some accuracy for lower query latency. However, the state-of-the-art AQP system either relies on scan-based sampling algorithms to draw samples, which can still incur a non-trivial cost of table scan, or creates samples of the database in a preprocessing step, which are hard to update. The alternative is to use the aggregate B-tree indexes to support both random sampling and updates in database with logarithmic time. However, to the best of our knowledge, it is unknown how to design an aggregate B-tree to support highly concurrent random sampling and updates, due to the difficulty of maintaining the aggregate weights correctly and efficiently with concurrency. In this work, we identify the key challenges to achieve high concurrency and present AB-tree, an index for highly concurrent random sampling and update operations. We also conduct extensive experiments to show its efficiency and efficacy in a variety of workloads.
Publisher
Association for Computing Machinery (ACM)
Subject
General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development
Reference30 articles.
1. Hussam Abu-Libdeh , Deniz Altinbüken , Alex Beutel , Ed H. Chi , Lyric Pankaj Doshi , Tim Klas Kraska , Xiaozhou (Steve) Li , Andy Ly , and Chris Olston . 2020 . Learned Indexes for a Google-scale Disk-based Database . In ML for Systems workshop at NeurIPS '20 . https://arxiv.org/pdf/2012.12501.pdf Hussam Abu-Libdeh, Deniz Altinbüken, Alex Beutel, Ed H. Chi, Lyric Pankaj Doshi, Tim Klas Kraska, Xiaozhou (Steve) Li, Andy Ly, and Chris Olston. 2020. Learned Indexes for a Google-scale Disk-based Database. In ML for Systems workshop at NeurIPS '20. https://arxiv.org/pdf/2012.12501.pdf
2. Join synopses for approximate query answering
3. Sameer Agarwal Barzan Mozafari Aurojit Panda Henry Milner Samuel Madden and Ion Stoica. 2013. BlinkDB: queries with bounded errors and bounded response times on very large data. In EuroSys. 29--42. Sameer Agarwal Barzan Mozafari Aurojit Panda Henry Milner Samuel Madden and Ion Stoica. 2013. BlinkDB: queries with bounded errors and bounded response times on very large data. In EuroSys. 29--42.
4. On random sampling over joins
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献