High-concurrency storage device
A storage device and storage structure technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve problems such as not being able to meet high-speed access efficiency, and achieve the goal of improving write efficiency, reducing delay, and reducing coupling Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0027] This device is a non-relational database system based on a memory database of shared memory. The general structure of the device is as follows figure 1 As shown, the device externally provides the main functional interface of the database such as adding, deleting, checking and modifying, and accesses key-value pair (key-value) data.
[0028] Specifically, the high-concurrency storage device includes a unified access interface 101 for an application program to perform access operations, and a storage structure unit 102 for an extended database storage engine. This device does not provide port monitoring and network access, but directly provides a unified access interface 101 for processes.
[0029] More specifically, the unified access interface 101 includes an update interface 1011 and an accumulation interface 1012 . The application program can be operated through the corresponding interface. The unified access interface 101 not only improves the scalability of the p...
Embodiment 2
[0048] The difference between this embodiment and the foregoing embodiments lies in that this embodiment is the processing principle and process of the accumulation operation. The accumulation operation refers to the atomic addition of a value. For example, the value of the key (key) stored in the database is 10, and the value of the key becomes 15 after calling the accumulation interface whose key value (key) is 5.
[0049] Specifically, the accumulation interface first follows the figure 2 The process of fragmentation is performed, and the accumulation process is similar to the query process, and no mutex is required.
[0050] Such as Figure 5 As shown, the reference count pointer 502 of the bucket location is first obtained according to the accumulation request 501 . For the convenience of description, temporarily name the obtained reference count pointer as A, and the pointer at the bucket position as B. Although they seem to be the same pointer, different situations ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com