Hybrid Transactional/Analytical Processing

Özcan, Fatma; Tian, Yuanyuan; Tözün, Pinar

doi:10.1145/3035918.3054784

Cited by 67 publications

(48 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that there may be dirty pages in D in the P 3 period. For instance, D[0], D [2] and D [3] (red shadow) are older pages ( Fig. 7(c)).…”

Section: Piggybackmentioning

confidence: 99%

“…As described in Sec. 1, consistent snapshots are not only used for consistent checkpoints but are also employed in HTAP systems [3], [4], [5], [6], [7], [8], [9], [10], [11], i.e., Hyper, HANA and SwingDB. Although there are many studies about concurrency control protocols for OLTP systems [30], [35], [36], [37], [38], [39], few works address HTAP's concurrency control; thus, we plan to build a prototype based on snapshot concurrency control to fill this gap in the future.…”

Section: Future Workmentioning

confidence: 99%

“…7(b) shows the situation at time t 1 . The client thread updates pages D[0], D[2], and D[3] (blue shadow) during the first period. The corresponding two-bit elements in D b are then set to ones by the client thread at the same time.…”

mentioning

confidence: 99%

See 2 more Smart Citations

A Comparative Study of Consistent Snapshot Algorithms for Main-Memory Database Systems

Wang²,

et al. 2021

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

In-memory databases (IMDBs) are gaining increasing popularity in big data applications, where clients commit updates intensively. Specifically, it is necessary for IMDBs to have efficient snapshot performance to support certain special applications (e.g., consistent checkpoint, HTAP). Formally, the in-memory consistent snapshot problem refers to taking an in-memory consistent time-in-point snapshot with the constraints that 1) clients can read the latest data items and 2) any data item in the snapshot should not be overwritten. Various snapshot algorithms have been proposed in academia to trade off throughput and latency, but industrial IMDBs such as Redis adhere to the simple fork algorithm. To understand this phenomenon, we conduct comprehensive performance evaluations on mainstream snapshot algorithms. Surprisingly, we observe that the simple fork algorithm indeed outperforms the state-of-the-arts in update-intensive workload scenarios. On this basis, we identify the drawbacks of existing research and propose two lightweight improvements. Extensive evaluations on synthetic data and Redis show that our lightweight improvements yield better performance than fork, the current industrial standard, and the representative snapshot algorithms from academia. Finally, we have opensourced the implementation of all the above snapshot algorithms so that practitioners are able to benchmark the performance of each algorithm and select proper methods for different application scenarios.

show abstract

“…Note that there may be dirty pages in D in the P 3 period. For instance, D[0], D [2] and D [3] (red shadow) are older pages ( Fig. 7(c)).…”

Section: Piggybackmentioning

confidence: 99%

Section: Future Workmentioning

confidence: 99%

See 1 more Smart Citation

A Comparative Study of Consistent Snapshot Algorithms for Main-Memory Database Systems

Wang²,

et al. 2021

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

show abstract

“…In the last decade, the database research community has focused on challenges for data management and system design implied by the ongoing needs to manage and analyze web-scale, frequently changing, diverse datasets. One key challenge is to minimize the latency between operational and analytical systems [34,45,48]. For Hybrid Transactional Analytical Processing (HTAP) systems, new architectures were proposed that enable low latency analysis on real-time operational data.…”

Section: Introductionmentioning

confidence: 99%

“…For Hybrid Transactional Analytical Processing (HTAP) systems, new architectures were proposed that enable low latency analysis on real-time operational data. A good overview about this topic can be found in a recent survey by Özcan et al [45]. A key enabling factor for HTAP systems is modern hardware: modern hardware promises novel ways for data process-Marcus Pinnecke pinnecke@ovgu.de 1 Institute of Technical and Business Information Systems, Database and Software Engineering Group, University of Magdeburg, Magdeburg, Germany ing of relational [14,25] and non-relational data [42,49], as well as benefits for several database system components, such as query optimization [26,41].…”

Section: Introductionmentioning

confidence: 99%

GridTables: A One-Size-Fits-Most H2TAP Data Store

et al. 2020

View full text Add to dashboard Cite

Heterogeneous Hybrid Transactional Analytical Processing (H 2 TAP) database systems have been developed to match the requirements for low latency analysis of real-time operational data. Due to technical challenges, these systems are hard to architect, non-trivial to engineer, and complex to administrate. Current research has proposed excellent solutions to many of those challenges in isolation -a unified engine enabling to optimize performance by combining these solutions is still missing. In this concept paper, we suggest a highly flexible and adaptive data structure (called GRIDTABLE) to physically organize sparse but structured records in the context of H 2 TAP. For this, we focus on the design of an efficient highly-flexible storage layout that is built from scratch for mixed query workloads. The key challenges we address are:(1) partial storage in different memory locations, and (2) the ability to optimize for mixed OLTP-/OLAP access patterns. To guarantee safe and well-specified data definition or manipulation, as well as fast querying with no compromises on performance, we propose two dedicated access paths to the storage. In this paper, we explore the architecture and internals of GRIDTABLES showing design goals, concepts and trade-offs. We close this paper with open research questions and challenges that must be addressed in order to take advantage of the flexibility of our solution.

show abstract

Scalability Provisioning

Randhawa

2022

Mobile Applications

View full text Add to dashboard Cite

Hybrid Transactional/Analytical Processing

Cited by 67 publications

References 13 publications

A Comparative Study of Consistent Snapshot Algorithms for Main-Memory Database Systems

A Comparative Study of Consistent Snapshot Algorithms for Main-Memory Database Systems

GridTables: A One-Size-Fits-Most H2TAP Data Store

Scalability Provisioning

Contact Info

Product

Resources

About