A Survey on Epoch-based In-Memory Database Systems
- Authors
- Nguyen, Lan Anh; Lee, Sangjin; Lee, Hyung Tae; Son, Yongseok
- Issue Date
- Jan-2024
- Publisher
- IEEE Computer Society
- Keywords
- big data; epoch-based mechanisms; In-memory database; storage engine
- Citation
- International Conference on ICT Convergence, v.2023 14th, pp 788 - 792
- Pages
- 5
- Journal Title
- International Conference on ICT Convergence
- Volume
- 2023 14th
- Start Page
- 788
- End Page
- 792
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/72884
- DOI
- 10.1109/ICTC58733.2023.10393799
- ISSN
- 2162-1233
- Abstract
- In-memory databases has emerged as the most favorable modern database replacing with traditional ones to sufficiently handle with storing, retrieving, and processing large collections of data in big data applications. High speed in storing, retrieving, processing of in-memory databases makes itself outperform classic databases and becomes the most prominent database nowadays. However, along with rapid growth of collected data from intensive-workload applications, in-memory databases should achieve an exceptional scalability to deal with the huge amounts of received data. In addition, they must overcome their internal disadvantages regarding to durability and persistence. Epoch-based mechanisms are suitable solutions for scalability, durability, and persistence issues, while maintaining excellent performance in speed of in-memory databases. This study provides a survey of epoch-based in-memory databases in terms of their database management architecture, classification of epoch-based mechanisms used in, and current developments of epoch-based in-memory database systems. © 2023 IEEE.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/72884)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.