CN114064662A - Method, device, electronic equipment and medium for querying data - Google Patents
Method, device, electronic equipment and medium for querying data Download PDFInfo
- Publication number
- CN114064662A CN114064662A CN202210035137.5A CN202210035137A CN114064662A CN 114064662 A CN114064662 A CN 114064662A CN 202210035137 A CN202210035137 A CN 202210035137A CN 114064662 A CN114064662 A CN 114064662A
- Authority
- CN
- China
- Prior art keywords
- target
- node
- storage interval
- sub
- target node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses a method, a device, electronic equipment and a medium for querying data. In the method, when a data reading instruction of a target user for a target service is received, a target node storing target service data can be determined in a target database; determining a total storage interval address contained in the database by the target node, wherein the total storage interval address is an address which is allocated to the target node by the target database and is used for storing data; and based on the authority level of the target user, calling data required by the target service from the total storage interval address of the target database.
Description
Technical Field
The present application relates to data processing technologies, and in particular, to a method, an apparatus, an electronic device, and a medium for querying data.
Background
With the development of communication technology and the internet, data is growing explosively. It follows that data storage and processing techniques become particularly important to cope with the case of massive data.
Further, big data processing and analyzing technologies are increasingly applied to various industries, and for business operation and maintenance personnel, when storing data, a common tree structure is usually used in a tree structure database to identify the association relationship of the data. When the operation and maintenance personnel need to call the data of a certain node, the database can show the data needing to be inquired to the user according to the pre-identified association relation.
However, the method in the related art may traverse all data in the database when data is read under the condition of a large amount of data, and this way may cause a great pressure on the database, resulting in a decrease in data reading efficiency.
Disclosure of Invention
The embodiment of the application provides a method, a device, electronic equipment and a medium for querying data, which are used for solving the problem that the data are accessed under the condition of large data volume in a database and the problem of large operation pressure on the database in the related technology.
According to an aspect of an embodiment of the present application, there is provided a method for querying data, including:
when a data reading instruction of a target user for a target service is received, determining a target node in which the target service data is stored in a target database;
determining a total storage interval address contained in a database by the target node, wherein the total storage interval address is an address which is allocated to the target node by the target database and is used for storing data;
and based on the authority level of the target user, calling data required by the target service from the total storage interval address of the target database.
Optionally, in another embodiment based on the foregoing method of the present application, before the receiving a data query instruction for a target service, the method further includes:
when an instruction of creating the target node in the target database is received, acquiring the number of associated child nodes of the target node, wherein the number of the child nodes is at least two;
and distributing the total storage interval address for the target node and the associated sub-nodes in the target database based on the number of the associated nodes of the target node and the weight coefficients corresponding to the target node and the associated sub-nodes.
Optionally, in another embodiment based on the foregoing method of the present application, after the obtaining the number of associated nodes of the target node, the method further includes:
determining service parameters associated with the target node, wherein the service parameters correspond to service types and service data capacity;
and determining the weight coefficient distributed to the target node and the associated child node based on the service parameter associated with the target node.
Optionally, in another embodiment based on the foregoing method of the present application, the total storage interval address is allocated to the target node by using the following formula:
N=（（A-B）*2+1）/C
wherein, N is the total storage interval address of the target node, A and B are the associated sub-nodes of the target node, and C is the average value of the weight coefficients distributed by the target node and the associated sub-nodes.
Optionally, in another embodiment based on the foregoing method of the present application, the allocating, in the target database, the total storage interval address for the target node and the associated child node includes:
dividing the total storage interval address of the node into at least two sub-storage interval addresses in a preset mode;
taking at least any one sub-storage interval address in the at least two sub-storage interval addresses as a total storage interval address corresponding to a superior sub-node of the target node; and the number of the first and second groups,
and taking at least one other sub-storage interval address in the at least two sub-storage interval addresses as a total storage interval address corresponding to a subordinate sub-node of the target node.
Optionally, in another embodiment based on the foregoing method of the present application, after dividing the total storage interval address of the node into at least two sub-storage interval addresses in a preset manner, the method further includes:
and when detecting that at least any one of the at least two sub storage interval addresses is occupied by other nodes and/or the number of the sub storage interval addresses is larger than a preset threshold value, carrying out capacity expansion on the target node.
Optionally, in another embodiment based on the foregoing method of the present application, after dividing the total storage interval address of the node into at least two sub-storage interval addresses in a preset manner, the method further includes:
distributing the associated service of a first authority level to the superior child node of the target node; and the number of the first and second groups,
and distributing the associated service of the second permission level to the subordinate child nodes of the target node.
According to another aspect of the embodiments of the present application, there is provided an apparatus for querying data, including:
the receiving module is configured to determine a target node in a target database, wherein the target node stores target service data, when a data reading instruction of a target user for a target service is received;
a determining module, configured to determine a total storage interval address included in a database by the target node, where the total storage interval address is an address allocated by the target database for the target node and used for storing data;
and the calling module is configured to call the data required by the target service from the total storage interval address of the target database based on the authority level of the target user.
According to another aspect of the embodiments of the present application, there is provided an electronic device including:
a memory for storing executable instructions; and
a display for displaying with the memory to execute the executable instructions to perform the operations of any of the above-described methods for querying data.
According to a further aspect of the embodiments of the present application, there is provided a computer-readable storage medium for storing computer-readable instructions, which when executed, perform the operations of any one of the above methods for querying data.
In the method, when a data reading instruction of a target user for a target service is received, a target node storing target service data can be determined in a target database; determining a total storage interval address contained in the database by the target node, wherein the total storage interval address is an address which is allocated to the target node by the target database and is used for storing data; and based on the authority level of the target user, calling data required by the target service from the total storage interval address of the target database. By applying the technical scheme of the application, corresponding sub-storage interval addresses can be respectively allocated to each node and the sub-nodes related to the node in the database in advance, wherein different sub-storage interval addresses correspond to reading authorities with different authority levels, so that a user can firstly select the corresponding node according to the service type when reading the service data subsequently, and can directly call the corresponding service data from the sub-storage interval address corresponding to the reading authority in the node according to the authority level of the user. In addition, the method and the device can also determine the weight coefficient allocated to the target node according to the service parameters corresponding to the service type and the service data capacity and associated with each node, so that the size of the storage space address allocated to the node is determined according to the weight coefficient subsequently. Therefore, the operating pressure caused by traversing the database when data is read in the related technology is reduced, and the query efficiency is improved.
The technical solution of the present application is further described in detail by the accompanying drawings and examples.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the application and together with the description, serve to explain the principles of the application.
The present application may be more clearly understood from the following detailed description with reference to the accompanying drawings, in which:
fig. 1 is a schematic diagram of a method for querying data according to the present application;
fig. 2 is a flow chart of data query proposed in the present application;
fig. 3 is a schematic structural diagram of an electronic device for querying data according to the present application;
fig. 4 is a schematic structural diagram of an electronic device for querying data according to the present application.
Detailed Description
Various exemplary embodiments of the present application will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, the numerical expressions, and numerical values set forth in these embodiments do not limit the scope of the present application unless specifically stated otherwise.
Meanwhile, it should be understood that the sizes of the respective portions shown in the drawings are not drawn in an actual proportional relationship for the convenience of description.
The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the application, its application, or uses.
Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.
In addition, technical solutions between the various embodiments of the present application may be combined with each other, but it must be based on the realization of the technical solutions by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, such a combination of technical solutions should be considered to be absent and not within the protection scope of the present application.
It should be noted that all the directional indicators (such as upper, lower, left, right, front and rear … …) in the embodiment of the present application are only used to explain the relative position relationship between the components, the motion situation, etc. in a specific posture (as shown in the drawings), and if the specific posture is changed, the directional indicator is changed accordingly.
A method for querying data according to an exemplary embodiment of the present application is described below in conjunction with fig. 1-2. It should be noted that the following application scenarios are merely illustrated for the convenience of understanding the spirit and principles of the present application, and the embodiments of the present application are not limited in this respect. Rather, embodiments of the present application may be applied to any scenario where applicable.
The application also provides a method, a device, a target terminal and a medium for inquiring data.
Fig. 1 schematically shows a flowchart of a method for querying data according to an embodiment of the present application. As shown in fig. 1, the method includes:
s101, when a data reading instruction of a target user for a target service is received, a target node storing target service data is determined in a target database.
Firstly, when a data reading instruction of a target user for a target service is received, a target node storing the target service data is determined in a target database, wherein the target node is associated with at least two sub-nodes in the target database.
In the application, when a data reading instruction of a target user for a certain service is received, a target node of a database where the service data is located and a child node associated with the target node are determined. So that the corresponding service data can be directly searched in the total storage interval address corresponding to the target node and the child node associated with the target node.
It should be noted that the database in the present application may be a database having a tree data structure. Therein, a tree data structure is an important type of non-linear data structure. The tree data structure may represent a one-to-many relationship between data table elements. The tree and the binary tree are most commonly used, and the tree is a hierarchical structure defined by a branch relation in an intuitive view. The method is characterized in that a set with a hierarchical relationship is formed by N limited nodes. It is called a "tree" because it looks like an inverted tree, i.e., it is root up and leaf down. It has the following characteristics: each node has zero or more child nodes; nodes without parents are called root nodes; each non-root node has only one father node; each child node, except the root node, may be divided into a plurality of disjoint sub-trees.
The target node is not specifically limited in the present application, and may be, for example, a parent node, a child node, or the like.
In one approach, the data read instruction may include: the flag field interval to be queried, and the type of summarized data to be queried. Query statements, and so on. E.g., sum, avg, min (minimum), max (maximum). Further, in particular Column1, Column2 … … Column may represent fields to be queried, such as amount, quantity. FuncN and ColumnN work together to indicate the type of summary data to be queried. Index indicates the flag field to be queried, such as order number, order time. The statement behind the Where represents the record of the query index in a certain interval, namely the interval of the flag field to be queried, and can formally support the query interval in any form.
S102, determining a total storage interval address contained in the database by the target node, wherein the total storage interval address is an address which is distributed by the target database for the target node and is used for storing data.
In one mode, according to a pre-stored node storage interval list, determining a total storage interval address, which is pre-allocated by a target database for the target node and is used for storing service data, where the total storage interval address includes a first sub-storage interval address corresponding to the target node and sub-storage interval addresses to be compared corresponding to the sub-nodes, and each sub-storage space address stores service data with different read permissions;
and S103, based on the authority level of the target user, calling data required by the target service from the total storage interval address of the target database.
In one mode, the method can detect the authority level of a target user, and determine a target sub-storage interval address corresponding to the authority level, wherein the target sub-storage interval address is one of the first sub-storage interval address or the sub-storage interval address to be compared;
and calling target service data required by the target service from the target sub-storage interval address of the target database.
Furthermore, one or more sub-storage interval addresses can be allocated to each node and the sub-nodes associated with the node in the target database in advance, wherein different sub-storage interval addresses can store data with different authority levels, so that a user can directly inquire and acquire the data from the corresponding sub-storage interval addresses (partial storage space addresses in the total storage interval address) according to the authority levels of the user when inquiring specific data subsequently. Therefore, the operation pressure of the database is reduced, and the query efficiency is improved.
In one mode, if the permission level of the target user is the highest level, the sub-storage space with the highest read permission level may be selected from the total storage interval addresses included in the database by the target node to read data. And the data can be read from the sub-storage spaces with other read permission levels.
In one mode, the target database mentioned in the present application may be a tree-structured database, or may be a non-tree-structured database. Wherein for tree structured data, each root node it exists and the root node associated therewith can be utilized as a target node and child nodes associated therewith.
For a non-tree structured database, for example, a distributed storage database may be used. In this scenario, the server cluster corresponding to each area where the server cluster exists or the server cluster corresponding to each service type may be used as the target node and the child node associated with the target node. It will be appreciated that using multiple servers within the same server cluster as the target node and its associated child nodes may ensure that the traffic data types for which each node is responsible are the same.
For example, the target node a is associated with an upper-level child node B and a lower-level child node C, and the database is previously allocated with a first sub-memory space address for the target node a, a second sub-memory space address for the upper-level child node B and a third sub-memory space address for the lower-level child node C. The first sub-memory space address, the second sub-memory space address and the third sub-memory space address jointly constitute a total memory space address allocated to the target node.
It can be understood that the first sub-memory space address, the second sub-memory space address and the third sub-memory space address all store the service data of the same service type. However, the reading authority level corresponding to each node is different, so that the specific service data in each sub-storage space address is also different. For example, the first sub-memory space address stores general service data, the second sub-memory space address stores private service data, and the third sub-memory space address stores public service data. It can be understood that, for the way of separately storing the data with different privacy degrees, it is not only convenient to make corresponding calls with the permission levels of different users subsequently. The privacy of the private data can be increased, so that the risk that the private data is easily stolen because the private business data is also provided for the low-authority user when the public business data is viewed is avoided.
Further, when receiving a data reading instruction of a target user for a target service, the present application first needs to determine a target node a storing service data corresponding to the target service in a database, where the target node a is associated with an upper-level child node B and a lower-level child node C.
Further, the method and the device for determining the total storage interval address of the target node a in the database may determine the total storage interval address pre-allocated to the target node a by the database according to a pre-stored node storage interval list, where the total storage interval address includes a first sub-storage space address, a second sub-storage space address, and a third sub-storage space address.
In addition, in the embodiment of the present application, the authority level of the target user may also be detected, and a reading authority level corresponding to the authority level of the user is determined (for example, private service data may be read, public service data may be read, and the like). And determining which sub-storage space address needs to be read at this time based on the reading permission level.
Finally, the target service data required by the target service can be called from the determined read sub-storage space address. It can be understood that a user with a high permission level may invoke the service data stored in any one of the sub-storage space addresses, or may specify to invoke the service data stored in the sub-storage space address corresponding to the highest permission level.
In one approach, the user's privilege level may be pre-configured based on the user's administrative identity. In another mode, since the permission levels of the users are changed in real time, in order to avoid the disadvantage that the private service data is displayed for the expired high-permission user, in the embodiment of the present application, when a data reading instruction of the target user for the target service is received, the attribute parameter of the target user may also be called, and the permission level of the user is determined according to the attribute parameter. For example, the attribute parameter may be a user's historical access data type, historical access data amount, whether the user is in a permission level white list, and the like. And after the authority level of the target user is determined, reading the service data from the corresponding sub-storage space address.
By applying the technical scheme of the application, corresponding sub-storage interval addresses can be respectively allocated to each node and the sub-nodes related to the node in the database in advance, wherein different sub-storage interval addresses correspond to reading authorities with different authority levels, so that a user can firstly select the corresponding node according to the service type when reading the service data subsequently, and can directly call the corresponding service data from the sub-storage interval address corresponding to the reading authority in the node according to the authority level of the user. In addition, the method and the device can also determine the weight coefficient allocated to the target node according to the service parameters corresponding to the service type and the service data capacity and associated with each node, so that the size of the storage space address allocated to the node is determined according to the weight coefficient subsequently.
It can be understood that, on one hand, the data reading method provided by the present application can specifically retrieve data from the storage space in which the permission level and the service type data are stored according to the permission level of the user and the type of the read service data. And further, the problem of operation pressure caused by traversing the database when reading data in the related technology is reduced, and on the other hand, the problem of safety risk of the database caused by providing high-risk service data for low-risk users when viewing the low-risk service data can be avoided.
Optionally, in another embodiment based on the foregoing method of the present application, before the receiving a data query instruction for a target service, the method further includes:
when an instruction of creating the target node in the target database is received, acquiring the number of associated child nodes of the target node, wherein the number of the child nodes is at least two;
and distributing the total storage interval address for the target node and the associated sub-nodes in the target database based on the number of the associated nodes of the target node and the weight coefficients corresponding to the target node and the associated sub-nodes.
Optionally, in another embodiment based on the foregoing method of the present application, after the obtaining the number of associated nodes of the target node, the method further includes:
determining service parameters associated with the target node, wherein the service parameters correspond to service types and service data capacity;
and determining the weight coefficient distributed to the target node and the associated child node based on the service parameter associated with the target node.
Optionally, in another embodiment based on the foregoing method of the present application, the total storage interval address is allocated to the target node by using the following formula:
N=（（A-B）*2+1）/C
wherein, N is the total storage interval address of the target node, A and B are the associated sub-nodes of the target node, and C is the average value of the weight coefficients distributed by the target node and the associated sub-nodes.
The number of the associated child nodes of the target node is multiple. Therefore, in one mode, the total storage section address allocated by the target node can be determined by the difference between the two (i.e. the difference between the numbers of the upper-level child node and the lower-level child node) and the average value of the weight coefficients allocated by the target node and the associated child node. It can be understood that the larger N is, the larger the total storage interval address allocated by the target node is.
Optionally, in another embodiment based on the foregoing method of the present application, the allocating, in the target database, the total storage interval address for the target node and the associated child node includes:
dividing the total storage interval address of the node into at least two sub-storage interval addresses in a preset mode;
taking at least any one sub-storage interval address in the at least two sub-storage interval addresses as a total storage interval address corresponding to a superior sub-node of the target node; and the number of the first and second groups,
and taking at least one other sub-storage interval address in the at least two sub-storage interval addresses as a total storage interval address corresponding to a subordinate sub-node of the target node.
Optionally, in another embodiment based on the foregoing method of the present application, after dividing the total storage interval address of the node into at least two sub-storage interval addresses in a preset manner, the method further includes:
and when detecting that at least any one of the at least two sub storage interval addresses is occupied by other nodes and/or the number of the sub storage interval addresses is larger than a preset threshold value, carrying out capacity expansion on the target node.
Optionally, in another embodiment based on the foregoing method of the present application, after dividing the total storage interval address of the node into at least two sub-storage interval addresses in a preset manner, the method further includes:
distributing the associated service of a first authority level to the superior child node of the target node; and the number of the first and second groups,
and distributing the associated service of the second permission level to the subordinate child nodes of the target node.
Optionally, in another embodiment based on the foregoing method of the present application, after the determining, in the target database, a target node storing the target service data, the method further includes:
determining an upper-level child node and a lower-level child node which are associated with the target node in the target database, wherein the target node, the upper-level child node and the lower-level child node respectively correspond to different reading authorities;
and acquiring a first sub-storage interval address corresponding to a target node, a second sub-storage interval address corresponding to the superior sub-node and a third sub-storage interval address corresponding to the subordinate sub-node.
Optionally, in another embodiment based on the foregoing method of the present application, after acquiring a first sub-storage interval address corresponding to a target node, a second sub-storage interval address corresponding to a higher-level sub-node, and a third sub-storage interval address corresponding to a lower-level sub-node, the method further includes:
detecting the authority level of a target user and determining a reading authority corresponding to the authority level;
and selecting the target sub-storage interval address matched with the reading authority, and calling the target service data from the target sub-storage interval address, wherein the target sub-storage interval address is one of the first sub-storage interval address, the second sub-storage interval address and the third sub-storage interval address.
Optionally, in another embodiment based on the foregoing method of the present application, before the receiving a data reading instruction for a target service by a target user, the method further includes:
receiving an instruction to create the target node in the target database;
distributing at least two associated sub-nodes for the target node, and distributing different reading authorities for each associated sub-node and the target node; configuring corresponding weight coefficients for the target nodes;
and distributing the total storage interval address for the target node in the target database based on the number of the associated child nodes of the target node and the weight coefficient corresponding to the target node.
Optionally, in another embodiment based on the foregoing method of the present application, the configuring a corresponding weight coefficient for the target node includes:
determining service parameters associated with the target node, wherein the service parameters correspond to service types and service data capacity;
and determining the weight coefficient distributed to the target node based on the service parameter associated with the target node, wherein the weight coefficient is used for determining the size of the storage space address.
Optionally, in another embodiment based on the foregoing method of the present application, the determining the weight coefficient allocated to the target node based on the service parameter associated with the target node includes:
distributing a first weight coefficient to the target node based on the service parameter associated with the target node; and the number of the first and second groups,
and distributing a second weight coefficient of the binary right shift operation to the upper-level child node of the target node, and distributing a third weight coefficient of the binary left shift operation to the lower-level child node of the target node.
Optionally, in another embodiment based on the foregoing method of the present application, after the allocating a binary right-shift operation weight coefficient to the upper-level child node of the target node and allocating a binary left-shift operation weight coefficient to the lower-level child node of the target node, the method further includes:
distributing the first sub storage interval address to the target node according to the first weight coefficient; and the number of the first and second groups,
distributing a second sub-storage interval address to the superior node according to the second weight coefficient; and the number of the first and second groups,
and distributing a third sub-storage interval address for the superior node according to the third weight coefficient.
In the present application, in the process of allocating storage spaces for the target node and the child nodes associated with the target node, the weight coefficient corresponding to the target node needs to be determined first. And then determining the weight coefficients of the upper and lower nodes in sequence. It can be understood that the larger the weight coefficient, the larger the memory space address allocated to the node.
In one approach, in determining the weight coefficients for the target node and its associated child nodes, the weight coefficients may be determined according to the traffic parameters associated with the target node. It should be noted that the service parameter associated with the target node may be a service type and a service data size associated with the target node. For example, when the data stored by the target node corresponds to processing the user payment service, the target node is associated with the service parameter, i.e. the payment service type. Or, when the data stored in the target node corresponds to the audio-video download service of the processing user, the target node is associated with the service parameter, namely the audio-video service type.
Each service type can be configured with different data capacity according to the service importance index.
For example, when the service parameter associated with the target node is a text service (that is, the service parameter corresponds to a text service type), it can be understood that, if the service importance indicator corresponding to the text service type is smaller, the application may configure a smaller data capacity size for the text service type in advance. When the service importance index corresponding to the text service type is large, the method and the device can configure large data capacity for the text service type in advance.
Or, when the service parameter associated with the target node is the audio/video download service (that is, the service parameter corresponds to the audio/video service type), it can be understood that, since the service data of the audio/video service type is mostly large-scale data such as video and audio, the application can configure a large data capacity for the audio/video service type in advance. In addition, the method and the device can also configure the corresponding larger or smaller data capacity according to the service importance index size corresponding to the video and audio service type. So as to achieve the aim of configuring the memory space address with the corresponding size in the database for the nodes processing different service types. Thereby achieving the purpose of reasonably distributing the storage space.
In addition, in the present application, in the process of determining to assign the weight coefficient to the associated child node, the weight coefficient may be generated for the child node by binary shift operation of the weight value.
The shift operation is a special operation, and the principle is an algorithm for moving forward or backward by a plurality of bits according to the standard that a numerical value is stored in a computer memory and a binary system is used. For example, a binary right shift operation weight value and a binary left shift operation weight value may be included.
Specifically, in the case of a binary right shift operation, it may be to shift each binary digit to the right by several bits (several bits: the number following the symbol "> > >", not enough to complement the highest order digit). Likewise, in the case of a binary left shift operation, it may be to shift each binary digit to the left by several bits (several bits: the digits following the symbol "<", not enough for 0 supplementation).
For example, to explain with a weight value of 2, since the source code of the positive integer 2 is inverse code, complement code, 00000010, the application can discard the highest two bits after moving 2 bits to the left of each digit, and since the sign bit (the highest bit is 0), complement two 0's, become 00001000 = > 8. Likewise, for 00000010, right shift 2 is to remove the two numbers on the right, and add two 0's on the most significant bit, becoming 00000000 = > 0.
Optionally, in another embodiment based on the foregoing method of the present application, the total storage interval address is allocated to the target node by using the following formula:
N=（（A-B）*2+1）/C
wherein, N is the total storage interval address of the target node, A is the number of the associated child nodes of the target node +1, B is the second weight coefficient value, and C is the third weight coefficient value.
Optionally, in another embodiment based on the foregoing method of the present application, the allocating, in the target database, the total storage interval address for the target node includes:
and when detecting that the total storage interval address distributed for the target node is occupied by other nodes and/or the size of the total storage interval address exceeds a preset threshold value, expanding the capacity of the target database.
In the process of allocating the corresponding sub-storage space addresses to the target node and the child nodes associated with the target node, the corresponding weight coefficients may be configured for the target node and the child nodes associated with the target node.
In one mode, the present application may allocate a node total storage interval address to a target node by using the following formula:
N=（（A-B）*2+1）/C
wherein, N is the total storage interval address of the target node, A is the number of the associated child nodes of the target node +1, B is the second weight coefficient value, and C is the third weight coefficient value.
It can be understood that after the associated service corresponding to the permission level is allocated to each sub-storage interval address, when a subsequent user searches for the associated permission node corresponding to each node in the database, the subsequent user can directly search out the total storage interval address corresponding to the associated permission node.
For example, when all the node information of the upper level of the target node data needs to be queried, the current node information maxNode and minNode can be queried according to the retrieval condition. The SQL SELECT NODE _ ID, MAX NODE, MIN NODE FROM table name WHERE conditions may be queried. Or when all NODE information of the lower level of the target NODE data needs to be inquired, the information can be obtained by inquiring SQL, namely, SELECT FROM table name WHERE NODE _ ID > minNODE AND NODE _ ID > maxNode.
Optionally, after dividing the total storage interval address of the node into at least two sub-storage interval addresses in a preset manner, the method further includes:
and when detecting that the total storage interval address distributed for the target node is occupied by other nodes and/or the size of the total storage interval address exceeds a preset threshold value, expanding the capacity of the target database.
Further, after the target node is allocated with the plurality of sub storage interval addresses, if the created sub node information is already occupied by other sub nodes or the number of the current nodes is greater than the number of the allocated nodes, the capacity expansion rule of the capacity expansion target node can be triggered.
Further, for capacity expansion of the database, one way may be smooth capacity expansion. For example, X databases may be added, and a master database and a slave database may be configured to perform data synchronization, and after the data synchronization is completed, the master database and the slave database may be configured to perform double writing until the data synchronization is completed. And simultaneously deleting synchronization of multiple databases, modifying configuration of the databases and restarting the whole database cluster.
In addition, for expanding the storage capacity of the target node, one way may be to expand the node value of the target node to maxNode = maxNode + [ pmaxNode-pminode ]/Cn. Cn, the number of the distributed nodes, pmaxNode is upper node maxNode information of a target node, pminode is lower node minNode information of the target node;
in another way, if the number of child nodes of the current node is greater than Cn × F1, a rule for expanding the number of child nodes of the current node is triggered, and the number of distributed nodes Cn = YCn × K2 is assigned. Cn, the number of the distributed nodes, F1, the percentage of the change threshold value of the number of the nodes, and K2, the change capacity value of the number of the nodes.
In one mode, as shown in fig. 2, a schematic flow chart of querying data provided by the present application includes:
first, in the embodiment of the present application, when an instruction to create a target node in a target database needs to be received, at least two associated child nodes are allocated to the target node, and a read permission different from that of the target node is allocated to each associated child node. Distributing weight coefficients to the target node, the upper-level child node and the lower-level child node based on the service parameters related to the target node, so that a first child storage interval address is distributed to the target node according to the weight coefficients subsequently; allocating a second sub-storage interval address to the superior node; and allocating a third sub-storage interval address to the upper node.
Optionally, in the data reading stage, when a data reading instruction of a target user for a target service is received in the embodiment of the present application, a target node storing target service data needs to be determined in a database; and determining the upper-level child node and the lower-level child node which are related to the target node in the target database.
Further, the present application may determine, according to a pre-stored node storage interval list, a total storage interval address pre-allocated by the database for the target node, where the total storage interval address includes a first sub-storage interval address corresponding to the acquired target node, a second sub-storage interval address corresponding to the upper-level sub-node, and a third sub-storage interval address corresponding to the lower-level sub-node.
In addition, in the embodiment of the present application, the authority level of the target user may also be detected, and a reading authority level corresponding to the authority level of the user is determined (for example, private service data may be read, public service data may be read, and the like). And based on the reading authority level, selecting the target sub-storage interval address matched with the reading authority, and further determining which sub-storage space address needs to be read at this time.
Finally, the target service data required by the target service can be called from the determined read sub-storage space address.
By applying the technical scheme of the application, corresponding sub-storage interval addresses can be respectively allocated to each node and the sub-nodes related to the node in the database in advance, wherein different total storage interval addresses correspond to reading authorities with different authority levels, so that a user can directly call corresponding service data from the sub-storage interval addresses corresponding to the reading authorities according to the authority levels of the user when the user reads the service data subsequently. The data reading mode provided by the application can reduce the problem of operation pressure caused by traversing the database when reading data in the related technology, and can also avoid the problem of safety risk of the database caused by providing high-risk business data for low-authority users when viewing the low-risk business data.
In another embodiment of the present application, as shown in fig. 3, the present application further provides an apparatus for querying data. The system comprises a receiving module 201, a determining module 202 and a calling module 203, wherein,
a receiving module 201, configured to, when receiving a data reading instruction of a target user for a target service, determine a target node in a target database, where the target service data is stored;
a determining module 202, configured to determine, based on the permission level of the target user, a total storage interval address included in a database by the target node, where the total storage interval address is an address allocated by the target database for the target node and used for storing data;
and the calling module 203 is configured to call data required by the target service from the total storage interval address of the target database.
In the method, when a data reading instruction of a target user for a target service is received, a target node storing target service data can be determined in a target database; determining a total storage interval address contained in a database by a target node based on the authority level of a target user, wherein the total storage interval address is an address which is distributed by the target database for the target node and is used for storing data; and calling data required by the target service from the total storage interval address of the target database. By applying the technical scheme of the application, corresponding sub-storage interval addresses can be respectively allocated to each node and the sub-nodes related to the node in the database in advance, wherein different total storage interval addresses correspond to reading authorities with different authority levels, so that a user can directly call corresponding service data from the sub-storage interval addresses corresponding to the reading authorities according to the authority levels of the user when the user reads the service data subsequently. In addition, the method and the device can also determine the weight coefficient allocated to the target node according to the service parameters corresponding to the service type and the service data capacity and associated with each node, so that the size of the storage space address allocated to the node is determined according to the weight coefficient subsequently. Therefore, the operating pressure caused by traversing the database when data is read in the related technology is reduced, and the query efficiency is improved.
In another embodiment of the present application, the receiving module 201 is configured to:
when an instruction of creating the target node in the target database is received, acquiring the number of associated child nodes of the target node, wherein the number of the child nodes is at least two;
and distributing the total storage interval address for the target node and the associated sub-nodes in the target database based on the number of the associated sub-nodes of the target node and the weight coefficients corresponding to the target node and the associated sub-nodes.
In another embodiment of the present application, the receiving module 201 is configured to:
determining service parameters associated with the target node, wherein the service parameters correspond to service types and service data capacity;
and determining the weight coefficient distributed to the target node and the associated child node based on the service parameter associated with the target node.
In another embodiment of the present application, the receiving module 201 is configured to:
allocating the total storage interval address to the target node using the following formula:
N=（（A-B）*2+1）/C
wherein, N is the total storage interval address of the target node, A and B are the associated sub-nodes of the target node, and C is the average value of the weight coefficients distributed by the target node and the associated sub-nodes.
In another embodiment of the present application, the receiving module 201 is configured to:
dividing the total storage interval address of the node into at least two sub-storage interval addresses in a preset mode;
taking at least any one sub-storage interval address in the at least two sub-storage interval addresses as a total storage interval address corresponding to a superior sub-node of the target node; and the number of the first and second groups,
and taking at least one other sub-storage interval address in the at least two sub-storage interval addresses as a total storage interval address corresponding to a subordinate sub-node of the target node.
In another embodiment of the present application, the receiving module 201 is configured to:
and when detecting that at least any one of the at least two sub storage interval addresses is occupied by other nodes and/or the number of the sub storage interval addresses is larger than a preset threshold value, carrying out capacity expansion on the target node.
In another embodiment of the present application, the receiving module 201 is configured to:
distributing the associated service of a first authority level to the superior child node of the target node; and the number of the first and second groups,
and distributing the associated service of the second permission level to the subordinate child nodes of the target node.
Fig. 4 is a block diagram illustrating a logical structure of an electronic device in accordance with an exemplary embodiment. For example, the electronic device 300 may be a mobile phone, a computer, a digital broadcast terminal, a messaging device, a game console, a tablet device, a medical device, an exercise device, a personal digital assistant, and the like.
In an exemplary embodiment, there is also provided a non-transitory computer readable storage medium, such as a memory, including instructions executable by a processor of an electronic device to perform a method of querying data as described above, the method comprising: when a data reading instruction of a target user for a target service is received, determining a target node in which the target service data is stored in a target database; determining a total storage interval address contained in a database by the target node based on the authority level of the target user, wherein the total storage interval address is an address which is allocated to the target node by the target database and is used for storing data; and calling data required by the target service from the total storage interval address of the target database. Optionally, the instructions may also be executable by a processor of the electronic device to perform other steps involved in the exemplary embodiments described above. For example, the non-transitory computer readable storage medium may be a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.
In an exemplary embodiment, there is also provided an application/computer program product including one or more instructions executable by a processor of an electronic device to perform the method of querying data described above, the method including: when a data reading instruction of a target user for a target service is received, determining a target node in which the target service data is stored in a target database; determining a total storage interval address contained in a database by the target node based on the authority level of the target user, wherein the total storage interval address is an address which is allocated to the target node by the target database and is used for storing data; and calling data required by the target service from the total storage interval address of the target database. Optionally, the instructions may also be executable by a processor of the electronic device to perform other steps involved in the exemplary embodiments described above.
Fig. 4 is an exemplary diagram of the computer device 30. Those skilled in the art will appreciate that the schematic diagram 4 is merely an example of the computer device 30 and does not constitute a limitation of the computer device 30 and may include more or less components than those shown, or combine certain components, or different components, e.g., the computer device 30 may also include input output devices, network access devices, buses, etc.
The Processor 302 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. The general purpose processor may be a microprocessor or the processor 302 may be any conventional processor or the like, the processor 302 being the control center for the computer device 30 and connecting the various parts of the overall computer device 30 using various interfaces and lines.
The modules integrated by the computer device 30 may be stored in a computer-readable storage medium if they are implemented in the form of software functional modules and sold or used as separate products. Based on such understanding, all or part of the flow of the method according to the embodiments of the present invention may also be implemented by hardware related to computer readable instructions, which may be stored in a computer readable storage medium, and when the computer readable instructions are executed by a processor, the steps of the method embodiments may be implemented.
Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.
It will be understood that the present application is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the appended claims.
Claims (10)
1. A method of querying data, comprising:
when a data reading instruction of a target user for a target service is received, determining a target node in which the target service data is stored in a target database;
determining a total storage interval address contained in a database by the target node, wherein the total storage interval address is an address which is allocated to the target node by the target database and is used for storing data;
and based on the authority level of the target user, calling data required by the target service from the total storage interval address of the target database.
2. The method of claim 1, wherein prior to said receiving a data query instruction for a target service, further comprising:
when an instruction of creating the target node in the target database is received, acquiring the number of associated child nodes of the target node, wherein the number of the child nodes is at least two;
and distributing the total storage interval address for the target node and the associated sub-nodes in the target database based on the number of the associated sub-nodes of the target node and the weight coefficients corresponding to the target node and the associated sub-nodes.
3. The method of claim 2, wherein after said obtaining the number of associated nodes for the target node, further comprising:
determining service parameters associated with the target node, wherein the service parameters correspond to service types and service data capacity;
and determining the weight coefficient distributed to the target node and the associated child node based on the service parameter associated with the target node.
4. A method according to claim 2 or 3, wherein the total storage interval address is allocated to the target node using the formula:
N=（（A-B）*2+1）/C
wherein, N is the total storage interval address of the target node, A and B are the associated sub-nodes of the target node, and C is the average value of the weight coefficients distributed by the target node and the associated sub-nodes.
5. The method of claim 2, wherein said assigning the total storage interval address in the target database for the target node and the associated child node comprises:
dividing the total storage interval address of the node into at least two sub-storage interval addresses in a preset mode;
taking at least any one sub-storage interval address in the at least two sub-storage interval addresses as a total storage interval address corresponding to a superior sub-node of the target node; and the number of the first and second groups,
and taking at least one other sub-storage interval address in the at least two sub-storage interval addresses as a total storage interval address corresponding to a subordinate sub-node of the target node.
6. The method of claim 5, wherein after the dividing the node total storage interval address into at least two sub-storage interval addresses in a preset manner, further comprising:
and when detecting that at least any one of the at least two sub storage interval addresses is occupied by other nodes and/or the number of the sub storage interval addresses is larger than a preset threshold value, carrying out capacity expansion on the target node.
7. The method of claim 5, wherein after the dividing the node total storage interval address into at least two sub-storage interval addresses in a preset manner, further comprising:
distributing the associated service of a first authority level to the superior child node of the target node; and the number of the first and second groups,
and distributing the associated service of the second permission level to the subordinate child nodes of the target node.
8. An apparatus for querying data, comprising:
the receiving module is configured to determine a target node in a target database, wherein the target node stores target service data, when a data reading instruction of a target user for a target service is received;
a determining module, configured to determine a total storage interval address included in a database by the target node, where the total storage interval address is an address allocated by the target database for the target node and used for storing data;
and the calling module is configured to call the data required by the target service from the total storage interval address of the target database based on the authority level of the target user.
9. An electronic device, comprising:
a memory for storing executable instructions; and the number of the first and second groups,
a processor for display with the memory to execute the executable instructions to perform the operations of the method of querying data of any of claims 1-7.
10. A computer-readable storage medium storing computer-readable instructions that, when executed, perform the operations of the method of querying data of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210035137.5A CN114064662B (en) | 2022-01-13 | 2022-01-13 | Method, device, electronic equipment and medium for querying data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210035137.5A CN114064662B (en) | 2022-01-13 | 2022-01-13 | Method, device, electronic equipment and medium for querying data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114064662A true CN114064662A (en) | 2022-02-18 |
| CN114064662B CN114064662B (en) | 2022-05-03 |
Family
ID=80231061
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210035137.5A Active CN114064662B (en) | 2022-01-13 | 2022-01-13 | Method, device, electronic equipment and medium for querying data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114064662B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114942730A (en) * | 2022-07-25 | 2022-08-26 | 北京睿芯高通量科技有限公司 | Method and device for determining residual storage space and electronic equipment |
| CN115639968A (en) * | 2022-11-16 | 2023-01-24 | 苏州浪潮智能科技有限公司 | Method, device, equipment and medium for allocating RAID capacity space |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130013602A1 (en) * | 2011-07-06 | 2013-01-10 | International Business Machines Corporation | Database system |
| CN105095348A (en) * | 2015-06-09 | 2015-11-25 | 北京织星科技有限公司 | Method for dynamically configuring website through XML (Extensive Markup Language) |
| CN108241620A (en) * | 2016-12-23 | 2018-07-03 | 北京国双科技有限公司 | The generation method and device of query script |
| CN109885589A (en) * | 2017-12-06 | 2019-06-14 | 腾讯科技（深圳）有限公司 | Data query method, apparatus, computer equipment and storage medium |
| CN110704872A (en) * | 2019-09-24 | 2020-01-17 | 天津卓朗科技发展有限公司 | Data query method and device, electronic equipment and computer readable storage medium |
| CN112115227A (en) * | 2020-08-14 | 2020-12-22 | 咪咕文化科技有限公司 | Data query method and device, electronic equipment and storage medium |
| CN112988912A (en) * | 2021-05-07 | 2021-06-18 | 支付宝(杭州)信息技术有限公司 | Block chain data storage method and device and electronic equipment |
| CN113507475A (en) * | 2021-07-14 | 2021-10-15 | 杭州数梦工场科技有限公司 | Cross-domain access method and device |
| CN113535677A (en) * | 2021-06-29 | 2021-10-22 | 平安国际融资租赁有限公司 | Data analysis query management method and device, computer equipment and storage medium |
| CN113613305A (en) * | 2021-08-13 | 2021-11-05 | 南京工业职业技术大学 | Zigbee network routing node energy balance construction method |
| CN113688064A (en) * | 2020-05-18 | 2021-11-23 | 中科寒武纪科技股份有限公司 | Method and equipment for allocating storage address for data in memory |
| CN113742378A (en) * | 2021-01-15 | 2021-12-03 | 北京沃东天骏信息技术有限公司 | Data query and storage method, related equipment and storage medium |
-
2022
- 2022-01-13 CN CN202210035137.5A patent/CN114064662B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130013602A1 (en) * | 2011-07-06 | 2013-01-10 | International Business Machines Corporation | Database system |
| CN105095348A (en) * | 2015-06-09 | 2015-11-25 | 北京织星科技有限公司 | Method for dynamically configuring website through XML (Extensive Markup Language) |
| CN108241620A (en) * | 2016-12-23 | 2018-07-03 | 北京国双科技有限公司 | The generation method and device of query script |
| CN109885589A (en) * | 2017-12-06 | 2019-06-14 | 腾讯科技（深圳）有限公司 | Data query method, apparatus, computer equipment and storage medium |
| CN110704872A (en) * | 2019-09-24 | 2020-01-17 | 天津卓朗科技发展有限公司 | Data query method and device, electronic equipment and computer readable storage medium |
| CN113688064A (en) * | 2020-05-18 | 2021-11-23 | 中科寒武纪科技股份有限公司 | Method and equipment for allocating storage address for data in memory |
| CN112115227A (en) * | 2020-08-14 | 2020-12-22 | 咪咕文化科技有限公司 | Data query method and device, electronic equipment and storage medium |
| CN113742378A (en) * | 2021-01-15 | 2021-12-03 | 北京沃东天骏信息技术有限公司 | Data query and storage method, related equipment and storage medium |
| CN112988912A (en) * | 2021-05-07 | 2021-06-18 | 支付宝(杭州)信息技术有限公司 | Block chain data storage method and device and electronic equipment |
| CN113535677A (en) * | 2021-06-29 | 2021-10-22 | 平安国际融资租赁有限公司 | Data analysis query management method and device, computer equipment and storage medium |
| CN113507475A (en) * | 2021-07-14 | 2021-10-15 | 杭州数梦工场科技有限公司 | Cross-domain access method and device |
| CN113613305A (en) * | 2021-08-13 | 2021-11-05 | 南京工业职业技术大学 | Zigbee network routing node energy balance construction method |
Non-Patent Citations (1)
| Title |
|---|
| 李盼盼 等: "基于相似树查询的隐私大数据定向检索算法", 《计算机仿真》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114942730A (en) * | 2022-07-25 | 2022-08-26 | 北京睿芯高通量科技有限公司 | Method and device for determining residual storage space and electronic equipment |
| CN114942730B (en) * | 2022-07-25 | 2022-09-23 | 北京睿芯高通量科技有限公司 | Method and device for determining residual storage space and electronic equipment |
| CN115639968A (en) * | 2022-11-16 | 2023-01-24 | 苏州浪潮智能科技有限公司 | Method, device, equipment and medium for allocating RAID capacity space |
| CN115639968B (en) * | 2022-11-16 | 2023-02-28 | 苏州浪潮智能科技有限公司 | Method, device, equipment and medium for allocating RAID (redundant array of independent disks) capacity space |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114064662B (en) | 2022-05-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114064662B (en) | Method, device, electronic equipment and medium for querying data | |
| US11132346B2 (en) | Information processing method and apparatus | |
| CN105488050B (en) | A kind of more indexing means of database, apparatus and system | |
| CN110019292B (en) | Data query method and device | |
| WO2021073433A1 (en) | Monitoring method and device, server, and storage medium | |
| CN110020086B (en) | User portrait query method and device | |
| US10127254B2 (en) | Method of index recommendation for NoSQL database | |
| WO2020211236A1 (en) | Read-write conflict resolution method and apparatus employing b+ tree and storage medium | |
| CN109726579B (en) | Resource access authority grouping method and equipment | |
| CN108205571B (en) | Key value data table connection method and device | |
| CN109716321A (en) | The hash connection of the road N | |
| CN111930923B (en) | Bloom filter system and filtering method | |
| WO2023051235A1 (en) | Threat intelligence big data sharing method and system | |
| CN111475511A (en) | Data storage method, data access method, data storage device, data access device and data access equipment based on tree structure | |
| CN114138181A (en) | Method, device, equipment and readable medium for placing, grouping and selecting owners in binding pool | |
| CN113609282A (en) | Drawing method of automatic drawing engine | |
| CN103905512A (en) | Data processing method and equipment | |
| CN113742332A (en) | Data storage method, device, equipment and storage medium | |
| CN112015763A (en) | JSON data verification method and device, electronic equipment and computer readable medium | |
| CN110837499B (en) | Data access processing method, device, electronic equipment and storage medium | |
| CN116126862A (en) | Data table association method, device, equipment and storage medium | |
| CN114417069A (en) | Page data interaction method and device and electronic equipment | |
| CN114493799A (en) | Method and system for managing special vehicle order data in warehouse and table dividing manner | |
| CN110347751B (en) | Method and device for managing CDN system service attribute | |
| CN113761102A (en) | Data processing method, device, server, system and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |