Object-oriented kernel layer database

Abstract

The invention relates to an object-oriented kernel layer database, and the database is characterized in that when the database runs, all data is stored in a memory allocated by a kernel layer; the database is object-oriented and is uniformly described by an architecture definition; an access unit of the database is an object and an object attribute, and the database comprises an interface layer, wherein the interface layer is is used for receiving and processing an access request and a structured query request of an object; a logic layer which is used for realizing object access, wherein the operation on the object is based on an object identifier, and the object identifier can be calculated and converted into an object pointer of a programming language; a physical layer which is used for realizing data access of objects and object attributes, wherein the physical layer is also used for storing a global index table, the global index table is used for establishing a path index of a specific type of object, and the physical layer is also used for realizing persistent storage of the object data and the object attribute data. Therefore, storage and query requirements on complex objects in a kernel scene are met, and the access efficiency is improved.

Description

technical field [0001] The present disclosure relates to the technical field of information security, and in particular to an object-oriented 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 significantly improved, for exam...

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