Let's talk in depth about double linked lists in Redis-Redis-php.cn

Home

Database

Redis

Let's talk in depth about double linked lists in Redis

青灯夜游

Dec 01, 2021 am 09:53 AM

redisdata structure

This article will take you to understand the double-linked list in the Redis data structure, and briefly introduce the use of double-linked lists. I hope it will be helpful to everyone!

Let's talk in depth about double linked lists in Redis

In the list list of the Redis data type, the commonly used commands for adding and deleting data are lpush, rpush, lpop, rpop, among which l It means on the left side, r means on the right side. You can add and delete operations on the left and right sides, indicating that this is a two-way data structure, and the list data structure is a doubly linked list, similar to the LinekdList in Java. [Related recommendations: Redis Video Tutorial]

The linked list provides efficient node rearrangement capabilities and sequential node access methods. The data of the linked list can be modified by modifying the pre and next pointers of the nodes. .

The C language does not have a built-in linked list data structure, so Redis builds its own linked list structure.

Data structure of linked list, linked list and linked list nodes

The linked list is composed of linked list and linked list nodes. Each linked list node is represented by a adlist.h/listNode structure :

typedef struct listNode {
    //前置节点
    struct listNode *prev;
    //后置节点
    struct listNode *next;
    // 节点值
    void *value;
} listNode;

Multiple listNodes can form a double linked list through prev and next pointers, as shown in the title:

Lets talk in depth about double linked lists in Redis

##Multiple listNodes can form a linked list, but in order To facilitate management, use

adlist.h/list to manage the linked list. The list structure is as follows:

typedef struct list {
    // 列表头结点
    listNode *head;
    // 列表尾结构
    listNode *tail;
    // 节点值复制函数
    void *(*dup)(void *ptr);
    // 节点值释放函数
    void (*free)(void *ptr);
    // 节点值对比函数 
    int (*match)(void *ptr, void *key);
    // 列表节点数量
    unsigned long len;
} list;

list structure provides the head pointer head, the tail pointer tail, and the node number calculation len for the linked list. . The following figure shows a linked list consisting of a list structure and three listNode nodes:

Lets talk in depth about double linked lists in Redis

The characteristics of the Redis linked list implementation are summarized as follows:

Quickly calculate the length of the linked list: Calculate the length of the list through the len attribute in the list structure, and the time complexity is O(1)
Polymorphism: Linked list nodes use void* pointers to save nodes, so linked lists support saving various types of values

Use of double linked lists

List keys, Publish and subscribe, slow queries, monitors, etc.

Summary

The linked list nodes have a front and rear pointers. , so the linked list of Redis is a two-way linked list
The linked list can store the head node and the tail node to better manage its own nodes. The len attribute can quickly calculate the length of the linked list
The linked list passes void* And different type setting functions, so the linked list can have different types of values

For more programming-related knowledge, please visit:

Introduction to Programming! !

The above is the detailed content of Let's talk in depth about double linked lists in Redis. For more information, please follow other related articles on the PHP Chinese website!

Statement

This article is reproduced at:掘金社区. If there is any infringement, please contact admin@php.cn delete

Redis: Improving Application Performance and ScalabilityApr 17, 2025 am 12:16 AM

Redis improves application performance and scalability by caching data, implementing distributed locking and data persistence. 1) Cache data: Use Redis to cache frequently accessed data to improve data access speed. 2) Distributed lock: Use Redis to implement distributed locks to ensure the security of operation in a distributed environment. 3) Data persistence: Ensure data security through RDB and AOF mechanisms to prevent data loss.

Redis: Exploring Its Data Model and StructureApr 16, 2025 am 12:09 AM

Redis's data model and structure include five main types: 1. String: used to store text or binary data, and supports atomic operations. 2. List: Ordered elements collection, suitable for queues and stacks. 3. Set: Unordered unique elements set, supporting set operation. 4. Ordered Set (SortedSet): A unique set of elements with scores, suitable for rankings. 5. Hash table (Hash): a collection of key-value pairs, suitable for storing objects.

Redis: Classifying Its Database ApproachApr 15, 2025 am 12:06 AM

Redis's database methods include in-memory databases and key-value storage. 1) Redis stores data in memory, and reads and writes fast. 2) It uses key-value pairs to store data, supports complex data structures such as lists, collections, hash tables and ordered collections, suitable for caches and NoSQL databases.

Why Use Redis? Benefits and AdvantagesApr 14, 2025 am 12:07 AM

Redis is a powerful database solution because it provides fast performance, rich data structures, high availability and scalability, persistence capabilities, and a wide range of ecosystem support. 1) Extremely fast performance: Redis's data is stored in memory and has extremely fast read and write speeds, suitable for high concurrency and low latency applications. 2) Rich data structure: supports multiple data types, such as lists, collections, etc., which are suitable for a variety of scenarios. 3) High availability and scalability: supports master-slave replication and cluster mode to achieve high availability and horizontal scalability. 4) Persistence and data security: Data persistence is achieved through RDB and AOF to ensure data integrity and reliability. 5) Wide ecosystem and community support: with a huge ecosystem and active community,

Understanding NoSQL: Key Features of RedisApr 13, 2025 am 12:17 AM

Key features of Redis include speed, flexibility and rich data structure support. 1) Speed: Redis is an in-memory database, and read and write operations are almost instantaneous, suitable for cache and session management. 2) Flexibility: Supports multiple data structures, such as strings, lists, collections, etc., which are suitable for complex data processing. 3) Data structure support: provides strings, lists, collections, hash tables, etc., which are suitable for different business needs.

Redis: Identifying Its Primary FunctionApr 12, 2025 am 12:01 AM

The core function of Redis is a high-performance in-memory data storage and processing system. 1) High-speed data access: Redis stores data in memory and provides microsecond-level read and write speed. 2) Rich data structure: supports strings, lists, collections, etc., and adapts to a variety of application scenarios. 3) Persistence: Persist data to disk through RDB and AOF. 4) Publish subscription: Can be used in message queues or real-time communication systems.

Redis: A Guide to Popular Data StructuresApr 11, 2025 am 12:04 AM

Redis supports a variety of data structures, including: 1. String, suitable for storing single-value data; 2. List, suitable for queues and stacks; 3. Set, used for storing non-duplicate data; 4. Ordered Set, suitable for ranking lists and priority queues; 5. Hash table, suitable for storing object or structured data.

How to implement redis counterApr 10, 2025 pm 10:21 PM

Redis counter is a mechanism that uses Redis key-value pair storage to implement counting operations, including the following steps: creating counter keys, increasing counts, decreasing counts, resetting counts, and obtaining counts. The advantages of Redis counters include fast speed, high concurrency, durability and simplicity and ease of use. It can be used in scenarios such as user access counting, real-time metric tracking, game scores and rankings, and order processing counting.

See all articles