Multi-process access memory database system

A database and multi-process technology, applied in the field of multi-process access to memory database systems, can solve problems such as the inability to meet high-speed access efficiency, and achieve the effects of improving writing efficiency, reducing latency, and reducing coupling.

Inactive Publication Date: 2015-12-30
BEIJING MEISHU INFORMATION TECH
View PDF4 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Non-relational databases can access unstructured data, and the speed has been greatly improved compared with

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Multi-process access memory database system
  • Multi-process access memory database system
  • Multi-process access memory database system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0036] This system is a non-relational database system based on a shared-memory in-memory database. The general structure of the system is as follows figure 1 As shown in the figure, the system provides an interface for adding, deleting, modifying and other main functions of the database to access data of the key-value pair (key-value) type.

[0037] Specifically, the multi-process access memory database system includes a unified access interface 101 for application programs to perform access operations, and a storage structure unit 102 for extending the database storage engine. This system does not provide port monitoring and network access, but directly provides a unified access interface 101 for processes.

[0038] More specifically, the unified access interface 101 includes an insert interface 1011 , a delete interface 1012 , and an update interface 1013 . The application program can be operated through the corresponding interface. The unified access interface 101 not on...

Embodiment 2

[0054] The difference between this embodiment and the above-mentioned embodiment is that this embodiment is the principle and process of executing the deletion request for the user, such as Figure 5 shown.

[0055] The delete operation first requires a mutex service, and the process is as follows image 3 As shown, it will not be repeated here. After acquiring the lock, there will be no other additions, deletions, or modifications at the same time. Traverse all key-value pairs (key-value) in bucket position 501 to find out whether the key to be deleted exists. If the target key is not found in step 502, immediately release the lock 503 and exit, and this deletion operation fails. If the target key is found in step 504 and exists, the value pointer 505 to be deleted is obtained, and the update bit is set 506 .

[0056] The update bit is then set to flag the query operation, as described above. At this time, step 507 is executed to delete the target key at the bucket locati...

Embodiment 3

[0059] The difference between this embodiment and the above-mentioned embodiment is that this embodiment is the principle and process of performing an update request for the user, such as Figure 6 shown.

[0060] The update process is similar to the delete process. When the user initiates an update request, the mutex service is first performed. The process is as follows image 3 As shown, it will not be repeated here.

[0061] Traversing all key-value pairs in the bucket location, if the key does not exist, release the lock and end the update process. After obtaining the current value pointer 601, update the value pointer 602 at the target key position, but the previous value pointer cannot be released at this time, and there may be a query operation in use, and then the update bit is set 603. Then obtain the reference count pointer 604, update the reference count pointer 605, and execute step 606, wait for the reference count pointer to return to 0, and then release the re...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a multi-process access memory database system. The system comprises a unified access interface and a storage structure unit. Application programs conduct access operation through the unified access interface, and the storage structure unit expands a database storage engine. Shared memory allocation management is adopted for memory allocation in the storage structure unit. The system conducts fragmentation processing on data in the unified access interface in advance. The system is a data management system with the low delay, high concurrency and high throughout, the single-query delay is shorter than 1 ms, and qps can reach 500000 when reading and writing of 20 processes are performed at the same time.

Description

technical field [0001] The invention relates to a memory database system, in particular to a multi-process access memory database system. Background technique [0002] Existing databases are divided into relational and non-relational databases. Relational databases are convenient for storing structured data and support complex queries and data analysis, but the query speed is slow. [0003] With the rise of Internet web2.0 websites, traditional relational databases are unable to cope with web2.0 websites, especially ultra-large-scale and high-concurrency SNS-type web2.0 purely dynamic websites, and many insurmountable problems have been exposed. The non-relational database has developed very rapidly due to its own characteristics. The emergence of NoSQL database is to solve the challenges brought by multiple data types of large-scale data collections, especially the big data application problems. [0004] Non-relational databases can access unstructured data, and the spee...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/30
CPCG06F16/22G06F16/21
Inventor 周盛宽
Owner BEIJING MEISHU INFORMATION TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap