CN101493824A - Data retrieval method and device for database - Google Patents
Data retrieval method and device for database Download PDFInfo
- Publication number
- CN101493824A CN101493824A CNA2008102247164A CN200810224716A CN101493824A CN 101493824 A CN101493824 A CN 101493824A CN A2008102247164 A CNA2008102247164 A CN A2008102247164A CN 200810224716 A CN200810224716 A CN 200810224716A CN 101493824 A CN101493824 A CN 101493824A
- Authority
- CN
- China
- Prior art keywords
- data recording
- critical field
- key assignments
- user
- index key
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000012545 processing Methods 0.000 claims description 8
- 230000006870 function Effects 0.000 description 5
- 239000012467 final product Substances 0.000 description 3
- 238000006243 chemical reaction Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 238000010835 comparative analysis Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 238000012549 training Methods 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention discloses a retrieval method of data recording in the database, wherein preset key fields in each data record in the database accord with preset logical order, and the physical order of each data record accords with the preset logical order. The method comprises the following steps: columns of preset key fields which contain all data records are identified as an index file, retrieval is carried out in the index file according to an input index key assignment, when the logical position of the current key field in the preset logical order lags behind the index key assignment, the retrieval is stopped for turning to the data records, of which the key fields accord with the index key assignment. The embodiment of the invention simultaneously discloses a device for realizing the method and can accelerate the retrieval speed.
Description
Technical field
The present invention relates to field of computer technology, more specifically to a kind of data of database search method and device.
Background technology
When in database, carrying out data search, mainly be to database carry out physical read, logic is read and read several operations in advance, wherein, physical read refers to from disk and directly reads, logic is read to refer to from metadata cache and is read, and reads in advance to refer to handle and inquires about the operation of reading from disk in advance before.
In the existing oracle database, the implementation of data retrieval may further comprise the steps as shown in Figure 1:
Step S11, grammatical analysis.
Whether the grammer of anolytic sentence compliant, and whether the implication of weighing each expression formula in the statement is accurate.
Step S12, semantic analysis.
Whether all database objects that relate in the inspect statement exist, and the user has corresponding authority.
Step S13, view conversion.
The query statement that will be referred to view is converted to accordingly to the base table query statement.
Step S14, expression formula conversion.
Being converted to the complicated query expression formula comparatively, simple equivalent connects expression formula.
Step S15, selection optimizer.
Step S16, selection connected mode and the order of connection.
Step S17, word for word section is retrieved in full table scope, and returns Search Results.
As can be seen, the way of search that said method adopts is full table search, and this mode generally needs more logic to read number of times and read number of times in advance, needs the long time of cost, thereby has prolonged retrieval time.
Summary of the invention
In view of this, the object of the present invention is to provide a kind of data of database search method and device, to solve prior art owing to needing full table search to cause long problem retrieval time.
The embodiment of the invention is achieved in that
The search method of data recording in a kind of database meets the predetermined logic order between the default critical field in the described database in each bar data recording, and the physical sequential of described each bar data recording and described predetermined logic sequence consensus, and described method comprises:
The Lieque that will comprise the default critical field of all data recording is decided to be index file;
Index key assignments according to input is retrieved in this index file, when the logical place of current critical field in described predetermined logic order lags behind described index key assignments, stops to retrieve and returning the data recording that critical field meets described index key assignments.
Preferably, in the said method, the predetermined keyword section is provided with supplementary, and described method also comprises:
In the data recording of returning, further retrieve according to described supplementary, to determine to meet the data recording of this supplementary.
Preferably, in the said method, described default critical field is a user's name, and the perhaps combination of user's name and user account has uniqueness in described database.
Preferably, in the said method, described predetermined logic is the sequence of positions of critical field initial in alphabet in proper order.
Preferably, in the said method, head is provided with reference information in the described index file, and what this reference information was used for indicating the identical initial of each critical field of index file occurs the position first, and described index key assignments according to input is retrieved in this index file and is specially:
Determine the initial of this index key assignments, inquire about described reference information, determine the position that has the user's name of identical initial with this index key assignments, and retrieve as retrieving start address with this user's name.
The embodiment of the invention also provides a kind of data of database indexing unit simultaneously, meet the predetermined logic order between the default critical field in the described database in each bar data recording, and the physical sequential of described each bar data recording and described predetermined logic sequence consensus, described device comprises:
Determining unit, the Lieque that is used for comprising the default critical field of all data recording is decided to be index file;
First retrieval unit, be used for retrieving at this index file according to the index key assignments of input, when the logical place of current critical field in described predetermined logic order lags behind described index key assignments, stop to retrieve and returning the data recording that critical field meets described index key assignments.
Preferably, in the said apparatus, the predetermined keyword section is provided with supplementary, and described device also comprises:
Second retrieval unit is used for further retrieving according to described supplementary in the data recording of returning, to determine to meet the data recording of this supplementary.
Preferably, in the said apparatus, described default critical field is a user's name, and the perhaps combination of user's name and user account has uniqueness in described database.
Preferably, in the said apparatus, described predetermined logic is the sequence of positions of critical field initial in alphabet in proper order.
Preferably, in the said apparatus, head is provided with reference information in the described index file, and what this reference information was used for indicating the identical initial of each critical field of index file occurs the position first, and described first retrieval unit comprises:
First processing unit is used for determining the initial of this index key assignments;
Second processing unit is used to inquire about described reference information, determines the position that has the user's name of identical initial with this index key assignments, and retrieves as retrieving start address with this user's name.
By technique scheme as can be known, compared with prior art, data recording in the embodiment of the invention is according to the logical order storage of predetermined keyword section wherein, its physical sequential is consistent with logical order, so the embodiment of the invention is when carrying out data retrieval, only need be retrieved the data in the certain limit and get final product, the position need not to carry out full table search, thereby has saved retrieval time.In addition, the embodiment of the invention is utilized supplementary further to retrieve, and be need not above-mentioned result for retrieval is carried out artificial comparative analysis, thereby further accelerate retrieval rate, and make things convenient for the user to use on the basis of above-mentioned result for retrieval.
Description of drawings
In order to be illustrated more clearly in the embodiment of the invention or technical scheme of the prior art, to do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art below, apparently, accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is for carrying out the process flow diagram of data retrieval in the prior art;
Fig. 2 is the process flow diagram that the embodiment of the invention discloses a kind of data of database search method;
Fig. 3 is the structural representation that the embodiment of the invention discloses a kind of data of database indexing unit;
Fig. 4 is the structural representation that the embodiment of the invention discloses another kind of data of database indexing unit;
Fig. 5 is the structural representation of first retrieval unit of Fig. 3 or data searcher shown in Figure 4.
Embodiment
For can being known, those skilled in the art understand technical scheme of the present invention, below in conjunction with the accompanying drawing in the embodiment of the invention, technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that is obtained under the creative work prerequisite.
The embodiment of the invention discloses a kind of data of database search method, this method can reduce the physical read number of times and logic is read number of times, thereby raising retrieval rate, comprise the plurality of data table in the described database, comprise the plurality of data record in each tables of data, every data recording comprises some critical fielies, meets the predetermined logic order between the default critical field in described each bar data recording, and the physical sequential of described each bar data recording and described predetermined logic sequence consensus.The basic process of the disclosed data retrieval method of present embodiment is: according to the index key assignments of input, search data recording (target data record) with its corresponding critical field, and return, when the position of the critical field of searching in the predetermined logic order lags behind the position of described index key in described predetermined logic order, finish search operation, and the target data record that finds returned, if do not have target data record then return the information of searching failure.Its idiographic flow after the Lieque of the default critical field that will comprise all data recording is decided to be index file, may further comprise the steps as shown in Figure 2:
The index key assignments of step S201, reception user input.
Step S202, be starting point with the first critical field in this index file, word for word section and described index key assignments be relatively in this index file.
Successively with the critical field in the index file as current critical field, compare with described index key assignments,
Step S203, when the position of the critical field that compares in described predetermined logic order lags behind the position of described index key assignments in described predetermined logic order, finish retrieval.
Step S204, return result for retrieval, process ends.
Described result for retrieval can be sky, also can be the data recording with the critical field that meets described index key assignments.
In general, the field that described predetermined keyword section preferably can often be used, described predetermined logic order can be decided according to described critical field type, describes below by an instantiation:
Suppose in the database of a remote training system, be provided with the tables of data (Userinfo) that is used to store start-up's information, as shown in table 1, comprise some data recording in this tables of data, every data recording comprises following critical field:
User account (Userid), user's name (Username), participate in study number of times (Useraccount), participate in Business Name (Usercompanyname) under grouping (Usergroupname) under learning time (Userduty), phone (Usertelephone), user's electronic mailbox (Useremail), the user, the user.
Table 1
| User ID | User name | The study number of times | Learning time | Phone | Affiliated group | Affiliated company | |
| alan | Allan | 3 | 15(h) | 131******611 | alan@* | A1 | SL |
| … | … | … | … | … | … | … | … |
| chenx | Chen Xiang | 2 | 10(h) | 133******521 | chx@* | B2 | CLL |
| dengx | Deng Xia | 3 | 15(h) | 134******254 | dengx@* | A1 | SL |
| … | … | … | … | … | … | … | … |
| wangy | King's language | 4 | 20(h) | 139******422 | wangy@* | A2 | CLL |
| … | … | … | … | … | … | … | … |
| zhaobin | Zhao Bin | 1 | 5(h) | 135******514 | zhaob@* | C1 | TBL |
| … | … | … | … | … | … | … | … |
Wherein:
Username is listed as index file (in other embodiments, Username row and Username can be listed as in the lump as index file), each data recording in this table 1 is to arrange according to certain logical order (sequencing of initial in alphabet of each start-up's name phonetic), so, when certain start-up's of retrieval record, in the Username column data, retrieve according to this start-up's title.For example: when search name is the start-up of " Zhao Bin " in table 1, adopt following query statement as follows:
Select username，useraccount，userduty，usergroupname，usertelephone，
Useremail from userinfo where Upper (username)=Upper (' Zhao Bin ')
As can be seen, wherein the index key assignments is " Zhao Bin ", suppose to have in the table 1 20000 data recording, have 1600000 data blocks altogether, index is occupying 20000 data blocks, data with " Zhao Bin " field are recorded in has uniqueness in the table 1, its position in table is 15000, then according to the words of the full table scan of prior art, need scan 1600000 data blocks altogether, if and according to embodiment of the invention disclosed method, then only need scan in the indexed file, significantly reduced sweep time.According to experiment, the time of prior art search is about 13229 milliseconds, and utilizes the embodiment of the invention, then only needs 1135 milliseconds.And, data of database record quantity is many more, the advantage of the embodiment of the invention is just obvious more, data recording is 1,000 ten thousand in the tentation data storehouse, when inquiring about user newly-increased in three months, the time of prior art cost is 53763 milliseconds (about 54 seconds), and the embodiment of the invention then only use is taken 2423 milliseconds (about 2 seconds).In addition, when the data recording quantity of returning is more, if employing prior art, because the physical sequential and the logical order of data recording are inconsistent in its database, this means that the position that the data of the critical field that meets the index key assignments are recorded in the database is in disperse state, so when returning Search Results, each qualified data recording need be sorted, increase search time to a certain extent; And in the embodiment of the invention, because the physical sequential of data recording is consistent with the logical order of certain critical field wherein, mean that the data recording that will have the identity logic feature is in collected state, this makes under a fairly large number of situation of Search Results, when it is returned to the user, do not need to sort, thereby shortened search time.
Need to prove, because data recording is to store according to the order of initial in alphabet of username field, then in carrying out the data search process,, then stop search if search the initial of critical field lags behind the index key assignments in alphabet initial.For example, when needs were searched for start-ups' " Chen Ying " data recording, the index key assignments was set to " Chen Ying ", when the initial that searches critical field is D (as " Deng Xia "), stops search, and can determine there is not corresponding data recording in this tables of data.This point is significantly different with the prior art existence, and prior art just can determine whether to exist corresponding data recording after need showing search entirely.
In addition, also need to prove, when the key word that meets the index key assignments more for a long time, mean that the data recording of returning is also more, at this moment, if when determining some data recording (target data record) therein, need analyze one by one the data record artificially, finally determine target data record.This has brought inconvenience to the user to a certain extent, for head it off, the embodiment of the invention discloses another kind of data of database search method, this method based on the above method, for supplementary (hereinafter being referred to as alternate key) is set as each critical field in the column data of index, thereby when the data recording quantity of returning is more, determine the final goal data recording by described alternate key, for the operator provides convenience.Present embodiment is applicable to can't determine searching for generally of concrete title, for example, obtain the start-up's of a surname Zhang data recording if desired, when searching for according to flow process shown in Figure 2, the quantity of the data recording that might return can be a lot, if and the username field is provided with supplementary, then can further dwindle the hunting zone according to this supplementary, for example: when needs search that a surname " is opened " and position when being the start-up of " director ", adopt search statement: Select username, useraccount, userduty, usergroupname, usertelephone, useremail from userinfowhere Upper (username) like Upper (' % opens % ') and Upper (information) likeUpper (' % director % ').Promptly by to the searching of name, the start-up of all surname Zhang is found out earlier, and then in lookup result, search according to alternate key (" director "), finally determine target data record.
In addition, in order further to improve search speed, at in the mode of username column data as index file, when database carries out data storage in advance, utilize the initial of this user's name to mark, after storage finishes, that writes down identical initial occurs the position first, and delete above-mentioned mark, with the letter noted and position (this position can by representing that with the side-play amount of tables of data first address this side-play amount can be represented by data line) occurs and be defined as reference information and be arranged at the index file head.So, when receiving the index key assignments of operator's input, determine the initial of this index key assignments, inquire about described reference information, determine the position that has the user's name of identical initial with this index key assignments, and retrieve as retrieving start address, thus with this this user's name, need not to retrieve successively, saved retrieval time from the first address of index file; In addition, identical with index key assignments initial when alphabetical when not existing in the described reference information, then can determine also not have the user's name that meets described index key assignments in the index file, save retrieval time equally.
The embodiment of the invention also provides a kind of data of database indexing unit simultaneously, meet the predetermined logic order between the default critical field in the described database in each bar data recording, and the physical sequential of described each bar data recording and described predetermined logic sequence consensus.The structure of described data searcher comprises as shown in Figure 3: the determining unit 31 and first retrieval unit 32, wherein:
Determining unit 31, the Lieque that is used for comprising the default critical field of all data recording is decided to be index file.
In general, the field that described predetermined keyword section preferably can often be used, described predetermined logic order can be decided according to described critical field type.For example: this predetermined keyword section is a user's name, and then described predetermined logic order can be the sequencing of initial in alphabet of name phonetic.
In the another kind of data searcher that the embodiment of the invention provides simultaneously, described predetermined keyword section is provided with supplementary, and the structure of this device comprises determining unit 41, first retrieval unit 42 and second retrieval unit 43 as shown in Figure 4; Wherein:
The function of determining unit 41, first retrieval unit 42, similar with the function of the determining unit 31 and first retrieval unit 32, do not repeat them here.
For example: when needs search that a surname " is opened " and position when being the start-up of " director ", earlier by searching to name, start-up to all surname Zhang finds out earlier, and then search in lookup result according to alternate key (" director "), finally determine target data record.
Head is provided with reference information in the described index file, what this reference information was used for indicating the identical initial of each critical field of index file occurs the position first, at this situation, Fig. 5 shows a kind of possible structure of first retrieval unit 32 (42), comprise: first processing unit 51 and second processing unit 52, wherein:
First processing unit 51 is used for determining the initial of this index key assignments.
Each embodiment in this instructions all adopts the mode of going forward one by one to describe, and what each embodiment stressed all is and the difference of other embodiment that identical similar part is mutually referring to getting final product between each embodiment.For device, because it is similar substantially to said method, so describe fairly simplely, relevant part partly illustrates referring to the preamble method and gets final product.
It will be appreciated by those skilled in the art that, the unit and the algorithm steps of each example of describing in conjunction with embodiment disclosed herein, can realize with electronic hardware, computer software or the combination of the two, for the interchangeability of hardware and software clearly is described, the composition and the step of each example described prevailingly according to function in the above description.These functions still are that software mode is carried out with hardware actually, depend on the application-specific and the design constraint of technical scheme.The professional and technical personnel can use distinct methods to realize described function to each specific should being used for, but this realization should not thought and exceeds scope of the present invention.
The method of describing in conjunction with embodiment disclosed herein or the step of algorithm can directly use the software module of hardware, processor execution, and perhaps the combination of the two is implemented.Software module can place the storage medium of any other form known in random access memory (RAM), internal memory, ROM (read-only memory) (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or the technical field.
To the above-mentioned explanation of the disclosed embodiments, make this area professional and technical personnel can realize or use the present invention.Multiple modification to these embodiment will be conspicuous concerning those skilled in the art, and defined herein General Principle can realize under the situation that does not break away from the spirit or scope of the present invention in other embodiments.Therefore, the present invention will can not be restricted to these embodiment shown in this article, but will meet and principle disclosed herein and features of novelty the wideest corresponding to scope.
Claims (10)
1, the search method of data recording in a kind of database, it is characterized in that, meet the predetermined logic order between the default critical field in the described database in each bar data recording, and the physical sequential of described each bar data recording and described predetermined logic sequence consensus, described method comprises:
The Lieque that will comprise the default critical field of all data recording is decided to be index file;
Index key assignments according to input is retrieved in this index file, when the logical place of current critical field in described predetermined logic order lags behind described index key assignments, stops to retrieve and returning the data recording that critical field meets described index key assignments.
2, the method for claim 1 is characterized in that, the predetermined keyword section is provided with supplementary, and described method also comprises:
In the data recording of returning, further retrieve according to described supplementary, to determine to meet the data recording of this supplementary.
3, method as claimed in claim 1 or 2 is characterized in that, described default critical field is a user's name, and the perhaps combination of user's name and user account has uniqueness in described database.
4, method as claimed in claim 3 is characterized in that, described predetermined logic is the sequence of positions of critical field initial in alphabet in proper order.
5, method as claimed in claim 1 or 2, it is characterized in that, head is provided with reference information in the described index file, what this reference information was used for indicating the identical initial of each critical field of index file occurs the position first, and described index key assignments according to input is retrieved in this index file and is specially:
Determine the initial of this index key assignments, inquire about described reference information, determine the position that has the user's name of identical initial with this index key assignments, and retrieve as retrieving start address with this user's name.
6, a kind of data of database indexing unit, it is characterized in that, meet the predetermined logic order between the default critical field in the described database in each bar data recording, and the physical sequential of described each bar data recording and described predetermined logic sequence consensus, described device comprises:
Determining unit, the Lieque that is used for comprising the default critical field of all data recording is decided to be index file;
First retrieval unit, be used for retrieving at this index file according to the index key assignments of input, when the logical place of current critical field in described predetermined logic order lags behind described index key assignments, stop to retrieve and returning the data recording that critical field meets described index key assignments.
7, device as claimed in claim 6 is characterized in that, the predetermined keyword section is provided with supplementary, and described device also comprises:
Second retrieval unit is used for further retrieving according to described supplementary in the data recording of returning, to determine to meet the data recording of this supplementary.
As claim 6 or 7 described devices, it is characterized in that 8, described default critical field is a user's name, the perhaps combination of user's name and user account has uniqueness in described database.
9, device as claimed in claim 8 is characterized in that, described predetermined logic is the sequence of positions of critical field initial in alphabet in proper order.
10, as claim 6 or 7 described devices, it is characterized in that head is provided with reference information in the described index file, what this reference information was used for indicating the identical initial of each critical field of index file occurs the position first, and described first retrieval unit comprises:
First processing unit is used for determining the initial of this index key assignments;
Second processing unit is used to inquire about described reference information, determines the position that has the user's name of identical initial with this index key assignments, and retrieves as retrieving start address with this user's name.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008102247164A CN101493824A (en) | 2008-12-09 | 2008-12-09 | Data retrieval method and device for database |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008102247164A CN101493824A (en) | 2008-12-09 | 2008-12-09 | Data retrieval method and device for database |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101493824A true CN101493824A (en) | 2009-07-29 |
Family
ID=40924428
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2008102247164A Pending CN101493824A (en) | 2008-12-09 | 2008-12-09 | Data retrieval method and device for database |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101493824A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103246659A (en) * | 2012-02-06 | 2013-08-14 | 阿里巴巴集团控股有限公司 | Method and device for key value data query |
| WO2015154625A1 (en) * | 2014-09-05 | 2015-10-15 | 中兴通讯股份有限公司 | Timing event processing method, storage method, execution method and corresponding device |
| CN108460075A (en) * | 2017-12-28 | 2018-08-28 | 上海顶竹通讯技术有限公司 | A kind of file content search method and system |
| CN110838199A (en) * | 2019-11-12 | 2020-02-25 | Tcl-罗格朗国际电工（惠州）有限公司 | Access control card management method and device, computer equipment and storage medium |
| CN111046041A (en) * | 2019-12-09 | 2020-04-21 | 珠海格力电器股份有限公司 | Data processing method and device, storage medium and processor |
| WO2022033099A1 (en) * | 2020-08-13 | 2022-02-17 | 华为技术有限公司 | Index construction method and apparatus |
-
2008
- 2008-12-09 CN CNA2008102247164A patent/CN101493824A/en active Pending
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103246659A (en) * | 2012-02-06 | 2013-08-14 | 阿里巴巴集团控股有限公司 | Method and device for key value data query |
| CN103246659B (en) * | 2012-02-06 | 2016-05-25 | 阿里巴巴集团控股有限公司 | The method and apparatus of key assignments data query |
| WO2015154625A1 (en) * | 2014-09-05 | 2015-10-15 | 中兴通讯股份有限公司 | Timing event processing method, storage method, execution method and corresponding device |
| CN108460075A (en) * | 2017-12-28 | 2018-08-28 | 上海顶竹通讯技术有限公司 | A kind of file content search method and system |
| CN110838199A (en) * | 2019-11-12 | 2020-02-25 | Tcl-罗格朗国际电工（惠州）有限公司 | Access control card management method and device, computer equipment and storage medium |
| CN111046041A (en) * | 2019-12-09 | 2020-04-21 | 珠海格力电器股份有限公司 | Data processing method and device, storage medium and processor |
| CN111046041B (en) * | 2019-12-09 | 2024-02-27 | 珠海格力电器股份有限公司 | Data processing method and device, storage medium and processor |
| WO2022033099A1 (en) * | 2020-08-13 | 2022-02-17 | 华为技术有限公司 | Index construction method and apparatus |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110321344B (en) | Information query method and device for associated data, computer equipment and storage medium | |
| US7158996B2 (en) | Method, system, and program for managing database operations with respect to a database table | |
| US6546394B1 (en) | Database system having logical row identifiers | |
| CN101819578B (en) | Retrieval method, method and device for establishing index and retrieval system | |
| CN100458779C (en) | Index and its extending and searching method | |
| KR101027864B1 (en) | Machine-learning approach for determining document relevance for searching large amounts of electronic documents | |
| US6266660B1 (en) | Secondary index search | |
| US5995962A (en) | Sort system for merging database entries | |
| CN101840400B (en) | A multi-level classification retrieval method and system | |
| US6427145B1 (en) | Database processing method, apparatus for carrying out the same and medium storing processing program | |
| CN102999519A (en) | Read-write method and system for database | |
| CN101493824A (en) | Data retrieval method and device for database | |
| CN100562713C (en) | The information retrieval method of electronic navigation system and device | |
| CN106407360B (en) | Data processing method and device | |
| Young et al. | Acoustic indexing for multimedia retrieval and browsing | |
| CN101620607A (en) | Full-text retrieval method and full-text retrieval system | |
| CN102831224A (en) | Creating method for data index base and searching suggest generation method and device | |
| CN102456055A (en) | Method and device for searching interest points | |
| US7725448B2 (en) | Method and system for disjunctive single index access | |
| CN102902701B (en) | Information query system and method | |
| CN101539433A (en) | Searching method with first letter of pinyin and intonation in navigation system and device thereof | |
| US20080154992A1 (en) | Construction of a large coocurrence data file | |
| CN101436203B (en) | Recording index method and apparatus | |
| CN113821508B (en) | Method and system for realizing array index | |
| US7870138B2 (en) | File storage and retrieval method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C53 | Correction of patent for invention or patent application | ||
| CB03 | Change of inventor or designer information |
Inventor after: Wang Jiye Inventor after: Zhang Hao Inventor after: Zhu Yucang Inventor after: Pu Xijun Inventor before: Zhang Hao Inventor before: Zhu Yucang Inventor before: Pu Xijun |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: INVENTOR; FROM: ZHANG HAO ZHU YUCANG CHUL CHUNG KYU TO: WANG JIYE ZHANG HAO ZHU YUCANG CHUL CHUNG KYU |
|
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20090729 |