CN102867064A - Associated field query device and associated field query method - Google Patents
Associated field query device and associated field query method Download PDFInfo
- Publication number
- CN102867064A CN102867064A CN2012103696006A CN201210369600A CN102867064A CN 102867064 A CN102867064 A CN 102867064A CN 2012103696006 A CN2012103696006 A CN 2012103696006A CN 201210369600 A CN201210369600 A CN 201210369600A CN 102867064 A CN102867064 A CN 102867064A
- Authority
- CN
- China
- Prior art keywords
- calculated column
- associate field
- data
- index
- unique message
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides an associated field query device which comprises an acquisition unit, a calculated column generation unit, a digest generation unit and a query unit, wherein the acquisition unit acquires associated fields between data sheets in a relational database; the calculated column generation unit combines the associated fields to form a calculated column; the digest generation unit performs calculation according to the calculated column to obtain a unique message digest; and the query unit creates a calculated column index according to the unique message digest, and queries target data according to the calculated column index. According to the technical scheme of the invention, field quantity of data query can be reduced, field length can be packed, the limitation of data base index key value length and index column quantity is broken through, the index is effectively used, and data query efficiency is improved. The invention also provides an associated field query method.
Description
Technical field
The present invention relates to field of computer technology, in particular to a kind of associate field inquiry unit and a kind of associate field querying method.
Background technology
Along with the development of computer technology, the main application of computing machine has been calculated from traditional science and has been changed transaction data process into.In the issued transaction process, do not need complicated science to calculate, but need to carry out mass data storage, search, the work such as statistics, such as teaching management, personnel management, financial management etc.This need to manage mass data, and database technology is exactly present state-of-the-art data theorem technology.Any one data base management system (DBMS) all is based on certain data model, and data model commonly used has three kinds at present: hierarchical model, network model and relational model.Corresponding with it, database also is divided into three basic forms of it: hierarchical data storehouse, reticular pattern database and relevant database.Relational model with the bivariate table structure come presentation-entity and between contact.Relational data model is to concern mathematical theory as the basis, and a bivariate table is exactly a relation, can not only describe entity itself, can also reflect the contact between the entity.This model is simple, and is easy to use, uses also the most extensive.
The database that is made of relational model is exactly relational database.Relational database is comprised of a plurality of tables of data that comprise data recording, and the user can connect each other having to set up between a plurality of tables of related data.
In relational database, data are dispersed in the different tables of data, in order to the data in each table are only recorded once, thereby avoid the input that repeats of data, reduce redundant.
There is a large amount of associated data inquiries in the application software based on relevant database.But, when associate field is more and more, because there is restriction in the index length of database, after the length of index column exceeds restriction, can't create too much index for tables of data, database is forced to select the mode data query of full table scan, and along with the increase of data volume, the treatment effeciency of application system also sharply descends thereupon.For this reason, for this kind scene, the search efficiency that proposes suitable disposal route raising database is valuable.
Correlation technique is for example inquired about associate field with calculated column, but there is restriction in the index length of database, after the length of index column exceeds restriction, can't create index for this data rows.In the time can not effectively utilizing index, Database Systems are searched data by full table scan, and efficient is relatively poor, and obvious this scheme can't effectively solve the negative effect that associate field too much produces system performance.
Therefore, need a kind of associate field inquiring technology, can reduce the field quantity of data query, packed field length breaks through the restriction of database index key assignments length and index column quantity, effectively utilizes index to improve efficiency data query.
Summary of the invention
The present invention just is being based on the problems referred to above, has proposed a kind of associate field inquiring technology, can reduce the field quantity of data query, and packed field length breaks through the restriction of database index key assignments length and index column quantity, effectively utilizes index to improve efficiency data query.
In view of this, according to an aspect of the present invention, provide a kind of associate field inquiry unit, having comprised: acquiring unit, obtain the associate field between the tables of data in the relevant database; The calculated column generation unit is combined into calculated column with described associate field; The summarization generation unit calculates the unique message summary according to described calculated column; Query unit creates the calculated column index according to described unique message summary, according to described calculated column search index target data.
Relevant database is restricted for the individual number average of index key length, index column at present, in case exceed index key restriction or columns restriction, can't create index, cause database can only use the mode data query of full table scan, performance significantly reduces, and this programme is processed the calculated column that critical field forms, obtain unique fingerprint, compressible field length breaks through the restriction of index key length and index columns quantity, and then improves search efficiency.
In technique scheme, preferred, described calculated column generation unit is inserting special character as the separator between the described associate field between the described associate field when described associate field is combined into calculated column.
Use special character as separator, both guaranteed the uniqueness of character string, avoid again the generation of Hash collision simultaneously, this special character is triangle, single quotation marks, arrow, " # " or "@" for example.
In technique scheme, preferred, the length of described unique message summary is less than preset length.
In technique scheme, preferred, the digest algorithm that disappears that described summarization generation unit adopts comprises message digest algorithm, Secure Hash Algorithm, original complete check information digest algorithm, Haval algorithm.The length of the unique message that obtains summary is less than the length of database index key assignments, the length of this database index key assignments be preset length.
In above-mentioned arbitrary technical scheme, preferred, described summarization generation unit also is used for described unique message summary is replaced described calculated column, and inserts in the described tables of data; Described query unit also is used for reading described unique message summary from described tables of data, creates described calculated column index according to described unique message summary, according to described calculated column index generated query statement.
According to a further aspect in the invention, also provide a kind of associate field querying method, having comprised: step 202, obtain the associate field between the tables of data in the relevant database; Step 204 is combined into calculated column with described associate field; Step 206 calculates the unique message summary according to described calculated column; Step 208 creates the calculated column index according to described unique message summary, according to described calculated column search index target data.
Relevant database is restricted for the individual number average of index key length, index column at present, in case exceed index key restriction or columns restriction, can't create index, cause database can only use the mode data query of full table scan, performance significantly reduces, and this programme is processed the calculated column that critical field forms, obtain unique fingerprint, compressible field length breaks through the restriction of index key length and index columns quantity, and then improves search efficiency.
In technique scheme, preferred, described step 204 also comprises, when described associate field is combined into calculated column, is inserting special character between the described associate field as the separator between the described associate field.
Use special character as separator, both guaranteed the uniqueness of character string, avoid again the generation of Hash collision simultaneously, this special character is triangle, single quotation marks, arrow, " # " or "@" for example.
In technique scheme, preferred, the length of described unique message summary is less than preset length.The length of the unique message that obtains summary is less than the length of database index key assignments, the length of this database index key assignments be preset length.
In technique scheme, preferred, adopt the digest algorithm that disappears to calculate described unique message summary, described Message Digest 5 comprises message digest algorithm, Secure Hash Algorithm, original complete check information digest algorithm, Haval algorithm.
In above-mentioned arbitrary technical scheme, preferred, described step 206 also comprises, described unique message summary is replaced described calculated column, and insert in the described tables of data; Described step 208 comprises, reads described unique message summary from described tables of data, creates described calculated column index according to described unique message summary, according to described calculated column index generated query statement.
Description of drawings
Fig. 1 shows the according to an embodiment of the invention block diagram of associate field inquiry unit;
Fig. 2 shows the according to an embodiment of the invention process flow diagram of associate field querying method;
Fig. 3 shows the inquiry of associate field according to an embodiment of the invention principle and inquires about the contrast schematic diagram of principle with the associate field in the correlation technique;
Fig. 4 shows the according to an embodiment of the invention schematic diagram of A tables of data;
Fig. 5 shows the schematic diagram of the calculated column among Fig. 4 being processed the unique message summary that obtains;
Fig. 6 shows the schematic diagram that unique message summary shown in Figure 5 is inserted tables of data shown in Figure 4;
Fig. 7 shows according to an embodiment of the invention associate field query script schematic diagram;
Fig. 8 shows the associate field query script schematic diagram in the correlation technique.
Embodiment
In order more clearly to understand above-mentioned purpose of the present invention, feature and advantage, below in conjunction with the drawings and specific embodiments the present invention is further described in detail.
Set forth in the following description a lot of details so that fully understand the present invention, still, the present invention can also adopt other to be different from other modes described here and implement, and therefore, the present invention is not limited to the restriction of following public specific embodiment.
Fig. 1 shows the according to an embodiment of the invention block diagram of associate field inquiry unit.
As shown in Figure 1, associate field inquiry unit 100 comprises according to an embodiment of the invention: acquiring unit 102, obtain the associate field between the tables of data in the relevant database; Calculated column generation unit 104 is combined into calculated column with associate field; Summarization generation unit 106 calculates the unique message summary according to calculated column; Query unit 108 creates the calculated column index according to the unique message summary, according to calculated column search index target data.
Relevant database is restricted for the individual number average of index key length, index column at present, in case exceed index key restriction or columns restriction, can't create index, cause database can only use the mode data query of full table scan, performance significantly reduces, and this programme is processed the calculated column that critical field forms, obtain unique fingerprint, compressible field length breaks through the restriction of index key length and index columns quantity, and then improves search efficiency.
In technique scheme, preferred, calculated column generation unit 104 is inserting special character as the separator between the associate field between the associate field when associate field is combined into calculated column.
Use special character as separator, both guaranteed the uniqueness of character string, avoid again the generation of Hash collision simultaneously, this special character is triangle, single quotation marks, arrow, " # " or "@" for example.
In technique scheme, preferred, the length of unique message summary is less than preset length.
In technique scheme, preferred, the digest algorithm that disappears that summarization generation unit 106 adopts comprises message digest algorithm, Secure Hash Algorithm, original complete check information digest algorithm, Haval algorithm.The length of the unique message that obtains summary is less than the length of database index key assignments, the length of this database index key assignments be preset length.
In above-mentioned arbitrary technical scheme, preferred, summarization generation unit 106 also is used for the unique message summary is replaced calculated column, and in the data inserting table; Query unit 108 also is used for reading the unique message summary from tables of data, creates the calculated column index according to the unique message summary, according to calculated column index generated query statement.
Fig. 2 shows the according to an embodiment of the invention process flow diagram of associate field querying method.
As shown in Figure 2, associate field querying method according to an embodiment of the invention comprises: step 202, obtain the associate field between the tables of data in the relevant database; Step 204 is combined into calculated column with associate field; Step 206 calculates the unique message summary according to calculated column; Step 208 creates the calculated column index according to the unique message summary, according to calculated column search index target data.
Relevant database is restricted for the individual number average of index key length, index column at present, in case exceed index key restriction or columns restriction, can't create index, cause database can only use the mode data query of full table scan, performance significantly reduces, and this programme is processed the calculated column that critical field forms, obtain unique fingerprint, compressible field length breaks through the restriction of index key length and index columns quantity, and then improves search efficiency.
In technique scheme, preferred, step 204 can also comprise, when associate field is combined into calculated column, is inserting special character between the associate field as the separator between the associate field.
Use special character as separator, both guaranteed the uniqueness of character string, avoid again the generation of Hash collision simultaneously, this special character is triangle, single quotation marks, arrow, " # " or "@" for example.
In technique scheme, preferred, the length of unique message summary is less than preset length.The length of the unique message that obtains summary is less than the length of database index key assignments, the length of this database index key assignments be preset length.
In technique scheme, preferred, adopt the digest algorithm that disappears to calculate described unique message summary, described Message Digest 5 comprises message digest algorithm, Secure Hash Algorithm, original complete check information digest algorithm, Haval algorithm.
In above-mentioned arbitrary technical scheme, preferred, described step 206 can also comprise, described unique message summary is replaced described calculated column, and insert in the described tables of data; Described step 208 comprises, reads described unique message summary from described tables of data, creates described calculated column index according to described unique message summary, according to described calculated column index generated query statement.
Therefore, can reduce the field quantity of data query, packed field length breaks through the restriction of database index key assignments length and index column quantity, effectively utilizes index to improve efficiency data query.
Describe in detail according to technical scheme of the present invention below in conjunction with Fig. 3 to Fig. 6.
1. set up the Bizkey calculated column
As shown in Figure 3, the associate field of A, B two tables of data is Col1 ... ColN uses special character as separator, above-mentioned a plurality of associate fields are combined into calculated column bizkey, for example bizkey=Col1+ ' ■ '+Col2+ ' ■ '+... + ColN, wherein, ' ■ ' is special character.The related SQL of multiword section is converted to the related SQL of single row, is about to A join B on A.col1=B.col1 and A.col2=B.col2 and ... and A.colN=B.colM is reduced to A join B on A.bizkey=B.bizkey.
2. use Message Digest 5 to generate the unique fingerprint of Bizkey
The principal character of Message Digest 5 is that ciphering process does not need key, and can't be decrypted through the data of encrypting, and only has the identical clear data of input just can obtain identical ciphertext through identical Message Digest 5.There is not the management and distribution problem of key in Message Digest 5, is suitable for mutually the same use of distributed network.Because the workload of its computations is considerable, so former this algorithm only is used for the encryption in the limited situation of data volume, for example password of computing machine irreversible encryption algorithm for encryption usually.In recent years, along with the improvement at full speed of the identical performance of computing machine, enciphering rate no longer becomes the yoke of this encryption technology development of restriction, thereby the field that Message Digest 5 is used constantly increases.
Now, Message Digest 5 is mainly used in " digital signature " field, as the digest algorithm to plaintext.Famous digest algorithm has the MD5(message digest algorithm), SHA-1, RIPEMD(original complete verification message summary), Haval scheduling algorithm and a large amount of variants thereof.
Eap-message digest is the input of random length is mixed and to produce the algorithm of the fixing pseudorandom input of length.The principal feature of eap-message digest has:
1. how long the message of no matter inputting has, and the length of the eap-message digest of calculating is always fixed.The message of for example using MD5 algorithm summary has 128 bits, and the output of 160 bits is finally arranged with the message of SHA-1 algorithm summary, and the variant of SHA-1 can produce the eap-message digest of 192 bits and 256 bits.It is generally acknowledged, the final output of summary is longer, and this digest algorithm is just safer.
2. eap-message digest looks like " random ".These bits look be carelessly hash together.Whether can check its output identical with a large amount of inputs, general, different inputs, and the summary information of output can be by test for randomness if having different output.But summary is not true random, because with identical algorithm identical message is asked summary twice, its result is inevitable identical; And if true random, in any case then all can't reappear.Therefore eap-message digest is " pseudorandom ".
3. usually, as long as the message of input is different, the summary information that produces after it is made a summary must be not identical yet; But identical input must produce identical output.This is the character that has of good Message Digest 5 just: input has changed, and output has also just changed; Article two, the summary of similar message is really not close, even can be far from each other.
4. message digest function is the one-way function without trapdoor, namely can only carry out the informative abstract of forward, and can't recover any message from summary, even just can not find any information relevant with prime information at all.Certainly, can adopt the method for heavy attack, namely attempt each possible information, calculate its summary, whether identically with existing summary look at, if do like this, finally be certain to recover the message of summary.But in fact, the information that obtain may be one of infinite message, so this heavy attack almost is invalid.
5. good digest algorithm, nobody can therefrom find " collision ", although " collision " is sure existence.Namely for a given summary, it just in time is given can not finding an information to make its summary.In other words, can't find two message, be that their summary is identical.
In the present embodiment, mainly utilize 1. 2. 3. 5. several characteristics in the characteristics of above-mentioned digest algorithm: the ciphertext length of generation is fixed, (different input ciphertexts are different for the uniqueness of ciphertext, identical input ciphertext is identical), collisionless occurs, by MD5, SHA-1, RIPEMD or Haval scheduling algorithm, the bizkey calculated column of random length is converted to the character string of a regular length, is equivalent to generate unique " digital finger-print ".Use special character as separator, both guaranteed the uniqueness of character string, avoid again the generation of Hash collision simultaneously.
At present all relevant databases are restricted for individual number average of index key length, index column, as SQL Server index key maximum length be restricted to 900 bytes, Oracle index key length restriction is that (db_block_size) * 40% byte, DB2 index key length restriction are 2000 bytes.In case exceed the restriction of index key length restriction or columns, can't create index, cause database can only use the mode data query of full table scan, performance significantly reduces.
Classify example as to realize that based on the MD5 algorithm compression bizkey calculates, in database and application service, realize respectively identical code logic, guarantee when code end and database side execution md5 encryption, to generate 128 identical regular length ciphertexts for identical input.
For example suppose the data of A tables of data as shown in Figure 4, obtain calculated column (bizkey) according to associate field.
Step 1: definition bizkey rule.
Bizkey=col1+’■’+col2+’■’+col3+’■’+col4+’■’+col5+’■’+col6+’■’+col7+’■’+col8+’■’+col9+’■’+col10。
Step 2: 128 ciphertexts after calling getMD5Key and obtaining compressing:
Select F_GetMD5Key (bizkey) from TableA, this ciphertext as shown in Figure 5.
Step 3: replace original bizkey calculated column with 128 ciphertexts, the data of A tables of data (TableA) as shown in Figure 6.
The length of Bizkey field is always 32 bytes.Simplify step 1,2,3, namely define the bizkey rule and be:
Bizkey=F_GetMD5key(col1+’■’+col2+’■’+col3+’■’+col4+’■’+col5+’■’+col6+’■’+col7+’■’+col8+’■’+col9+’■’+col10)。
3. set up MD5Bizkey calculated column index
After the association of multiword section was converted to single md5Bizkey row association, the length of data rows also had been limited in 128, can not cause index key length restriction problem again.Therefore, no matter data many, storage are long more again for related field, can simplify the SQL correlation inquiry by the method, MD5Bizkey is listed as sets up index, by index search acceleration search efficiency.
Create the MD5Bizkey column index:
Create?Index?IX_Bizkey?on?TableA(Bizkey)。
Suppose that TableA is data source, and data volume is larger, TableB is that table-drive and data volume are less, and according to B table data correlation inquiry A table data, when inquiring about a plurality of latitude multiword section associated data, SQL and inquiry plan are as shown in Figure 7.
Therefore, different from full table scan, the record that uses md5bizkey calculated column index that the present invention creates can fast finding to satisfy condition in the A table.
When needs are inquired about the data of specific objective, such as col1=a, col2=b, col3=c, col4=d ... col10=I, the ciphertext coupling that generates by code end and database side gets final product:
Select?*?from?TableA?where?bizkey=F_GetMD5key(col1+’■’+col2+’■’+col3+’■’+col4+’■’+col5+’■’+col6+’■’+col7+’■’+col8+’■’+col9+’■’+col10)。
The below illustrates that with test data this technical scheme of the present invention is for the situation of the improved efficiency of multiword section correlation inquiry.
1. at first create the data source A table of inquiry
Create?table?A(col1?nvarchar(max),col2?nvarchar(max),col3nvarchar(max),col4?nvarchar(max),col5?nvarchar(max))
declare@i?int
set@i=0
declare@content?nvarchar(max)
--the restriction that the@content data length of insertion exceeds the largest index key
set
@content='abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdehijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdeffghijklmnopqrstuvwxyzabcdefghijklmnop……
--insert 10,000 row test datas.
2. create table-drive B
Create?table?B(col1?varchar(max),col2?nvarchar(max),col3?nvarchar(max),col4?nvarchar(max),col5?nvarchar(max))
--insert 10 data, according to the data of coupling in 10 data correlation inquiry A tables of B table.
3. original scheme inquiry
Select?*?from?A?inner?join?B?on?a.col1=b.col1?and?a.col2=b.col2?and?a.col3=b.col3?and?a.col4=b.col4?and?a.col5=b.col5。
--can't create the index on the col1+col2+col3+col4+col5, exceed the index key length restriction.
Create index IX_idx on A (col1, col2, col3, co4, col5) creates the index failure.
Use full table scan inquiry, query script is referring to Fig. 8.Complete 10000 data of table scan find qualified record, consume very high.Inquired about 27.2 seconds consuming time, CPU consumes 21949, and it is 2608003 that logic is read Reads.
4. new departure inquiry
--set up the Bizkey calculated column:
alter?table?A?add?md5bizkey?nvarchar(1000)；
alter?table?B?add?md5bizkey?nvarchar(1000)。
--use the MD5 algorithm to generate 128 ciphertexts:
Update?A?set?md5bizkey=f_getmd5key([col1]+'■'+[col2]+'■'+[col3]+'■'+[col4]+'■'+[col5])；
Update?B?set?md5bizkey=f_getmd5key([col1]+'■'+[col2]+'■'+[col3]+'■'+[col4]+'■'+[col5])。
--set up MD5Bizkey calculated column index:
Create?index?IX_MD5Bizkey?on?A(md5bizkey)。
--multiword section correlation inquiry SQL simplifies as follows:
select?a.*from?A?inner?join?B?on?a.md5bizkey=b.md5bizkey。
Use the md5Bizkey index search, by md5bizkey calculated column index, avoided full table scan, locate fast 10 data.Contrast can find, the execution time dropped to 0.2 second from 27.2 seconds of former scheme, and search efficiency promotes 136 times, and the CPU expense drops to 16 from 21949, and logic is read Reads and dropped to 329 from 2608003, overall overhead several orders of magnitude that all descend.
Therefore, technical scheme according to the present invention has solved the Rapid matching problem of multidimensional data, particularly the dimension when associate field is increased to after some levels, generate unique fingerprint of various dimensions calculated column by the MD5 compress-encrypt, significantly improved by the database fast finding and arrived the accurately search efficiency of information.
The above is the preferred embodiments of the present invention only, is not limited to the present invention, and for a person skilled in the art, the present invention can have various modifications and variations.Within the spirit and principles in the present invention all, any modification of doing, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. an associate field inquiry unit is characterized in that, comprising:
Acquiring unit obtains the associate field between the tables of data in the relevant database;
The calculated column generation unit is combined into calculated column with described associate field;
The summarization generation unit calculates the unique message summary according to described calculated column;
Query unit creates the calculated column index according to described unique message summary, according to described calculated column search index target data.
2. associate field inquiry unit according to claim 1 is characterized in that, described calculated column generation unit is inserting special character as the separator between the described associate field between the described associate field when described associate field is combined into calculated column.
3. associate field inquiry unit according to claim 2 is characterized in that, the length of described unique message summary is less than preset length.
4. associate field inquiry unit according to claim 1 is characterized in that, the digest algorithm that disappears that described summarization generation unit adopts comprises message digest algorithm, Secure Hash Algorithm, original complete check information digest algorithm, Haval algorithm.
5. each described associate field inquiry unit in 4 according to claim 1 is characterized in that, described summarization generation unit also is used for described unique message summary is replaced described calculated column, and inserts in the described tables of data;
Described query unit also is used for reading described unique message summary from described tables of data, creates described calculated column index according to described unique message summary, according to described calculated column index generated query statement.
6. an associate field querying method is characterized in that, comprising:
Step 202 is obtained the associate field between the tables of data in the relevant database;
Step 204 is combined into calculated column with described associate field;
Step 206 calculates the unique message summary according to described calculated column;
Step 208 creates the calculated column index according to described unique message summary, according to described calculated column search index target data.
7. associate field querying method according to claim 6 is characterized in that, described step 204 also comprises, when described associate field is combined into calculated column, is inserting special character between the described associate field as the separator between the described associate field.
8. associate field querying method according to claim 7 is characterized in that, the length of described unique message summary is less than preset length.
9. associate field querying method according to claim 6, it is characterized in that, the employing digest algorithm that disappears calculates described unique message summary, and described Message Digest 5 comprises message digest algorithm, Secure Hash Algorithm, original complete check information digest algorithm, Haval algorithm.
10. each described associate field querying method in 9 according to claim 6 is characterized in that, described step 206 also comprises, described unique message summary is replaced described calculated column, and insert in the described tables of data;
Described step 208 comprises, reads described unique message summary from described tables of data, creates described calculated column index according to described unique message summary, according to described calculated column index generated query statement.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210369600.6A CN102867064B (en) | 2012-09-28 | 2012-09-28 | Associate field inquiry unit and associate field querying method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210369600.6A CN102867064B (en) | 2012-09-28 | 2012-09-28 | Associate field inquiry unit and associate field querying method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102867064A true CN102867064A (en) | 2013-01-09 |
| CN102867064B CN102867064B (en) | 2015-12-02 |
Family
ID=47445933
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210369600.6A Active CN102867064B (en) | 2012-09-28 | 2012-09-28 | Associate field inquiry unit and associate field querying method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102867064B (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103500183A (en) * | 2013-09-12 | 2014-01-08 | 国家计算机网络与信息安全管理中心 | Storage structure based on multiple-relevant-field combined index and building, inquiring and maintaining method |
| WO2015184782A1 (en) * | 2014-10-22 | 2015-12-10 | 中兴通讯股份有限公司 | Data query method and device |
| CN105354255A (en) * | 2015-10-21 | 2016-02-24 | 华为技术有限公司 | Data query method and apparatus |
| CN105354149A (en) * | 2015-11-26 | 2016-02-24 | 深圳市金证科技股份有限公司 | Memory data search method and apparatus |
| CN106326317A (en) * | 2015-07-09 | 2017-01-11 | 中国移动通信集团山西有限公司 | Data processing method and device |
| CN106547755A (en) * | 2015-09-17 | 2017-03-29 | 北京国双科技有限公司 | A kind of data processing method and device based on piece key |
| CN106874329A (en) * | 2016-07-15 | 2017-06-20 | 阿里巴巴集团控股有限公司 | The implementation method and device of database table index |
| CN107016019A (en) * | 2015-10-23 | 2017-08-04 | 阿里巴巴集团控股有限公司 | Database index creation method and device |
| CN107590251A (en) * | 2017-09-19 | 2018-01-16 | 郑州云海信息技术有限公司 | A kind of data managing method and its device |
| CN113065151A (en) * | 2020-08-27 | 2021-07-02 | 开鑫金服(南京)信息服务有限公司 | Relational database information security enhancement method, system, terminal and storage medium |
| CN113179161A (en) * | 2021-04-22 | 2021-07-27 | 平安消费金融有限公司 | Method and device for replacing secret key, computer equipment and storage medium |
| CN113590593A (en) * | 2021-08-04 | 2021-11-02 | 浙江大华技术股份有限公司 | Method and device for generating data table information, storage medium and electronic device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090198676A1 (en) * | 2006-06-01 | 2009-08-06 | Microsoft Corporation | Indexing Documents for Information Retrieval |
| CN101916262A (en) * | 2010-07-29 | 2010-12-15 | 北京用友政务软件有限公司 | Acceleration method of financial element matching |
| CN102254014A (en) * | 2011-07-21 | 2011-11-23 | 华中科技大学 | Adaptive information extraction method for webpage characteristics |
| CN102521416A (en) * | 2011-12-28 | 2012-06-27 | 用友软件股份有限公司 | Data correlation query method and data correlation query device |
| CN102609421A (en) * | 2011-01-24 | 2012-07-25 | 阿里巴巴集团控股有限公司 | Data query method and device |
-
2012
- 2012-09-28 CN CN201210369600.6A patent/CN102867064B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090198676A1 (en) * | 2006-06-01 | 2009-08-06 | Microsoft Corporation | Indexing Documents for Information Retrieval |
| CN101916262A (en) * | 2010-07-29 | 2010-12-15 | 北京用友政务软件有限公司 | Acceleration method of financial element matching |
| CN102609421A (en) * | 2011-01-24 | 2012-07-25 | 阿里巴巴集团控股有限公司 | Data query method and device |
| CN102254014A (en) * | 2011-07-21 | 2011-11-23 | 华中科技大学 | Adaptive information extraction method for webpage characteristics |
| CN102521416A (en) * | 2011-12-28 | 2012-06-27 | 用友软件股份有限公司 | Data correlation query method and data correlation query device |
Non-Patent Citations (2)
| Title |
|---|
| 博客园: "《通往性能优化的JOIN方法说明》", 2 July 2007, HTTP://DATABASE.51CTO.COM/ART/200707/50299_1.HTM * |
| 高晓东 等: "基于ｈａｓｈ函数的一次群签名模型", 《计算机应用研究》 * |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103500183A (en) * | 2013-09-12 | 2014-01-08 | 国家计算机网络与信息安全管理中心 | Storage structure based on multiple-relevant-field combined index and building, inquiring and maintaining method |
| WO2015184782A1 (en) * | 2014-10-22 | 2015-12-10 | 中兴通讯股份有限公司 | Data query method and device |
| CN106326317A (en) * | 2015-07-09 | 2017-01-11 | 中国移动通信集团山西有限公司 | Data processing method and device |
| CN106547755A (en) * | 2015-09-17 | 2017-03-29 | 北京国双科技有限公司 | A kind of data processing method and device based on piece key |
| CN105354255A (en) * | 2015-10-21 | 2016-02-24 | 华为技术有限公司 | Data query method and apparatus |
| CN107016019A (en) * | 2015-10-23 | 2017-08-04 | 阿里巴巴集团控股有限公司 | Database index creation method and device |
| CN107016019B (en) * | 2015-10-23 | 2021-02-23 | 阿里巴巴集团控股有限公司 | Database index creation method and device |
| CN105354149B (en) * | 2015-11-26 | 2018-09-11 | 深圳市金证科技股份有限公司 | A kind of internal storage data lookup method and device |
| CN105354149A (en) * | 2015-11-26 | 2016-02-24 | 深圳市金证科技股份有限公司 | Memory data search method and apparatus |
| CN106874329A (en) * | 2016-07-15 | 2017-06-20 | 阿里巴巴集团控股有限公司 | The implementation method and device of database table index |
| CN107590251A (en) * | 2017-09-19 | 2018-01-16 | 郑州云海信息技术有限公司 | A kind of data managing method and its device |
| CN113065151A (en) * | 2020-08-27 | 2021-07-02 | 开鑫金服(南京)信息服务有限公司 | Relational database information security enhancement method, system, terminal and storage medium |
| CN113179161A (en) * | 2021-04-22 | 2021-07-27 | 平安消费金融有限公司 | Method and device for replacing secret key, computer equipment and storage medium |
| CN113179161B (en) * | 2021-04-22 | 2022-11-08 | 平安消费金融有限公司 | Method and device for replacing secret key, computer equipment and storage medium |
| CN113590593A (en) * | 2021-08-04 | 2021-11-02 | 浙江大华技术股份有限公司 | Method and device for generating data table information, storage medium and electronic device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102867064B (en) | 2015-12-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102867064B (en) | Associate field inquiry unit and associate field querying method | |
| Wang et al. | Searchable encryption over feature-rich data | |
| Karapiperis et al. | An LSH-based blocking approach with a homomorphic matching technique for privacy-preserving record linkage | |
| Sun et al. | Verifiable privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking | |
| Schnell et al. | Privacy-preserving record linkage using Bloom filters | |
| Devanbu et al. | Authentic third-party data publication | |
| Cao et al. | Privacy-preserving multi-keyword ranked search over encrypted cloud data | |
| US8898478B2 (en) | Method for querying data in privacy preserving manner using attributes | |
| Yang et al. | Authenticated join processing in outsourced databases | |
| KR101873946B1 (en) | Generating obfuscated data | |
| Li et al. | Proof-infused streams: Enabling authentication of sliding window queries on streams | |
| US10664610B2 (en) | Method and system for range search on encrypted data | |
| CN106776780A (en) | Data exchange and shared method and system in a kind of cloud environment | |
| CN101694672A (en) | Distributed safe retrieval system | |
| CN110134718B (en) | Fuzzy search method supporting multiple keywords based on attribute encryption | |
| WO2016131473A1 (en) | Method and system for verifying information of a data item in a plurality of different data items | |
| CN108768639B (en) | Public key order-preserving encryption method | |
| CN102930051B (en) | Based on the method and system of isometric division with random safe nearest neighbor of filling | |
| Lopes et al. | Processing OLAP queries over an encrypted data warehouse stored in the cloud | |
| Zhu et al. | Enabling generic verifiable aggregate query on blockchain systems | |
| CN116467026A (en) | Cloud desktop data secure sharing and tracing method and system based on blockchain | |
| Wang et al. | Bucket‐based authentication for outsourced databases | |
| Cui et al. | Secure boolean spatial keyword query with lightweight access control in cloud environments | |
| CN109165262A (en) | Fragmentation clustering system and fragmentation method of relational large table | |
| Hong et al. | Query integrity verification based-on mac chain in cloud storage |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 100094 Haidian District North Road, Beijing, No. 68 Applicant after: Yonyou Network Technology Co., Ltd. Address before: 100094 Beijing city Haidian District North Road No. 68, UFIDA Software Park Applicant before: UFIDA Software Co., Ltd. |
|
| COR | Change of bibliographic data | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |