CN111061680A - Data retrieval method and device - Google Patents
Data retrieval method and device Download PDFInfo
- Publication number
- CN111061680A CN111061680A CN201811195686.9A CN201811195686A CN111061680A CN 111061680 A CN111061680 A CN 111061680A CN 201811195686 A CN201811195686 A CN 201811195686A CN 111061680 A CN111061680 A CN 111061680A
- Authority
- CN
- China
- Prior art keywords
- data
- index
- storage information
- storage
- hash value
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 238000013500 data storage Methods 0.000 claims description 17
- 238000004590 computer program Methods 0.000 claims description 9
- 230000008569 process Effects 0.000 claims description 7
- 238000012545 processing Methods 0.000 claims description 7
- 238000004364 calculation method Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 20
- 238000004891 communication Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 6
- 238000007726 management method Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000004422 calculation algorithm Methods 0.000 description 3
- 238000013499 data model Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000000644 propagated effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012549 training Methods 0.000 description 1
Images
Abstract
The invention discloses a data retrieval method and device, and relates to the technical field of computers. One embodiment of the method comprises: receiving a data retrieval request, wherein the data retrieval request indicates an index field; determining a hash value of the index field; determining an index tree corresponding to the hash value according to the hash value of the index field; and querying storage information corresponding to the hash value in the index tree as storage information of the data, wherein the storage information indicates a storage position of the data. The embodiment receives a data retrieval request, wherein the data retrieval request indicates an index field; determining a hash value of the index field; determining an index tree corresponding to the hash value according to the hash value of the index field; and querying storage information corresponding to the hash value in the index tree as storage information of the data, wherein the storage information indicates a storage position of the data.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a method and an apparatus for data retrieval, an electronic device, and a computer-readable medium.
Background
In the current big data age, the efficiency of data storage and retrieval has become critical. Currently, data retrieval is mainly performed through two layers, (1) file system storage by means of external physical media, and data storage and retrieval operations are completed through IO (Input/Output), and storage and retrieval technologies represented by the two layers include traditional relational databases (such as Oracle and MYSQL) and distributed file storage systems (such as HDFS and ELASTICSEARCH) (2) memory databases (such as Redis and Memcached) implemented by means of memory.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
for example, when data is stored and retrieved through a physical medium, a relational database can meet the requirement of strong transaction dependence, and distributed storage can meet the storage and retrieval of mass data. The memory database avoids the influence of IO, so that the reading efficiency is greatly improved. However, as the in-memory database is generally a data storage model based on KEY-VALUE, the flexibility of data storage and retrieval is greatly restricted, and the data is easy to tilt.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for data retrieval, which can store and retrieve data using a hash algorithm and an index tree, and provide a multi-field retrieval solution, and can implement balanced storage of data.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a data retrieval method, including: receiving a data retrieval request, wherein the data retrieval request indicates an index field; determining a hash value of the index field; determining an index tree corresponding to the hash value according to the hash value of the index field; and querying storage information corresponding to the hash value in the index tree as storage information of the data, wherein the storage information indicates a storage position of the data.
Optionally, the method further comprises: and processing the storage information according to the logical relationship between the index fields indicated by the data retrieval request.
Optionally, in a case that the logical relationship between the index fields is an and operation, the intersection of the queried storage information is used as the storage information of the data.
Optionally, in a case that the logical relationship between the index fields is an or operation, the union of the queried storage information is used as the storage information of the data.
Optionally, the storing information includes: a starting address of a memory block storing the data, an offset from the starting address, and a length of the data.
Optionally, the index tree is one or more of the following: binary tree, balanced binary tree, B-tree.
Optionally, the method further comprises: receiving a data storage request, and storing the data in a data node in a polling mode; and generating storage information of the data according to the storage success message of the data node.
To achieve the above object, according to another aspect of the embodiments of the present invention, there is provided an apparatus for data retrieval, including: a receiving module, configured to receive a data retrieval request, where the data retrieval request indicates an index field and an index field corresponding to the index field; a calculation module for determining a hash value of the index field; the index module is used for determining an index tree corresponding to the hash value according to the hash value of the index field; and the query module is used for querying storage information corresponding to the hash value in the index tree as the storage information of the data, wherein the storage information indicates the storage position of the data.
Optionally, the query module is further configured to process the storage information according to a logical relationship between the index fields indicated by the data retrieval request.
Optionally, the query module is further configured to use an intersection of the queried storage information as the storage information of the data if the logical relationship between the index fields is an and operation.
Optionally, the query module is further configured to use the union of the queried storage information as the storage information of the data if the logical relationship between the index fields is an or operation.
Optionally, the storing information includes: a starting address of a memory block storing the data, an offset from the starting address, and a length of the data.
Optionally, the index tree is one or more of the following: binary tree, balanced binary tree, B-tree.
Optionally, the apparatus further comprises: the gateway module is used for receiving a data storage request and storing the data in the data nodes in a polling mode; and generating storage information of the data according to the storage success message of the data node.
To achieve the above object, according to still another aspect of an embodiment of the present invention, there is provided an electronic apparatus including: one or more processors; storage means for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to carry out a method of any one of the methods of data retrieval.
To achieve the above object, according to still another aspect of embodiments of the present invention, there is provided a computer-readable medium on which a computer program is stored, the program, when executed by one or more processors, implementing any one of the methods of data retrieval.
One embodiment of the above invention has the following advantages or benefits: because the technical means of retrieving the storage information of the data by using the hash algorithm and the index tree is adopted, the technical problem that the traditional K-V storage method is inflexible to data retrieval is solved, and the technical effect of flexible and efficient data retrieval is further achieved.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic diagram of the main steps of a method of data retrieval according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of the main steps of data storage according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a three-dimensional data model according to an embodiment of the invention;
FIG. 4 is a schematic diagram of a preferred implementation of an embodiment in accordance with the invention;
fig. 5 is a schematic diagram of a main part of an apparatus for data retrieval according to an embodiment of the present invention;
FIG. 6 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 7 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
Fig. 1 is a schematic diagram of main steps of a data retrieval method according to an embodiment of the present invention, as shown in fig. 1:
step S101 represents receiving a data retrieval request, wherein the data retrieval request indicates an index field. The index field of the data is preset during data storage, and can be set in a mode of configuring metadata, and further, a data value corresponding to the index field can be set, and the index field can be replaced by the data value for retrieval.
Step S102 represents determining a hash value of the index field. The purpose of this step is to perform bucket splitting on the introduced field according to a preset hash rule, where the bucket splitting rule may be that the hash value takes the remainder of the total number of the bucket, the correspondence between the remainder and the bucket needs to be preset, and the storage information corresponding to the index field, such as an index tree, is stored in the bucket.
Step S103 represents determining an index tree corresponding to the hash value according to the hash value of the search field, where the index tree is one or more of the following: binary tree, balanced binary tree, B-tree. Further, the index tree may be a red-black tree. The stored information of the retrieved data may be stored at the nodes of the index tree. The corresponding relationship between the hash value and the index tree needs to be preset, for example, according to a preset hash rule, bucket division is performed, and each bucket stores one index tree.
Step S104 represents querying storage information corresponding to the hash value in the index tree as storage information of the data, where the storage information indicates a storage location of the data. And acquiring the retrieval data according to the storage information. After the storage information is determined, the location where the data is stored and the identity of the stored file (e.g., file number, etc.) may be queried.
The method further comprises the following steps: and processing the storage information according to the logical relationship between the index fields indicated by the data retrieval request. And in the case that the logical relation between the index fields is AND operation, taking the intersection of the inquired storage information as the storage information of the data. And taking the union of the inquired storage information as the storage information of the data under the condition that the logic relation between the index fields is OR operation.
For example, when the data retrieval request further includes a plurality of index fields, the index fields are retrieved respectively, a hash value of each index field is determined, an index tree is determined according to the hash value, after storage information of all the retrieval fields is acquired, intersection or union operation is performed on all storage addresses, then the screened storage addresses are used as storage addresses of the retrieval data, and the retrieval data is acquired according to the storage addresses of the retrieval data. For example, if the search field is "boy student" for searching "two shifts in three years" in the staff database, and the index fields "two shifts in three years" and "boy student" are logical relations to each other, the storage address of the "two shifts in three years" and the storage address of the "boy student" obtained by the search need to intersect with each other, and then the "boy student" data of the "two shifts in three years" can be obtained.
Fig. 2 is a schematic diagram illustrating main steps of data storage according to an embodiment of the present invention, and fig. 2 shows:
s201, receiving a data storage request, and storing the data in a data node in a polling mode; and generating storage information of the data according to the storage success message of the data node. Wherein the stored information comprises: a starting address of a memory block storing the data, an offset from the starting address, and a length of the data. The data is stored in the memory, so that the read-write limitation of IO is avoided, the storage and retrieval efficiency of the data is improved, and further, the data needs to be stored persistently by means of an external physical storage medium to be backed up.
S202 represents that an index field of the data to be stored is determined according to the data; the index field may be set by way of configuration metadata, and the index field may be a digest of the data, an identification of the data, and so on. Further, the data value corresponding to the index field can also be configured.
S203 denotes determining a hash value of an index field of the data. Namely, the index field is subjected to data bucket division according to a preset hash rule.
S204 represents that an index tree corresponding to the index field of the data is determined according to the hash value of the index field, and the storage information of the data is stored in the index tree.
Further, a three-dimensional data model (as shown in fig. 3) may be established to facilitate display of data indexes, index FIELDs may be stored in an X-axis direction of the three-dimensional data model, each FIELD corresponds to one index FIELD, hash values (KEY) corresponding to the index FIELDs are stored in a Z-axis direction, and index trees corresponding to the hash values are stored in a Y-axis direction, so that each data may correspond to one data section.
Fig. 4 is a schematic diagram of a preferred implementation according to an embodiment of the invention, as shown in fig. 4:
a client: the client side is responsible for initiating request operation of data storage or retrieval, when the system is started, the client side initializes link channels with all gateway nodes through configuration, and the client side sequentially sends requests to all gateway nodes through a polling strategy.
A gateway node: the data storage management system is responsible for data index management (including index generation, retrieval, invalidation and the like), and merging and sorting of data storage information; request forwarding and the like. Each gateway node corresponds to a data node.
A data node: the location of the actual storage of the data.
The client can be connected to the gateway node through NIO (New IO or Non-Blocking IO, which is a set of New IO API introduced from Java 1.4 version and can replace standard Java IO API), and sends a request to different gateway nodes in a round-training mode of the client, thereby realizing the balanced storage of data. While the gateway node also supports lateral extensions. After the client retrieves the storage information of the data through the gateway node, the gateway node can forward the retrieval request of the data to the corresponding data node according to the storage information of the data, and the data node queries the data and returns the data. After the data node stores the data, the data node sends the storage information of the data to the gateway node for generating the index of the data.
Fig. 5 is a schematic diagram of a main part of an apparatus 500 for data retrieval according to an embodiment of the present invention, as shown in fig. 5:
a receiving module 501, configured to receive a data retrieval request, where the data retrieval request indicates an index field and an index field corresponding to the index field; the index field of the data is preset during data storage, and can be set in a mode of configuring metadata, and further, a data value corresponding to the index field can be set, and the index field can be replaced by the data value for retrieval.
A calculating module 502, configured to determine a hash value of the index field. The method aims to perform barrel division on the introduced fields according to a preset hash rule, wherein the barrel division rule can be that the hash value takes the remainder of the total number of the barrels, the corresponding relation between the remainder and the barrels needs to be preset, and storage information corresponding to the index fields, such as an index tree and the like, is stored in the barrels.
An index module 503, configured to determine, according to the hash value of the index field, an index tree corresponding to the hash value; the index tree is one or more of the following: binary tree, balanced binary tree, B-tree. Further, the index tree may be a red-black tree. The stored information of the retrieved data may be stored at the nodes of the index tree. The corresponding relationship between the hash value and the index tree needs to be preset, for example, according to a preset hash rule, bucket division is performed, and each bucket stores one index tree.
A querying module 504, configured to query storage information corresponding to the hash value in the index tree as storage information of the data, where the storage information indicates a storage location of the data. The storage information includes: the starting address of the memory block storing the data, the offset relative to the starting address, the length of the data, and the identification (such as a file number) of the storage file.
The query module 504 is further configured to process the storage information according to the logical relationship between the index fields indicated by the data retrieval request. And in the case that the logical relation between the index fields is AND operation, taking the intersection of the inquired storage information as the storage information of the data. And taking the union of the inquired storage information as the storage information of the data under the condition that the logic relation between the index fields is OR operation.
For example, when the data retrieval request further includes a plurality of index fields, the index fields are retrieved respectively, a hash value of each index field is determined, an index tree is determined according to the hash value, after storage information of all the retrieval fields is acquired, intersection or union operation is performed on all storage addresses, then the screened storage addresses are used as storage addresses of the retrieval data, and the retrieval data is acquired according to the storage addresses of the retrieval data. For example, if the search field is "boy student" for searching "two shifts in three years" in the staff database, and the index fields "two shifts in three years" and "boy student" are logical relations to each other, the storage address of the "two shifts in three years" and the storage address of the "boy student" obtained by the search need to intersect with each other, and then the "boy student" data of the "two shifts in three years" can be obtained.
The apparatus 500 may further comprise:
the gateway module is used for receiving a data storage request and storing the data in the data nodes in a polling mode; and generating storage information of the data according to the storage success message of the data node. Wherein the stored information comprises: a starting address of a memory block storing the data, an offset from the starting address, and a length of the data. The data is stored in the memory, so that the read-write limitation of IO is avoided, the storage and retrieval efficiency of the data is improved, and further, the data needs to be stored persistently by means of an external physical storage medium to be backed up.
The gateway module is also used for determining an index field of the data to be stored according to the data; the index field may be set by way of configuration metadata, and the index field may be a digest of the data, an identification of the data, and so on. Further, the data value corresponding to the index field can also be configured.
The calculation module 502 is also configured to determine a hash value of an index field of the data. Namely, the index field is subjected to data bucket division according to a preset hash rule.
The index module 503 is further configured to determine an index tree corresponding to the index field according to the hash value of the index field of the data, and store the storage information of the data in the index tree.
Fig. 6 shows an exemplary system architecture 600 of a method of data retrieval or an apparatus of data retrieval to which embodiments of the present invention may be applied.
As shown in fig. 6, the system architecture 600 may include terminal devices 601, 602, 603, a network 604, and a server 605. The network 604 serves to provide a medium for communication links between the terminal devices 601, 602, 603 and the server 605. Network 604 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.
A user may use the terminal devices 601, 602, 603 to interact with the server 605 via the network 604 to receive or send messages or the like.
The terminal devices 601, 602, 603 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 605 may be a server that provides various services, such as a background management server that provides support for users using the terminal devices 601, 602, 603. The background management server can analyze and process the received data such as the product information inquiry request and feed back the processing result to the terminal equipment.
It should be noted that, a method for data retrieval provided by the embodiment of the present invention is generally executed by the server 605, and accordingly, a device for data retrieval is generally disposed in the server 605.
It should be understood that the number of terminal devices, networks, and servers in fig. 6 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
FIG. 7 is a block diagram of a computer system 700 suitable for use with a terminal device implementing an embodiment of the invention. The terminal device shown in fig. 7 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 7, the computer system 700 includes a Central Processing Unit (CPU)701, which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)702 or a program loaded from a storage section 708 into a Random Access Memory (RAM) 703. In the RAM 703, various programs and data necessary for the operation of the system 700 are also stored. The CPU 701, the ROM 702, and the RAM 703 are connected to each other via a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.
The following components are connected to the I/O interface 705: an input portion 706 including a keyboard, a mouse, and the like; an output section 707 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 708 including a hard disk and the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. The communication section 709 performs communication processing via a network such as the internet. A drive 710 is also connected to the I/O interface 705 as needed. A removable medium 711 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 710 as necessary, so that a computer program read out therefrom is mounted into the storage section 708 as necessary.
In particular, the processes described in the above step diagrams may be implemented as computer software programs, according to embodiments of the present disclosure. For example, the disclosed embodiments of the invention include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the step diagrams. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 709, and/or installed from the removable medium 711. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 701.
It should be noted that the computer readable media shown in the present invention include computer readable signal media or computer readable storage media, or any combination of the two. A computer readable storage medium includes, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, semiconductor system, apparatus, or device, or any combination of the foregoing. Computer-readable storage media specifically include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any combination of the foregoing. In the present invention, a computer readable storage medium includes any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device; a computer readable signal medium includes a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave, which may take many forms, including, but not limited to, electromagnetic signals, optical signals, or any combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF (radio frequency), etc., or any combination of the preceding.
The block diagrams or step diagrams in the figures, which illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention, may each represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or step diagrams, and combinations of blocks in the block diagrams or step diagrams, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules or units described in the embodiments of the present invention may be implemented by software, or may be implemented by hardware. The described modules or units may also be provided in a processor, and may be described as: a processor includes a receiving module, a computing module, an indexing module, and a querying module. Where the names of such modules or units do not in some cases constitute a limitation of the module or unit itself, for example, a receiving module may also be described as a "module for receiving data retrieval requests".
On the other hand, the embodiment of the present invention also provides a computer-readable medium, which may be included in the apparatus described in the above embodiment; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: receiving a data retrieval request, wherein the data retrieval request indicates an index field; determining a hash value of the index field; determining an index tree corresponding to the hash value according to the hash value of the index field; and querying storage information corresponding to the hash value in the index tree as storage information of the data, wherein the storage information indicates a storage position of the data.
According to the technical scheme of the embodiment of the invention, the data can be stored and retrieved by using a hash algorithm and an index tree, a multi-field retrieval solution is provided, and the balanced storage of the data can be realized.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (16)
1. A method of data retrieval, comprising:
receiving a data retrieval request, wherein the data retrieval request indicates an index field;
determining a hash value of the index field;
determining an index tree corresponding to the hash value according to the hash value of the index field;
and querying storage information corresponding to the hash value in the index tree as storage information of the data, wherein the storage information indicates a storage position of the data.
2. The method of claim 1, further comprising:
and processing the storage information according to the logical relationship between the index fields indicated by the data retrieval request.
3. The method of claim 2, wherein if the logical relationship between the index fields is an and operation, the intersection of the queried storage information is used as the storage information of the data.
4. The method according to claim 2, wherein, in the case that the logical relationship between the index fields is an or operation, the union of the queried storage information is used as the storage information of the data.
5. The method of claim 1, wherein storing information comprises: a starting address of a memory block storing the data, an offset from the starting address, and a length of the data.
6. The method of claim 1, wherein the index tree is one or more of: binary tree, balanced binary tree, B-tree.
7. The method of claim 1, further comprising:
receiving a data storage request, and storing the data in a data node in a polling mode;
and generating storage information of the data according to the storage success message of the data node.
8. An apparatus for data retrieval, comprising:
a receiving module, configured to receive a data retrieval request, where the data retrieval request indicates an index field and an index field corresponding to the index field;
a calculation module for determining a hash value of the index field;
the index module is used for determining an index tree corresponding to the hash value according to the hash value of the index field;
and the query module is used for querying storage information corresponding to the hash value in the index tree as the storage information of the data, wherein the storage information indicates the storage position of the data.
9. The apparatus of claim 8, wherein the query module is further configured to process the storage information according to a logical relationship between the index fields indicated by the data retrieval request.
10. The apparatus of claim 9, wherein the query module is further configured to use an intersection of the queried storage information as the storage information of the data if the logical relationship between the index fields is an and operation.
11. The apparatus of claim 9, wherein the query module is further configured to use the union of the queried storage information as the storage information of the data if the logical relationship between the index fields is an or operation.
12. The apparatus of claim 8, wherein the stored information comprises: a starting address of a memory block storing the data, an offset from the starting address, and a length of the data.
13. The apparatus of claim 8, wherein the index tree is one or more of: binary tree, balanced binary tree, B-tree.
14. The apparatus of claim 8, further comprising:
the gateway module is used for receiving a data storage request and storing the data in the data nodes in a polling mode;
and generating storage information of the data according to the storage success message of the data node.
15. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.
16. A computer-readable medium, on which a computer program is stored, which, when being executed by one or more processors, carries out the method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811195686.9A CN111061680A (en) | 2018-10-15 | 2018-10-15 | Data retrieval method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811195686.9A CN111061680A (en) | 2018-10-15 | 2018-10-15 | Data retrieval method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111061680A true CN111061680A (en) | 2020-04-24 |
Family
ID=70296241
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811195686.9A Pending CN111061680A (en) | 2018-10-15 | 2018-10-15 | Data retrieval method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111061680A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112214803A (en) * | 2020-10-21 | 2021-01-12 | 北京八分量信息科技有限公司 | Method and device for querying data in trusted computing and related product |
| CN113468549A (en) * | 2021-04-29 | 2021-10-01 | 深圳前海移联科技有限公司 | Retrieval method and system for encrypted information evidence based on block chain and electronic equipment |
| WO2022083267A1 (en) * | 2020-10-23 | 2022-04-28 | 华为技术有限公司 | Data processing method, apparatus, computing node, and computer readable storage medium |
| CN115994145A (en) * | 2023-02-09 | 2023-04-21 | 中国证券登记结算有限责任公司 | Method and device for processing data |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101315628A (en) * | 2007-06-01 | 2008-12-03 | 华为技术有限公司 | Internal memory database system and method and device for implementing internal memory data base |
| JP2012230493A (en) * | 2011-04-25 | 2012-11-22 | Toshiba Corp | Retrieval device, retrieval method, and program |
| CN103229164A (en) * | 2011-11-24 | 2013-07-31 | 华为技术有限公司 | Data access method and device |
| US20160275146A1 (en) * | 2013-10-04 | 2016-09-22 | Koutin Technology Inc. Ltd | Use a parallel hardware search device to implement big databases efficiently |
| CN107346307A (en) * | 2016-05-04 | 2017-11-14 | 北京京东尚科信息技术有限公司 | Distributed cache system and method |
-
2018
- 2018-10-15 CN CN201811195686.9A patent/CN111061680A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101315628A (en) * | 2007-06-01 | 2008-12-03 | 华为技术有限公司 | Internal memory database system and method and device for implementing internal memory data base |
| JP2012230493A (en) * | 2011-04-25 | 2012-11-22 | Toshiba Corp | Retrieval device, retrieval method, and program |
| CN103229164A (en) * | 2011-11-24 | 2013-07-31 | 华为技术有限公司 | Data access method and device |
| US20160275146A1 (en) * | 2013-10-04 | 2016-09-22 | Koutin Technology Inc. Ltd | Use a parallel hardware search device to implement big databases efficiently |
| CN107346307A (en) * | 2016-05-04 | 2017-11-14 | 北京京东尚科信息技术有限公司 | Distributed cache system and method |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112214803A (en) * | 2020-10-21 | 2021-01-12 | 北京八分量信息科技有限公司 | Method and device for querying data in trusted computing and related product |
| CN112214803B (en) * | 2020-10-21 | 2023-12-01 | 北京八分量信息科技有限公司 | Method and device for inquiring data in trusted computing and related products |
| WO2022083267A1 (en) * | 2020-10-23 | 2022-04-28 | 华为技术有限公司 | Data processing method, apparatus, computing node, and computer readable storage medium |
| CN113468549A (en) * | 2021-04-29 | 2021-10-01 | 深圳前海移联科技有限公司 | Retrieval method and system for encrypted information evidence based on block chain and electronic equipment |
| CN115994145A (en) * | 2023-02-09 | 2023-04-21 | 中国证券登记结算有限责任公司 | Method and device for processing data |
| CN115994145B (en) * | 2023-02-09 | 2023-08-22 | 中国证券登记结算有限责任公司 | Method and device for processing data |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107704202B (en) | Method and device for quickly reading and writing data | |
| CN109614402B (en) | Multidimensional data query method and device | |
| CN111061680A (en) | Data retrieval method and device | |
| CN107229718B (en) | Method and device for processing report data | |
| CN107729399B (en) | Data processing method and device | |
| CN110909022A (en) | Data query method and device | |
| CN115168362A (en) | Data processing method and device, readable medium and electronic equipment | |
| CN111753019A (en) | Data partitioning method and device applied to data warehouse | |
| CN108804451B (en) | Method and device for generating primary key, electronic equipment and readable storage medium | |
| CN110795494A (en) | Automatic testing method and device for synchronous and asynchronous cache data | |
| CN113760948A (en) | Data query method and device | |
| CN113704245A (en) | Database main key generation method, sub-table positioning method and device | |
| CN112115206A (en) | Method and device for processing object storage metadata | |
| CN110795419A (en) | Method and device for dynamic database-based routing | |
| CN110866001A (en) | Method and device for determining order to be processed | |
| CN113448957A (en) | Data query method and device | |
| CN113127416A (en) | Data query method and device | |
| CN112711572A (en) | Online capacity expansion method and device suitable for sub-warehouse and sub-meter | |
| CN108733668B (en) | Method and device for querying data | |
| CN113760600A (en) | Database backup method, database restoration method and related device | |
| CN113760966A (en) | Data processing method and device based on heterogeneous database system | |
| CN113704242A (en) | Data processing method and device | |
| CN113268488B (en) | Method and device for data persistence | |
| CN113495891A (en) | Data processing method and device | |
| CN110109919B (en) | Method and device for determining logic information |
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 |