A Construction Method of Object-Oriented Kernel Layer Database

Abstract

The present disclosure relates to a construction method of an object-oriented kernel layer database, which is characterized in that, when the database is running, all data is stored in the memory allocated by the kernel layer, the database is object-oriented, and is uniformly described by an architecture definition, The access unit of the database is the object and the object attribute. The database includes: the interface layer, which is used to receive and process the access request of the object and the structured query request; the logic layer, which is used to realize the access of the object; among them, the operation of the object It is based on object identification, which can be calculated and converted into an object pointer in a programming language; the physical layer is used to realize data access of objects and object attributes; the physical layer is also used to store global index tables, which are used to establish specific The path index of type objects; the physical layer is also used to realize the persistent storage of object data and object attribute data. As a result, it meets the storage and query requirements for complex objects in the kernel scenario and improves access efficiency.

Description

technical field [0001] The present disclosure relates to the technical field of information security, and in particular to an object-oriented construction method of a kernel layer database. Background technique [0002] At present, most operating systems do not provide general database support at the kernel layer. However, when the core functions of some products are implemented in the kernel mode, typically there are host security products (such as file protection, host firewall and other products, whose core functions are all implemented in the kernel layer), there may be demand for databases , such as storing file information, black and white lists of URLs. [0003] In related technologies, for simple data structures in programs, for example, developers use commonly used data structures such as linked lists, hash tables, and arrays to access data. However, when there are more complex requirements for databases, this hard-coded development method costs It will be signifi...

AI Technical Summary

Problems solved by technology

[0003] In related technologies, for simple data structures in programs, for example, developers use commonly used data structures such as linked lists, hash tables, and arrays to access data. However, when there are more complex requirements for databases, this hard-coded development method costs It will be significantly improved, for example, when it is necessary to maintain the relationship between objects, when it is necessary to support multiple types of queries, when the structure of objects changes frequently; or when implementing a general-purpose database at the application layer, when the kernel layer has data access requirements When the request is forwarded from the kernel layer to the application layer, the cost is high and the callback is still limited by the interrupt level. For example, in the process of network reception processing, it will occur at a higher interrupt level. At this time, the synchronization object is not available, and the flexibility poor, low usability

Images