Towards Scalable and Reliable In-Memory Storage System: A Case Study with Redis

Chen, Shanshan; Tang, Xiaoxin; Wang, Hongwei; Zhao, Han; Guo, Minyi

doi:10.1109/trustcom.2016.0255

Cited by 44 publications

(11 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The recovery process efficiently replicated data from various slave servers. [28] designed a masterslave semi synchronization scheme. The scheme recorded the full replication of data on slave nodes and reduced the influence on the performance of Redis by TCP protocol.…”

Section: Related Workmentioning

confidence: 99%

Incremental Checkpointing for Fault-Tolerant Stream Processing Systems: A Data Structure Approach

Lin

Wang

Chang

2022

IEEE Trans. Emerg. Topics Comput.

View full text Add to dashboard Cite

As the demand of high-speed stream processing grows, in-memory databases are widely used to analyze streaming data. It is challenging for in-memory systems to meet the requirements of high throughput and data persistence at the same time since data are not stored in disks. ARIES logging and command logging are two popular logging methods. In current applications, both ARIES logging and command logging are necessary. However, no checkpointing mechanism includes both the functions of ARIES logging method and command logging method. Besides, adopting ARIES logging method in an in-memory database creates high overhead. Command logging records redundant commands and has high storage cost. To address the above issues, we utilize order-irrelevant characteristics of data structure and incremental checkpointing concepts to devise a data structure based incremental checkpointing (DSIC) mechanism. DSIC mechanism is a very low overhead checkpointing approach while retaining the features of ARIES logging and command logging. DSIC mechanism reduces more than 70% logging time of the existing logging scheme and saves 40% storage costs of the existing logging scheme.

show abstract

Section: Related Workmentioning

confidence: 99%

Incremental Checkpointing for Fault-Tolerant Stream Processing Systems: A Data Structure Approach

Lin

Wang

Chang

2022

IEEE Trans. Emerg. Topics Comput.

View full text Add to dashboard Cite

show abstract

“…This associative index is also required for speeding up the retrieval process with a minimized number of disk reads and writes. In this situation, Redis cache strategy is identified to be excellent in attaining fast block file indexing 28 . This Redis cache is a key‐value‐based high‐performance memory, mainly used for handling the issues of data processing timeliness during high concurrency degree visualized in relation databases, since they are potential in the operation of in‐memory.…”

Section: The Proposed Rs‐imtmcb‐pir Schemementioning

confidence: 99%

Ring signature and improved multi‐transaction mode consortium blockchain‐based private information retrieval for privacy‐preserving smart parking system

Singh

Satish

Lakshmi³

2021

Int J Communication

View full text Add to dashboard Cite

Summary In big cities, the drivers face a major problem in identifying an optimal vacant parking space for their vehicles as the number of vehicles has rapidly grown over the recent years. This objective of determining the available parking space results in wastage of time, air pollution, and traffic congestion. Smart parking systems facilitate the driver to book parking slots and attain real‐time parking information. However, the existing smart parking solutions necessitate the disclosure of sensitive information like desired destination from the vehicle drivers. Moreover, the current smart parking solutions are highly centralized, making them vulnerable for launching privacy breaches by service providers and resulting in the issues of single‐point failure. In this paper, ring signature and improved multi‐transaction mode consortium blockchain‐based private information retrieval (RS‐IMTMCB‐PIR) scheme is proposed for privacy preserving in smart parking system. This RS‐IMTMCB‐PIR scheme initially utilizes an improved multi‐transaction mode consortium blockchain constructed by different number of parking lot owners in order to achieve maximized parking offers based on the factor of availability, transparency, and security. It incorporates an improved private information retrieval approach for protecting the location privacy of drivers and secretly retrieving the offers of parking from the improved multi‐transaction mode consortium blockchain. It further utilizes the benefits of ring signature for permitting the drivers in a potential anonymous authentication process that aids in available parking slot reservation. The simulation results of this proposed RS‐IMTMCB‐PIR scheme portrayed a predominant performance in ensuring maximized degree of drivers' privacy with reduced computation and communication overheads.

show abstract

“…Because of its pure in-memory operation, Redis has excellent read and write performance. Throughputs of more than 100,000 read and write operations per second have been recorded [18]. Redis provides rich data types, including linked lists (List), strings (String), sets (Set) and ordered sets (Zset).…”

Section: Redis Cache Technologymentioning

confidence: 99%

An Improved Retrieval Method for Multi-Transaction Mode Consortium Blockchain

Zhang

Chen

et al. 2020

Electronics

View full text Add to dashboard Cite

The traditional method of blockchain retrieval is to search the "Block File" in sequence from the "tail" to the "head" of the blockchain, which always takes a lot of time. How to reduce the retrieval time has been a hot issue in blockchain research. This paper proposes a fast retrieval method for the Multi-Transaction Mode Consortium Blockchain (MTMCB). Firstly, we create a "User Set" and "Block Name Set" cached in Redis. Then, according to the transaction participants and "Block Name Set", we can get the relevant "Block Name List", and quickly obtain the corresponding block files. On this basis, in order to meet the needs of rapid retrieval in large-scale systems, an improved retrieval algorithm based on a B+-tree data structure is proposed. Firstly, the block file information is put into different ordered sets according to the transaction participants, and the B+-tree index is established to quickly get the information of relevant block files by participants. Experimental results show that the improved method of Redis cache retrieval in this paper can greatly increase the efficiency of blockchain retrieval, and can settle some crucial problem in the blockchain application and popularization.

show abstract

Towards Scalable and Reliable In-Memory Storage System: A Case Study with Redis

Cited by 44 publications

References 25 publications

Incremental Checkpointing for Fault-Tolerant Stream Processing Systems: A Data Structure Approach

Incremental Checkpointing for Fault-Tolerant Stream Processing Systems: A Data Structure Approach

Ring signature and improved multi‐transaction mode consortium blockchain‐based private information retrieval for privacy‐preserving smart parking system

An Improved Retrieval Method for Multi-Transaction Mode Consortium Blockchain

Contact Info

Product

Resources

About