CN102890675B - Method and device for storing and finding data - Google Patents
Method and device for storing and finding data Download PDFInfo
- Publication number
- CN102890675B CN102890675B CN201110201149.2A CN201110201149A CN102890675B CN 102890675 B CN102890675 B CN 102890675B CN 201110201149 A CN201110201149 A CN 201110201149A CN 102890675 B CN102890675 B CN 102890675B
- Authority
- CN
- China
- Prior art keywords
- data
- file
- index
- stored
- index information
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 71
- 238000013507 mapping Methods 0.000 claims abstract description 27
- 238000000605 extraction Methods 0.000 claims description 14
- 230000005540 biological transmission Effects 0.000 claims description 5
- 238000013500 data storage Methods 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000007717 exclusion Effects 0.000 description 1
- 238000004064 recycling Methods 0.000 description 1
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method and a device for storing and finding data, which aims at solving the problems in the prior art that the method for storing the data reduces the efficiency for finding the data. The method is characterized in that data is numbered and stored, indexing information forming a mapping relation with the data is generated for each data, the indexing information is stored in a linked list area of an indexing file, modulus operation is conducted for the serial number of the data and quantity of storage spaces in a barrel area of the indexing file, and indication information indicating a storage position of the indexing information is stored into the storage space with the serial number being identical to the modulus operation result in the barrel area of the indexing file. By adopting the method for storing the data, when the data is searched, the serial number of the data to be searched and the quantity of the storage space of the barrel area have the modulus operation, the indication information is searched, the indexing information is searched in the linked list according to the indication information, and the corresponding data is searched according to the indexing information, so that the data can be rapidly searched, and the efficiency for searching the data can be improved.
Description
Technical field
The application relates to field of computer technology, particularly relates to a kind of data and stores and the method for searching and device.
Background technology
In search engine system, more new node is connected with multiple search node, more the data that provide for storing other network equipments of new node, and search node is for obtaining the data stored in more new node.
Because search node is when obtaining data, the reception order of each data must be received according to more new node, the each data of acquisition of order, therefore in the prior art, more the method for new node storage data is, according to the reception order receiving each data, each data of storage of order, and be that each data arrange numbering according to reception order.Such as, more new node received data A at the 1st second, then store this data A, and this data A is set be numbered 1, received data B at the 2nd second, then store this data B, and this data B is set be numbered 2, by that analogy.
When search node obtains data, first to more new node transmission acquisition request, wherein obtain the numbering of carrying the data that will obtain in request.Because more new node is that the numbering that each data are arranged is arranged according to reception order, therefore search node only needs according to numbering order from small to large, obtain data corresponding to numbering successively, such as search node obtains the data being numbered 1, then only need to obtain the data being numbered 2, by that analogy next time.After more new node receives the request of acquisition, according to the numbering obtaining the data of carrying in request, and the maximum numbering of self preserving, adopt the method for binary chop to determine the Serial Number Range at the numbering place of these data, and search the data of this numbering, the data found are supplied to search node.
Illustrate in prior art the detailed process adopting the method for binary chop to search the data of this numbering below, such as, more store the data being numbered 1 ~ 100 in new node, search node send acquisition request in carry data be numbered 23, then more new node gets the intermediate value 50 of numbering 1 ~ 100, judge that this intermediate value 50 is greater than this numbering 23, then determine that the numbering 23 of these data is in the scope of numbering 1 ~ 50, binary chop is adopted to continue to continue to search in the scope of numbering 1 ~ 50, get the intermediate value 25 of numbering 1 ~ 50, judge that this intermediate value 25 is greater than this numbering 23, then determine that the numbering 23 of these data is in the scope of numbering 1 ~ 25 further, binary chop is adopted to continue to continue to search in the scope of numbering 1 ~ 25, by that analogy, until finding till this Serial Number Range only comprises numbering 23, the data of this numbering 23 are supplied to search node.
As can be seen from upper example, in prior art, more the method for new node storage data can reduce the efficiency of searching data, can not find the data required for search node fast.
Summary of the invention
The embodiment of the present application provides a kind of data to store and the method for searching and device, can reduce the problem of the efficiency of searching data in order to solve in prior art the method storing data.
The method that a kind of data that the embodiment of the present application provides store, comprising:
Receive each data, according to the reception order receiving each data, for each data arrange corresponding numbering, and store each data and numbering corresponding to each data;
For each data received, generate the index information with these data stored with mapping relations, and the numbering of these data is carried in this index information of generation, this index information is stored in the chained list district of index file;
By the numbering of these data, carry out modulo operation with the quantity of the storage space comprised in the bucket region of this index file;
According to the result of modulo operation, this index information of instruction is stored in the indication information of the memory location in chained list district, is stored in the storage space that in the bucket region of this index file, row number is equal with the result of modulo operation.
The method of a kind of data search that the embodiment of the present application provides, comprising:
According to the numbering of the data of carrying in the acquisition request that the search node received sends, and the quantity of the storage space comprised in the bucket region of index file, this numbering and this quantity are carried out modulo operation;
According to the result of modulo operation, in the storage space that row number is equal with this result in the bucket region of this index file, obtain indication information;
According to the memory location in the chained list district of this index file of the indication information instruction obtained, the corresponding memory location in the chained list district of this index file obtains index information corresponding to these data;
According to this index information obtained, and the mapping relations of the index information preserved and data, search the data that this index information of acquisition is corresponding.
The device that a kind of data that the embodiment of the present application provides store, comprising:
Memory module, for receiving each data, according to the reception order receiving each data, for each data arrange corresponding numbering, and stores each data and numbering corresponding to each data;
Generation module, for for each data received, generates the index information with these data stored with mapping relations, and is carried in this index information of generation by the numbering of these data, be stored to by this index information in the chained list district of index file;
Computing module, for the numbering by these data, carries out modulo operation with the quantity of the storage space comprised in the bucket region of this index file;
Indication information memory module, for the result according to modulo operation, is stored in the indication information of the memory location in chained list district, is stored in the storage space that in the bucket region of this index file, row number is equal with the result of modulo operation by this index information of instruction.
The device of a kind of data search that the embodiment of the present application provides, comprising:
Computing module, for the numbering according to the data of carrying in the acquisition request of the search node transmission received, and the quantity of the storage space comprised in the bucket region of index file, this numbering and this quantity are carried out modulo operation;
Indication information acquisition module, for the result according to modulo operation, obtains indication information in the storage space that row number is equal with this result in the bucket region of this index file;
Index information acquisition module, for the memory location in the chained list district of this index file according to the indication information instruction obtained, the corresponding memory location in the chained list district of this index file obtains index information corresponding to these data;
Search module, for this index information according to acquisition, and the mapping relations of the index information preserved and data, search the data that this index information of acquisition is corresponding.
The embodiment of the present application provides a kind of data to store and the method for searching and device, the method is numbered each data received and stores, for each data received, generate the index information with these data stored with mapping relations, and this index information is stored in the chained list district of index file, the quantity of the storage space comprised in the bucket region of the numbering of these data and this index file is carried out modulo operation, and this index information of instruction is stored in the indication information of the memory location in chained list district, be stored in the storage space that in the bucket region of this index file, row number is equal with the result of modulo operation.Due to the index information and the indication information that adopt said method to store data in the embodiment of the present application, thus when searching data, the quantity of the storage space comprised in the numbering of the data that will search and bucket region carries out modulo operation, search indication information, according to the indication information found, in chained list district, search corresponding index information, then search corresponding data according to index information, therefore can find the data required for search node fast, improve the efficiency of searching data.
Accompanying drawing explanation
The process that the data that Fig. 1 provides for the embodiment of the present application store;
The format chart of the index file that Fig. 2 provides for the embodiment of the present application;
The process of the data search that Fig. 3 provides for the embodiment of the present application;
The format chart of the data file that Fig. 4 provides for the embodiment of the present application;
The apparatus structure schematic diagram that the data that Fig. 5 provides for the embodiment of the present application store;
The apparatus structure schematic diagram of the data search that Fig. 6 provides for the embodiment of the present application.
Embodiment
The embodiment of the present application provides a kind of data to store and the method for searching and device, the method is numbered each data received and stores, for each data received, generate the index information with these data stored with mapping relations, and this index information is stored in the chained list district of index file, the quantity of the storage space comprised in the bucket region of the numbering of these data and this index file is carried out modulo operation, and this index information of instruction is stored in the indication information of the memory location in chained list district, be stored in the storage space that in the bucket region of this index file, row number is equal with the result of modulo operation.Due to the index information and the indication information that adopt said method to store data in the embodiment of the present application, thus when searching data, the quantity of the storage space comprised in the numbering of the data that will search and bucket region carries out modulo operation, search indication information, according to the indication information found, in chained list district, search corresponding index information, then search corresponding data according to index information, therefore can find the data required for search node fast, improve the efficiency of searching data.
Below in conjunction with Figure of description, the utility model embodiment is described in detail.
The process that the data that Fig. 1 provides for the embodiment of the present application store, specifically comprises the following steps:
S101: receive each data, according to the reception order receiving each data, for each data arrange corresponding numbering, and stores each data and numbering corresponding to each data.
In the embodiment of the present application, when more new node stores the data that other network equipments provide, for each data arrange unique numbering, this numbering is unique identification information of data.Because search node is when obtaining data, the reception order of each data must be received according to more new node, the each data of acquisition of order, therefore more new node receives each data that other network equipments provide, and store each data received, according to the reception order receiving each data, for each data stored arrange corresponding numbering.Such as, more new node received data A at the 1st second, then store this data A, and this data A is set be numbered 1, received data B at the 2nd second, then store this data B, and this data B is set be numbered 2, by that analogy.
S102: for each data received, generates the index information with these data stored with mapping relations, and is carried in this index information of generation by the numbering of these data, be stored in the chained list district of index file by this index information.
In the embodiment of the present application, for each data, more new node sets up the mapping relations of index information and these data, and is stored in the chained list district of index file by this index information.
S103: by the numbering of these data, carries out modulo operation with the quantity of the storage space comprised in the bucket region of this index file.
Wherein, each storage space comprised in the bucket region of index file is for storing indication information, and this indication information is used to indicate the memory location of index information in chained list district of certain data.
S104: according to the result of modulo operation, is stored in the indication information of the memory location in chained list district, is stored in the storage space that in the bucket region of this index file, row number is equal with the result of modulo operation by this index information of instruction.
Due to the index information and the indication information that adopt said method to store data in the embodiment of the present application, thus when searching data, the quantity of the storage space comprised in the numbering of the data that will search and bucket region carries out modulo operation, according to the result of modulo operation, the storage space that in the bucket region of indexed file, row number is equal with the result of modulo operation searches indication information, according to the indication information found, corresponding index information is searched in chained list district, corresponding data are searched again according to index information, therefore the data required for search node can be found fast, improve the efficiency of searching data.
The format chart of the index file that Fig. 2 provides for the embodiment of the present application, as shown in Figure 2, in this index file, comprises the file header of this index file, bucket region and chained list district.Each storage space in bucket region is for storing the indication information of the memory location of index information in chained list district of certain data of instruction, and for each storage space in bucket region, the row number of this storage space is the position of this storage space in bucket region.Each memory location in chained list district is for storing index information.
Wherein, the file header of index file comprises Min_Seq field, Index_Len field and Write_pos field, Min_Seq field is for recording in this index file the lowest number of the data of carrying in all index informations of storing, the data of index information 1 correspondence such as, stored in this index file be numbered 1, the data of index information 2 correspondence be numbered 2, the data of index information 3 correspondence be numbered 3, then the lowest number of the data of Min_Seq field record is 1.Index_Len field is for recording the total length of this index file.Write_pos field is for recording memory location when once storing index information in the chained list district of this index file.Such as, store 3 index informations in the chained list district of this index file current, index information 1 is stored in the memory location 1 in chained list district, index information 2 is stored in the memory location 2 in chained list district, index information 3 is stored in the memory location 3 in chained list district, when then storing index information next time, this index information should be stored in the memory location 4 in chained list district, therefore Write_pos field record in the chained list district of this index file, store index information next time time memory location be memory location 4.
In fig. 2, each storage space in bucket region is for storing indication information, and this indication information is used to indicate the memory location of index information in chained list district of certain data.The method storing indication information is: by the numbering of these certain data, carry out modulo operation with the quantity of the storage space comprised in the bucket region of this index file, indication information corresponding for these certain data is stored in the storage space that in barrel region, row number is equal with the result of modulo operation.Such as, the quantity of the storage space comprised in the bucket region of this index file is 100, that supposes these data is numbered 10, then this numbering 10 is carried out modulo operation with the quantity 100 of storage space, also by the quantity 100 remainder number of this numbering 10 divided by storage space, remainder is 10, then the indication information of these data being stored in row number in barrel region is in the storage space of 10, suppose that this index information being numbered the data of 10 memory location in chained list district is 11, then the indication information of these data indicates the index information of these data to be 11 in the memory location in chained list district.
Accordingly, when adopting said method to store data, upgrade the method for node checks data as shown in Figure 3, the process of the data search that Fig. 3 provides for the embodiment of the present application, specifically comprises the following steps:
S301: according to the numbering of the data of carrying in the acquisition request that the search node received sends, and the quantity of the storage space comprised in the bucket region of index file, carry out modulo operation by this numbering and this quantity.
S302: according to the result of modulo operation, obtains indication information in the storage space that row number is equal with this result in the bucket region of this index file.
In the embodiment of the present application, data are stored owing to adopting method as shown in Figure 1, therefore this data to be searched by the index information of these data, and the index information of these data will be searched, first will search the indication information of these data, therefore the quantity of the storage space comprised in the bucket region of the numbering of these data and index file is carried out modulo operation, its operation result is exactly the row number of the storage space of indication information in bucket region of these data.
S303: according to the memory location in the chained list district of this index file of the indication information instruction obtained, the corresponding memory location in the chained list district of this index file obtains index information corresponding to these data.
Continue along being described by example, the quantity of the storage space comprised in the bucket region of this index file is 100, that supposes to obtain in asking these data of carrying is numbered 10, then this numbering 10 is carried out modulo operation with the quantity 100 of storage space, also by the 100 remainder numbers of this numbering 10 divided by storage space, remainder is 10, row number then in the bucket region of this index file found is in the storage space of 10, obtain the indication information of these data, suppose that the memory location of index information in chained list district that this indication information obtained indicates is 11, then according to this indication information, in the memory location in chained list district be 11 memory location on obtain the index information of these data.
S304: according to this index information obtained, and the mapping relations of the index information preserved and data, search the data that this index information of acquisition is corresponding.
As can be seen from said process, based on the method for the data storage that Fig. 1 provides, the method for above-mentioned data search, compared to binary chop of the prior art, can improve the efficiency of data search.
Preferably, search the accuracy of data to improve further, the method that more new node stores each data is specially, for each data received, according to the data source of these data, these data and numbering corresponding to this data are stored to should data data source data file in.Also namely, for each data of same data source, each data of this same data source are kept in data file corresponding to this data source.
When adopting said method to store data, for each data received, according to the memory location of these data in the data file at this data place, generate the index information with the memory location of these data in the data file at this data place with mapping relations.Such as, the data source of this data A is data source a, and this data A memory location be stored in data file corresponding to this data source a is 100, then set up the index information generated for this data A, the mapping relations of memory location 100 in the data file corresponding with this data source a.
Accordingly, in the data search process shown in Fig. 3, the process of step S304 is specially, according to this index information obtained, and the mapping relations of the index information preserved and the memory location of data in the data file at this data place, search the data that this index information of acquisition is corresponding.Continue along being described by example, according to the index information of this data A obtained, and the mapping relations of memory location 100 in this index information data file corresponding with this data source a, search the data in data file corresponding to this data source a, memory location 100 stored, then the data found are data A.
In the embodiment of the present application, in order to improve the accuracy of searching data further, in the step S102 shown in Fig. 1, more the method that this index information generated is stored in the chained list district of index file is specially by new node, according to data source and the priority of this data under this data source of these data, in the index file that this priority be stored under this data source by this index information generated is corresponding.Also namely, for same data source, and each data that priority under this same data source is also identical, the index information of these each data is stored in index file corresponding to this priority under this data source.
Accordingly, when adopting said method to store index information, search node except carrying the numbering of the data that this search node will obtain, also carries data source and the priority of the data that this search node will obtain in the acquisition request of more new node transmission.Then before the step S301 shown in above-mentioned Fig. 3 performs, also according to data source and the priority obtaining these data of carrying in request, the index file storing index information corresponding to these data to be searched.After finding the index file at index information place corresponding to these data, then by the numbering of these data, carry out modulo operation with the quantity of the storage space comprised in the bucket region of the index file found, and proceed subsequent step.
In the embodiment of the present application, storage means due to indication information is by the quantity modulo operation of the storage space comprised in the numbering of certain data and bucket region, obtain result, the indication information of these certain data is stored in the storage space that in barrel region, row number is equal with this operation result, therefore may there is the situation about coming to the same thing of the numbering of two or more data and the quantity modulo operation of this storage space, also namely clash.Therefore, in the embodiment of the present application, in the step S104 shown in Fig. 1, this index information of instruction is stored in the indication information of the memory location in chained list district, the method be stored in the storage space that in the bucket region of this index file, row number is equal with the result of modulo operation also comprises, when having stored indication information in the storage space that row number is equal with the result of modulo operation in the bucket region of this index file, keep the indication information that stores in this storage space constant, and whether the value judging the hop field of the index information that the memory location in chained list district of the indication information instruction stored in this storage space stores is 0, if, then the value of this hop field is revised as this index information and is stored in memory location in chained list district, otherwise, whether the hop field continuing to judge the index information that memory location that in the chained list district of this index file, memory location is equal with the value of this hop field stores is 0.
As shown in Figure 2, Sequence field is comprised in the index information stored in the chained list district of this index file, File_no field, Data_offset field, and Hash_next_offset field, this Sequence field is the numbering of data corresponding to this index information, the identification information of the data file at the data place that this index information of File_no field record is corresponding, the data that this index information of Data_offset field record is corresponding are stored in the memory location in this data file, and Hash_next_offset field is hop field.
Continue along being described by example, the quantity of the storage space comprised in the bucket region of this index file is 100, suppose that in the bucket region of this index file, row number is the indication information having stored the data being numbered 10 in the storage space of 10, it is on the memory location of 11 that this index information being numbered the data of 10 of this indication information instruction is stored in memory location, chained list district.To store now index information and the indication information of the data being numbered 110, because the result of the numbering 110 of these data and quantity 100 modulo operation of storage space is still 10, therefore keep this row number in bucket region to be that indication information in the storage space of 10 is constant, and judge the memory location in the chained list district indicated by this indication information stored in the storage space that this row number is 10 be 11 memory location on hop field in the index information that stores whether be 0.If, then the value of this hop field is revised as this index information being numbered the data of 110 and is stored in memory location in chained list district, supposing that the index information memory location be stored in chained list district that this is numbered the data of 110 is 111, is then that the value of the hop field of the index information of 11 is revised as 111 by this memory location.Otherwise, whether continue to judge to be the hop field of index information on memory location that the value of the hop field of the index file of 11 is equal with this memory location in chained list district is 0, suppose that the index information memory location be stored in chained list district that this is numbered the data of 110 is 111, this memory location is the value of the hop field of the index file of 11 is 12, then continue to judge whether memory location in chained list district be the hop field of the index information of 12 is 0, if, be then that the value of the hop field of the index information of 12 is revised as 111 by this memory location, also namely according to hop field, whether the hop field judging the index information on the memory location equal with the value of hop field is 0, till finding hop field to be the index information of 0, the hop field of this index information found is revised as this index information being numbered the data of 110 and is stored in memory location in chained list district.
Accordingly, when adopting said method to store indication information and index information, after the step S303 shown in Fig. 3, namely after more new node obtains index information, also to judge the numbering of the data of carrying in this index information obtained, with described obtain ask in the numbering changing data of carrying whether identical, if, then using this index information obtained as index information corresponding to these data obtained, otherwise, according to the value of the hop field of this index information obtained, memory location equal with the value of this hop field in the chained list district of this index file obtains index information again, and judge the numbering of the data of carrying in the index information again obtained, with described obtain ask in the numbering of these data of carrying whether identical, the numbering of data of carrying in the index information obtained with described obtain ask in the numbering of these data of carrying identical till.
Continue along being described by example, the index information of the data being numbered 10 is stored in this index file, and be numbered the index information of data of 110, the quantity of the storage space comprised in the bucket region of this index file is 100, suppose that in the bucket region of this index file, row number is the indication information having stored the data being numbered 10 in the storage space of 10, it is on the memory location of 11 that this index information being numbered the data of 10 of this indication information instruction is stored in memory location, chained list district, and the value that the memory location in chained list district is hop field in the index information of 11 is 111, when then will search the data being numbered 110, after determining that storing this is numbered this index file of the index information of the data of 110, by quantity 100 modulo operation of this numbering 110 with the storage space in bucket region, result is 10, in bucket region, row number is obtain indication information in the storage space of 10, the memory location 11 in the chained list district indicated by this indication information obtained, in the memory location in chained list district be 11 memory location on obtain index information, and whether the numbering judging the data of carrying in the index information obtained is 110, the index information being 11 due to this memory location is that this is numbered the index information of the data of 10, therefore its data of carrying be numbered 10, be not equal to 110, thus be the hop field 111 of 11 according to this memory location, in the memory location in chained list district be 111 memory location on again obtain index information, continue to judge the memory location that again obtains be 111 the index information numbering of data of carrying whether be 110, if, then this index information is that this is numbered the index information of the data of 110, otherwise continue to search according to hop field.
In addition, after finding index information, the data file at the data place that this index information is corresponding can be determined according to the File_no field in index information, and determine that data that this index information is corresponding are stored in the memory location in this data file according to the Data_offset field in index information, the corresponding memory location in established data file obtains data corresponding to this index information.
In the embodiment of the present application, search the efficiency of data to improve further, and meet the elongated storage of data, data file corresponding to same data source can be several, also namely for certain data, the data file of the data source of these data is several data files.And, when storing each data in these several data files, these several data files are what recycle, concrete grammar is, according to the data source of each data of the same data source received, these each data are stored in several data files of this data source according to reception order successively, wherein, when certain data file of this data source is filled with, the each data do not stored are continued to be stored in the next data file of this data source successively according to reception order, when all data files of this data source are all filled with, extract the data file that the numbering of the data of current storage is minimum, the each data do not stored are continued to cover according to reception order the data stored in the data file of extraction successively.Such as, data file corresponding to this data source is 3, be respectively data file 1, data file 2 and data file 3, then according to the reception order of each data of this data source received, first successively each data are stored in data file 1, when data file 1 is filled with, the remaining data do not stored are continued to be stored in data file 2 successively according to reception order, by that analogy.When these 3 data files are all filled with, extract the data file that the numbering of the data of current storage is minimum, numbering due to data arranges from small to large according to the order received, therefore the data file that the numbering of the data of current storage is minimum is data file 1, each data do not stored is continued to cover according to reception order each data stored in this data file 1 successively.
The format chart of the data file that Fig. 4 provides for the embodiment of the present application, as shown in Figure 4, in this data file, comprises the file header of data file, and data field.Each memory location of this data field is for storing data.
Wherein, the file header of this data file comprises Write_offset field, Data_Len field and Min_seq_set field.Write_offset field once stores the memory location of data in the data field of this data file for recording, such as, store 3 data in the data field of this data file current, data 1 are stored in the memory location 1 of data field, data 2 are stored in the memory location 2 of data field, data 3 are stored in the memory location 3 of data field, when then storing data next time, should store data in the memory location 4 of data field, therefore the memory location next time storing data in the data field of this data file of Write_offset field record is memory location 4.Data_Len field is for recording the length of the data field of this data file.Min_seq_set field is for recording the lowest number of the data stored in this data file, data 1 correspondence such as, stored in this data file be numbered 1, data 2 correspondence be numbered 2, data 3 correspondence be numbered 3, then the lowest number of the data of Min_seq_set field record is 1.
In the embodiment of the present application, in order to ensure that more new node searches the search procedure of data in certain data file, the storing process storing data with more new node in this certain data file is independent of each other, namely the read-write not mutual exclusion for each data file is ensured, before each data do not stored are continued to cover according to reception order the data stored in the data file of extraction successively, also the data stored in the data file of extraction to be set to not readable, while avoiding storing data in this data file, in this data file, search data.
Wherein, the data stored in the data file of extraction are set to unreadable method be specially, the lowest number changing the data stored in next data file recorded in file header according to the next data file of the data file extracted, and the data source that the data file extracted is corresponding, the lowest number of the data recorded in the file header of index file corresponding for all priority under this data source is revised as the lowest number changing the data stored in next data file, wherein, for each index file, by the lowest number of data of carrying in the index information stored in this index file, be recorded in the file header of this index file.The form of index file as shown in Figure 2, the lowest number of the data of carrying in all index informations stored in this index file of Min_Seq field record in the header file of index file.Due to when more new node searches certain index information in this index file, be not less than in the numbering of carrying data in the index information of the lowest number of the data recorded in the file header of this index file and search, therefore after revising the lowest number of the data recorded in the file header of index file, more new node then no longer searches the index information that the numbering of carrying is less than this lowest number, accordingly, also would not search data in the data file extracted, achieve the data stored in the data file by extraction and be set to not readable.
Continue along being described by example, when data file 1, data file 2 and data file 3 are all filled with, to the data do not stored be stored in data file 1, now according to the next data file of this data file 1, the lowest number of the data stored in this data file 2 recorded in the file header of i.e. data file 2, and the data source of this data file 1 correspondence, by the lowest number of data recorded in the file header of index file corresponding for all priority under this data source, be revised as the lowest number of the data that this data file 2 stores.When more searching index information in new node indexed file, be not less than in the numbering of carrying data in the index information of the lowest number of the data recorded in the file header of this index file and search, for the index information being less than this lowest number, then do not search, the data that the index information 1 such as, stored in index file carries be numbered 1, the data that index information 2 carries be numbered 2, the data that index information 3 carries be numbered 3, if the lowest number recorded in the file header of this index file is 2, when then searching index information in this index file, only search in the index information being not less than this lowest number 2, also namely search in index information 2 and index information 3, and index information 1 can not be searched.Therefore the as above routine described lowest number will recorded in the file header of index file corresponding for all priority under this data source, after being revised as the lowest number of this data file 2 storage, more new node can not search the index information being less than this amended lowest number, also would not search data in data file 1.
In addition, the data stored in the data file of extraction being set to unreadable method can also be, the data source corresponding according to the data file extracted, determine the index file that all priority under this data source are corresponding, for each index file determined, according to the memory location storing index information in the chained list district of this index file of recording in the file header of this index file next time, and the lowest number of the data stored in this next data file recorded in the file header of the next data file of the data file extracted, in the chained list district of this index file, last memory location from the memory location of record to chained list district, search the numbering of the data of carrying in the index information stored in each memory location successively, until the numbering finding the data of carrying is not less than the index information of the lowest number of the data stored in this next data file, the lowest number of the data recorded in the file header of this index file is revised as the numbering of the data of carrying in the index information found.
Continue along being described by example, data file 1, when data file 2 and data file 3 are all filled with, to the data do not stored be stored in data file 1, now according to the data source of this data file 1, determine the index file that all priority under this data source are corresponding, for each index file determined, according to the memory location storing index information in the chained list district of this index file of recording in the file header of this index file next time, this memory location next time of hypothetical record is 15, and the next data file of this data file 1, the lowest number of the data stored in this data file 2 recorded in the file header of i.e. data file 2, suppose that this lowest number is 20, then in the chained list district of this index file, be 15 from the memory location of record, to last memory location in chained list district, search the numbering of the data of carrying in the index information stored in each memory location successively, until find the index information that the numbering of carrying data is not less than this lowest number 20, the lowest number of the data recorded in the file header of this index file is revised as the numbering of the data of carrying in the index information found.Same, during owing to searching index information in more new node indexed file, be not less than in the numbering of carrying data in the index information of the lowest number of the data recorded in the file header of this index file and search, for the index information being less than this lowest number, then do not search, therefore as above routine described by record in the file header of this index file lowest number amendment after, more new node can not search the index information being less than this amended lowest number in this index file, also the index information that numbering is less than 20 namely can not be searched in this index file, therefore also data would not be searched in data file 1.
Same, in the embodiment of the present application, in order to improve the efficiency of searching data further, index file corresponding to the same priority under same data source can be several, also namely for the data of certain priority under certain data source, index file corresponding to this priority under this data source is several index files.And, when storing index information in these several index files, these several index files are what recycle, concrete grammar is, according to data source and the priority of each data of the equal priority under the same data source received, by to should the index information of each data genaration, in several index files that this priority be stored to successively under this data source according to the order receiving these each data is corresponding, wherein, when certain index file that this priority under this data source is corresponding is filled with, in the next index file that this priority being continued by each index information do not stored to be stored to successively under this data source according to the reception order of the data of correspondence is corresponding, when all index files that this priority under this data source is corresponding are all filled with, search the index file carrying the index information place of the lowest number of data of current storage, the each index file do not stored is continued cover according to the reception order of the data of correspondence the index information stored in the index file found successively.The method of several data files that this process is corresponding with recycling same data source is substantially same, just repeats no longer one by one here.
In the embodiment of the present application, due to the restriction of system performance, the quantity of the index file that the same priority under same data source is corresponding is too much unsuitable, need the quantity of configuration index file as required, the quantity of the index file that such as, same priority under same data source is corresponding can be two.
The apparatus structure schematic diagram that the data that Fig. 5 provides for the embodiment of the present application store, specifically comprises:
Memory module 501, for receiving each data, according to the reception order receiving each data, for each data arrange corresponding numbering, and stores each data and numbering corresponding to each data;
Generation module 502, for for each data received, generate first index information with these data stored with mapping relations, and the numbering of these data is carried in this first index information of generation, this first index information is stored in the chained list district of index file;
Computing module 503, for the numbering by these data, carries out modulo operation with the quantity of the storage space comprised in the bucket region of this index file;
Indication information memory module 504, for the result according to modulo operation, this first index information of instruction is stored in the indication information of the memory location in chained list district, is stored in the storage space that in the bucket region of this index file, row number is equal with the result of modulo operation.
Described memory module 501 specifically for, for each data received, according to the data source of these data, these data and numbering corresponding to this data are stored to should data data source data file in.
Described generation module 502 specifically for, according to the memory location of these data in the data file at this data place, generate, with the memory location of these data in the data file at this data place, there is the first index information of mapping relations.
Described generation module 502 specifically for, according to data source and the priority of this data under this data source of these data, this first index information generated is stored in index file corresponding to this priority under this data source.
Described indication information memory module 504 also for, when having stored indication information in the storage space that row number is equal with the result of modulo operation in the bucket region of this index file, keep the indication information that stores in this storage space constant, and whether the value judging the hop field of the second index information that the memory location in chained list district of the indication information instruction stored in this storage space stores is 0, if, then the value of this hop field is revised as this first index information and is stored in memory location in chained list district, otherwise, whether the hop field continuing to judge the second index information that memory location that in the chained list district of this index file, memory location is equal with the value of this hop field stores is 0.
Described memory module 501 specifically for, according to the data source of each data of the same data source received, these each data are stored in several data files of this data source according to reception order successively, wherein, the data file of this data source is several data files, when certain data file of this data source is filled with, the each data do not stored are continued to be stored in the next data file of this data source successively according to reception order, when all data files of this data source are all filled with, extract the data file that numbering corresponding to current storage data is minimum, the each data do not stored are continued to cover according to reception order the data stored in the data file of extraction successively.
Described memory module 501 also for, before each data do not stored being continued cover according to reception order the data stored in the data file of extraction successively, the data stored are set to not readable in the data file of extraction.
Described memory module 501 comprises:
Record sub module 5011, for for each data file, is recorded in the file header of this data file by the lowest number of the data stored in this data file;
Submodule 5012 is set, the lowest number of the data stored in this next data file recorded in the file header for the next data file according to the data file extracted, and the data source that the data file extracted is corresponding, the lowest number of the data recorded in the file header of index file corresponding for priority all under this data source is revised as the lowest number of the data stored in this next data file, wherein, for each index file, by the lowest number of data of carrying in the index information stored in this index file, be recorded in the file header of this index file.
Described memory module 501 comprises:
Record sub module 5011, for for each data file, is recorded in the file header of this data file by the lowest number of the data stored in this data file;
Submodule 5012 is set, for the data source corresponding according to the data file extracted, determine the index file that all priority under this data source are corresponding, for each index file determined, according to the memory location storing index information in the chained list district of this index file of recording in the file header of this index file next time, and the lowest number of the data stored in this next data file recorded in the file header of the next data file of the data file extracted, in the chained list district of this index file, last memory location from the memory location of record to chained list district, search the numbering of the data of carrying in the index information stored in each memory location successively, until the numbering finding the data of carrying is not less than the index information of the lowest number of the data stored in this next data file, the lowest number of the data recorded in the file header of this index file is revised as the numbering of the data of carrying in the index information found, wherein, for each index file, by the lowest number of data of carrying in the index information stored in this index file, be recorded in the file header of this index file.
Described generation module 502 specifically for, according to data source and the priority of each data of the equal priority under the same data source received, by to should the index information of each data genaration, in several index files that this priority be stored to successively under this data source according to the order receiving these each data is corresponding, wherein, index file corresponding to this priority under this data source is several index files, when certain index file that this priority under this data source is corresponding is filled with, in the next index file that this priority being continued by each index information do not stored to be stored to successively under this data source according to the reception order of the data of correspondence is corresponding, when all index files that this priority under this data source is corresponding are all filled with, search the index file carrying the index information place of the lowest number of data of current storage, the each index file do not stored is continued cover according to the reception order of the data of correspondence the index information stored in the index file found successively.
Described generation module 502 also for, before each index file do not stored being continued cover according to the reception order of the data of correspondence the index information stored in the index file found successively, determine currently in the index file found, not obtain index information.
Wherein, the device that data described above store can be arranged in more new node.
The apparatus structure schematic diagram of the data search that Fig. 6 provides for the embodiment of the present application, specifically comprises:
Computing module 601, for the numbering according to the data of carrying in the acquisition request of the search node transmission received, and the quantity of the storage space comprised in the bucket region of index file, this numbering and this quantity are carried out modulo operation;
Indication information acquisition module 602, for the result according to modulo operation, obtains indication information in the storage space that row number is equal with this result in the bucket region of this index file;
Index information acquisition module 603, for the memory location in the chained list district of this index file according to the indication information instruction obtained, the corresponding memory location in the chained list district of this index file obtains index information corresponding to these data;
Search module 604, for this index information according to acquisition, and the mapping relations of the index information preserved and data, search the data that this index information of acquisition is corresponding.
Described search module 604 specifically for, according to this index information obtained, and the index information preserved and the mapping relations of the memory location of data in the data file at this data place, search the data that this index information of acquisition is corresponding.
Described computing module 601 also for, according to the described data source and the priority that obtain these data of carrying in request, search the index file storing index information corresponding to these data, wherein, in described acquisition request, also carry data source and the priority of the data that will obtain.
Described index information acquisition module 603 also for, judge the numbering of the data of carrying in this index information obtained, with described obtain ask in the numbering changing data of carrying whether identical, if, then using this index information obtained as index information corresponding to these data obtained, otherwise, according to the value of the hop field of this index information obtained, memory location equal with the value of this hop field in the chained list district of this index file obtains index information again, and judge the numbering of the data of carrying in the index information again obtained, with described obtain ask in the numbering of these data of carrying whether identical, the numbering of data of carrying in the index information obtained with described obtain ask in the numbering of these data of carrying identical till.
The embodiment of the present application provides a kind of data to store and the method for searching and device, the method is numbered each data received and stores, for each data received, generate the index information with these data stored with mapping relations, and this index information is stored in the chained list district of index file, the quantity of the storage space comprised in the bucket region of the numbering of these data and this index file is carried out modulo operation, and this index information of instruction is stored in the indication information of the memory location in chained list district, be stored in the storage space that in the bucket region of this index file, row number is equal with the result of modulo operation.Due to the index information and the indication information that adopt said method to store data in the embodiment of the present application, thus when searching data, the quantity of the storage space comprised in the numbering of the data that will search and bucket region carries out modulo operation, search indication information, according to the indication information found, in chained list district, search corresponding index information, then search corresponding data according to index information, therefore can find the data required for search node fast, improve the efficiency of searching data.
Obviously, those skilled in the art can carry out various change and modification to the application and not depart from the spirit and scope of the application.Like this, if these amendments of the application and modification belong within the scope of the application's claim and equivalent technologies thereof, then the application is also intended to comprise these change and modification.
Claims (19)
1. a method for data storage, is characterized in that, comprising:
Receive each data, according to the reception order receiving each data, for each data arrange corresponding numbering, and store each data and numbering corresponding to each data;
For each data received, generate the index information with these data stored with mapping relations one by one, and the numbering of these data is carried in this index information of generation, this index information is stored in the chained list district of index file;
By the numbering of these data, carry out modulo operation with the quantity of the storage space comprised in the bucket region of this index file;
According to the result of modulo operation, this index information of instruction is stored in the indication information of the memory location in chained list district, is stored in the storage space that in the bucket region of this index file, row number is equal with the result of modulo operation.
2. the method for claim 1, is characterized in that, stores each data and numbering corresponding to each data, specifically comprises:
For each data received, according to the data source of these data, these data and numbering corresponding to this data are stored to should data data source data file in.
3. method as claimed in claim 2, is characterized in that, generates the index information with these data stored with mapping relations one by one, specifically comprises:
According to the memory location of these data in the data file at this data place, generate the index information with the memory location of these data in the data file at this data place with mapping relations.
4. the method for claim 1, is characterized in that, is stored in the chained list district of index file by this index information generated, specifically comprises:
According to data source and the priority of this data under this data source of these data, in the index file that this priority be stored under this data source by this index information generated is corresponding.
5. the method for claim 1, is characterized in that, this index information of instruction is stored in the indication information of the memory location in chained list district, is stored in the storage space that in the bucket region of this index file, row number is equal with the result of modulo operation, also comprises:
When having stored indication information in the row number storage space equal with the result of modulo operation in the bucket region of this index file, keep the indication information that stores in this storage space constant; And
Whether the value of the hop field of the index information that the memory location in chained list district of the indication information instruction judging to store in this storage space stores is 0, if, then the value of this hop field is revised as this index information and is stored in memory location in chained list district, otherwise, continue to judge whether the hop field of the index information that memory location that in the chained list district of this index file, memory location is equal with the value of this hop field stores is 0.
6. method as claimed in claim 4, it is characterized in that, the data file of the data source of these data is several data files.
7. method as claimed in claim 6, is characterized in that, store each data, specifically comprise:
According to the data source of each data of the same data source received, these each data are stored in several data files of this data source according to reception order successively;
Wherein, when certain data file of this data source is filled with, the each data do not stored are continued to be stored in the next data file of this data source successively according to reception order, when all data files of this data source are all filled with, extract the data file that numbering corresponding to current storage data is minimum, each data do not stored are continued to cover according to reception order the data stored in the data file of extraction successively.
8. method as claimed in claim 7, is characterized in that, before each data do not stored are continued to cover according to reception order the data stored in the data file of extraction successively, described method comprises:
The data stored in the data file of extraction are set to not readable.
9. method as claimed in claim 8, is characterized in that, for each data file, be recorded in the file header of this data file by the lowest number of the data stored in this data file;
The data stored in the data file of extraction are set to not readable, specifically comprise:
The lowest number of the data stored in this next data file recorded in the file header according to the next data file of the data file extracted, and the data source that the data file extracted is corresponding, the lowest number of the data recorded in the file header of index file corresponding for priority all under this data source is revised as the lowest number of the data stored in this next data file;
Wherein, for each index file, by the lowest number of data of carrying in the index information stored in this index file, be recorded in the file header of this index file.
10. method as claimed in claim 8, is characterized in that, for each data file, be recorded in the file header of this data file by the lowest number of the data stored in this data file;
The data stored in the data file of extraction are set to not readable, specifically comprise:
According to data source corresponding to data file extracted, determine the index file that all priority under this data source are corresponding;
For each index file determined, according to the memory location storing index information in the chained list district of this index file of recording in the file header of this index file next time, and the lowest number of the data stored in this next data file recorded in the file header of the next data file of the data file extracted, in the chained list district of this index file, last memory location from the memory location of record to chained list district, search the numbering of the data of carrying in the index information stored in each memory location successively, until the numbering finding the data of carrying is not less than the index information of the lowest number of the data stored in this next data file,
The lowest number of the data recorded in the file header of this index file is revised as the numbering of the data of carrying in the index information found;
Wherein, for each index file, by the lowest number of data of carrying in the index information stored in this index file, be recorded in the file header of this index file.
11. methods as claimed in claim 4, is characterized in that, index file corresponding to this priority under this data source is several index files.
12. methods as claimed in claim 11, is characterized in that, be stored to by index information in the chained list district of index file, specifically comprise:
According to data source and the priority of each data of the equal priority under the same data source received, by the index information for this each data genaration, in several index files that this priority be stored to successively under this data source according to the order receiving these each data is corresponding;
Wherein, when certain index file that this priority under this data source is corresponding is filled with, in the next index file that this priority being continued by each index information do not stored to be stored to successively under this data source according to the reception order of the data of correspondence is corresponding, when all index files that this priority under this data source is corresponding are all filled with, search the index file carrying the index information place of the lowest number of data of current storage, the each index file do not stored is continued cover according to the reception order of the data of correspondence the index information stored in the index file found successively.
13. methods as claimed in claim 12, is characterized in that, before each index file do not stored being continued cover according to the reception order of the data of correspondence the index information stored in the index file found successively, described method also comprises:
Determine currently in the index file found, not obtain index information.
The method of 14. 1 kinds of data search, is characterized in that, comprising:
According to the numbering of the data of carrying in the acquisition request that the search node received sends, and the quantity of the storage space comprised in the bucket region of index file, this numbering and this quantity are carried out modulo operation;
According to the result of modulo operation, in the storage space that row number is equal with this result in the bucket region of this index file, obtain indication information;
According to the memory location in the chained list district of this index file of the indication information instruction obtained, the corresponding memory location in the chained list district of this index file obtains index information corresponding to these data;
According to this index information obtained, and the mapping relations one by one of the index information preserved and data, search the data that this index information of acquisition is corresponding.
15. methods as claimed in claim 14, is characterized in that, according to this index information obtained, and the mapping relations one by one of the index information preserved and data, search the data that this index information of acquisition is corresponding, specifically comprise:
According to this index information obtained, and the mapping relations of the index information preserved and the memory location of data in the data file at this data place, search the data that this index information of acquisition is corresponding.
16. methods as claimed in claim 14, is characterized in that, also carry data source and the priority of the data that will obtain in described acquisition request;
According to the numbering of these data of carrying in the acquisition request that the search node received sends, and the quantity of the storage space comprised in the bucket region of index file, before this numbering and this quantity are carried out modulo operation, described method also comprises:
According to the described data source and the priority that obtain these data of carrying in request, search the index file storing index information corresponding to these data.
17. methods as claimed in claim 14, it is characterized in that, according to the memory location in the chained list district of this index file of the indication information instruction obtained, after the corresponding memory location in the chained list district of this index file obtaining index information corresponding to these data, also comprise:
Judge the numbering of the data of carrying in this index information obtained, with described obtain ask in the numbering changing data of carrying whether identical, if, then using this index information obtained as index information corresponding to these data obtained, otherwise, according to the value of the hop field of this index information obtained, memory location equal with the value of this hop field in the chained list district of this index file obtains index information again, and judge the numbering of the data of carrying in the index information again obtained, with described obtain ask in the numbering of these data of carrying whether identical, the numbering of data of carrying in the index information obtained with described obtain ask in the numbering of these data of carrying identical till.
The device that 18. 1 kinds of data store, is characterized in that, comprising:
Memory module, for receiving each data, according to the reception order receiving each data, for each data arrange corresponding numbering, and stores each data and numbering corresponding to each data;
Generation module, for for each data received, generate first index information with these data stored with mapping relations one by one, and the numbering of these data is carried in this first index information of generation, this first index information is stored in the chained list district of index file;
Computing module, for the numbering by these data, carries out modulo operation with the quantity of the storage space comprised in the bucket region of this index file;
Indication information memory module, for the result according to modulo operation, is stored in the indication information of the memory location in chained list district, is stored in the storage space that in the bucket region of this index file, row number is equal with the result of modulo operation by this first index information of instruction.
The device of 19. 1 kinds of data search, is characterized in that, comprising:
Computing module, for the numbering according to the data of carrying in the acquisition request of the search node transmission received, and the quantity of the storage space comprised in the bucket region of index file, this numbering and this quantity are carried out modulo operation;
Indication information acquisition module, for the result according to modulo operation, obtains indication information in the storage space that row number is equal with this result in the bucket region of this index file;
Index information acquisition module, for the memory location in the chained list district of this index file according to the indication information instruction obtained, the corresponding memory location in the chained list district of this index file obtains index information corresponding to these data;
Search module, for this index information according to acquisition, and the mapping relations one by one of the index information preserved and data, search the data that this index information of acquisition is corresponding.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110201149.2A CN102890675B (en) | 2011-07-18 | 2011-07-18 | Method and device for storing and finding data |
| HK13103663.5A HK1176146A1 (en) | 2011-07-18 | 2013-03-25 | Method and device for storing and querying data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110201149.2A CN102890675B (en) | 2011-07-18 | 2011-07-18 | Method and device for storing and finding data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102890675A CN102890675A (en) | 2013-01-23 |
| CN102890675B true CN102890675B (en) | 2015-05-13 |
Family
ID=47534182
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110201149.2A Active CN102890675B (en) | 2011-07-18 | 2011-07-18 | Method and device for storing and finding data |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN102890675B (en) |
| HK (1) | HK1176146A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108874897A (en) * | 2018-05-23 | 2018-11-23 | 新华三大数据技术有限公司 | Data query method and device |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106407201B (en) * | 2015-07-29 | 2020-12-01 | 腾讯科技（深圳）有限公司 | A data processing method, apparatus and computer readable storage medium |
| CN107015990B (en) * | 2016-01-27 | 2020-06-09 | 阿里巴巴集团控股有限公司 | Data searching method and device |
| CN106685758B (en) * | 2016-12-19 | 2019-11-05 | 重庆重邮汇测通信技术有限公司 | LTE eat dishes without rice or wine monitor baseband board initial data save, inquiry and back method |
| CN106777293A (en) * | 2016-12-29 | 2017-05-31 | 北京奇虎科技有限公司 | Data storage and lookup method and device |
| CN109101643A (en) * | 2018-08-21 | 2018-12-28 | 智久(厦门)机器人科技有限公司上海分公司 | The building of data information table, anti-pseudo- point global registration method, apparatus and robot |
| CN110609815B (en) * | 2019-07-30 | 2022-05-24 | 河钢股份有限公司承德分公司 | Data file storage and sharing method and terminal equipment |
| CN111382142B (en) * | 2020-03-04 | 2023-06-20 | 海南金盘智能科技股份有限公司 | Database operation method, server and computer storage medium |
| CN111767436B (en) * | 2020-06-23 | 2023-11-10 | 北京思特奇信息技术股份有限公司 | HASH index data storage and reading method and system |
| CN112379687B (en) * | 2020-10-21 | 2024-05-28 | 一飞(海南)科技有限公司 | Automatic square matrix numbering generation method, system, storage medium and unmanned aerial vehicle |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101493827A (en) * | 2008-01-21 | 2009-07-29 | 鸿富锦精密工业（深圳）有限公司 | Storage process adaptive system and method |
| CN101620617A (en) * | 2009-07-28 | 2010-01-06 | 中兴通讯股份有限公司 | Method and device for searching and processing log file |
| CN101686209A (en) * | 2008-09-24 | 2010-03-31 | 阿里巴巴集团控股有限公司 | Method and device for storing message in message retransmission system |
| US7702628B1 (en) * | 2003-09-29 | 2010-04-20 | Sun Microsystems, Inc. | Implementing a fully dynamic lock-free hash table without dummy nodes |
| CN101782922A (en) * | 2009-12-29 | 2010-07-21 | 山东山大鸥玛软件有限公司 | Multi-level bucket hashing index method for searching mass data |
-
2011
- 2011-07-18 CN CN201110201149.2A patent/CN102890675B/en active Active
-
2013
- 2013-03-25 HK HK13103663.5A patent/HK1176146A1/en not_active IP Right Cessation
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7702628B1 (en) * | 2003-09-29 | 2010-04-20 | Sun Microsystems, Inc. | Implementing a fully dynamic lock-free hash table without dummy nodes |
| CN101493827A (en) * | 2008-01-21 | 2009-07-29 | 鸿富锦精密工业（深圳）有限公司 | Storage process adaptive system and method |
| CN101686209A (en) * | 2008-09-24 | 2010-03-31 | 阿里巴巴集团控股有限公司 | Method and device for storing message in message retransmission system |
| CN101620617A (en) * | 2009-07-28 | 2010-01-06 | 中兴通讯股份有限公司 | Method and device for searching and processing log file |
| CN101782922A (en) * | 2009-12-29 | 2010-07-21 | 山东山大鸥玛软件有限公司 | Multi-level bucket hashing index method for searching mass data |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108874897A (en) * | 2018-05-23 | 2018-11-23 | 新华三大数据技术有限公司 | Data query method and device |
| CN108874897B (en) * | 2018-05-23 | 2019-09-13 | 新华三大数据技术有限公司 | Data query method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102890675A (en) | 2013-01-23 |
| HK1176146A1 (en) | 2013-07-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102890675B (en) | Method and device for storing and finding data | |
| CN102682116B (en) | Method and device for processing table items based on Hash table | |
| CN102799628B (en) | The method and apparatus of data partition is carried out in key-value database | |
| CN103229164B (en) | Data access method and device | |
| WO2013152678A1 (en) | Method and device for metadata query | |
| CN102682108B (en) | Row and line mixed database storage method | |
| CN104679830A (en) | File processing method and device | |
| CN104750740A (en) | Data renewing method and device | |
| CN105608214B (en) | The method that fast search is carried out to the number-plate number of deploying to ensure effective monitoring and control of illegal activities | |
| CN101826107A (en) | Hash data processing method and device | |
| CN103425435B (en) | Disk storage method and disk storage system | |
| CN102479189A (en) | Indexing method for high-speed uniform access of mass timestamp data in memory | |
| CN104636349A (en) | Method and equipment for compression and searching of index data | |
| CN104615594A (en) | Data updating method and device | |
| CN105718319B (en) | Memory pool layout analysis method and memory pool device | |
| CN105447030A (en) | Index processing method and equipment | |
| CN101799788A (en) | Level-to-level administration method and system of storage resources | |
| CN103778120A (en) | Global file identification generation method, generation device and corresponding distributed file system | |
| CN103870511A (en) | Shared memory-based information inquiring equipment and method | |
| CN102073733A (en) | Method and device for managing Hash table | |
| CN103077198A (en) | Operation system and file cache positioning method thereof | |
| CN104615459A (en) | MoCA equipment parameter configuration method and device | |
| CN105447064A (en) | Electronic map data making method and using method and apparatus therefor | |
| CN102724301A (en) | Cloud database system and method and equipment for reading and writing cloud data | |
| CN103186542A (en) | Data querying method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1176146 Country of ref document: HK |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: GR Ref document number: 1176146 Country of ref document: HK |