Abstract
In the era of big data, more and more applications require the information of historical data to support rich analytics, learning, and mining operations. In these cases, it is highly desirable to retrieve information of previous versions of data. Traditionally, multi-version databases can be used to store all historical values of the data in order to support historical queries. However, storing all the historical data can be impractical due to its large space consumption. In this paper, we propose the concept of at-the-time persistent (ATTP) and back-in-time persistent (BITP) sketches, which are sketches that approximately answer queries on previous versions of data with small space. We then provide several implementations of ATTP/BITP sketches which are shown to be more efficient compared to existing state-of-the-art solutions in our empirical studies.
| Original language | English |
|---|---|
| Pages (from-to) | 1623-1636 |
| Number of pages | 14 |
| Journal | Proceedings of the ACM SIGMOD International Conference on Management of Data |
| DOIs | |
| State | Published - 2021 |
| Event | 2021 International Conference on Management of Data, SIGMOD 2021 - Virtual, Online, China Duration: Jun 20 2021 → Jun 25 2021 |
Keywords
- data sketching
- persistent data structure
- random sampling
- streaming algorithms
Fingerprint
Dive into the research topics of 'At-the-time and Back-in-time Persistent Sketches'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver