CN103425694B - The searching method of relational data and device - Google Patents
The searching method of relational data and device Download PDFInfo
- Publication number
- CN103425694B CN103425694B CN201210163273.9A CN201210163273A CN103425694B CN 103425694 B CN103425694 B CN 103425694B CN 201210163273 A CN201210163273 A CN 201210163273A CN 103425694 B CN103425694 B CN 103425694B
- Authority
- CN
- China
- Prior art keywords
- index
- search
- key
- search condition
- internal memory
- 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 30
- 230000015654 memory Effects 0.000 claims abstract description 128
- 238000010276 construction Methods 0.000 claims description 9
- 238000013481 data capture Methods 0.000 claims description 8
- 230000008859 change Effects 0.000 claims description 3
- 238000000605 extraction Methods 0.000 claims 1
- 230000008569 process Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000004899 motility Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000007493 shaping process Methods 0.000 description 2
- 230000009897 systematic effect Effects 0.000 description 2
- 235000012364 Peperomia pellucida Nutrition 0.000 description 1
- 240000007711 Peperomia pellucida Species 0.000 description 1
- 150000001875 compounds Chemical class 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000000151 deposition Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses searching method and the device of a kind of relational data.The searching method of a kind of relational data that the embodiment of the present invention provides includes: arrange the digital coding corresponding with each search condition, the digital coding utilizing at least one search condition generates index, stores the Key of relational data in multiple index internal memories according to index and routing configuration；When the search condition received exists index accordingly time, according to index and routing configuration determine the index internal memory corresponding to this search condition, when the search condition received does not exists index accordingly time, randomly select index internal memory；According to the search condition received from determined by index internal memory and extract qualified search and describe mark；Utilize search to describe mark and obtain corresponding Key, and obtained value Value of relational data by accessed Key.This programme can be applied to the various occasion scanning for relational data.
Description
Technical field
The present invention relates to technical field of data processing, particularly to a kind of relational data searching method and
Device.
Background technology
Relevant database is the data base set up based on relational model, owing to can preferably simulate
Relation between various entities and entity in real world and be widely used.And how from pass
Be in type data base quick-searching to required data one of important topic being always industry research.
In order to improve recall precision, often index for Database, querying condition utilize the index to
Quick lock in inquiry scope of data, finally returns that Query Result.A kind of retrieval scheme that existing market is popular
For use SQL (SQL) retrieve, when carrying out data retrieval, input various not
Same relation condition, this relation condition will generate the where condition of SQL statement, complete by SQL statement
Become retrieval and return result to system.But, this SQL retrieval scheme depends on data base unduly, when
When data base's pressure reaches bottleneck, substantial amounts of SQL query can cause data base slowly to ultimately cause data inspection
Rope is slow.
The defect retrieved for above-mentioned SQL, industry also been proposed a kind of employing memcache, redis etc.
High-performance memory cache data-selected scheme, supports the relational data of key-value (Key-Value).Carry out
During data retrieval, obtain, according to key Key, the data that in internal memory, this key is corresponding, improve access performance.So
And, this retrieval scheme only supports this man-to-man inquiry mode of Key Yu Value, it is impossible to according to looking into
Inquiry condition obtains Query Result, and inquiry mode is dumb.
Summary of the invention
The searching method of a kind of relational data that the present invention provides and device, to solve existing protocol
Inquiry mode inflexible problem when speed is slowly and internal memory retrieves during library searching.
For reaching above-mentioned purpose, the embodiment of the present invention adopts the technical scheme that
Embodiments provide the searching method of a kind of relational data, arrange and each search condition pair
The digital coding answered, utilizes the digital coding of at least one search condition to generate index, according to index and road
By being arranged in the key Key storing relational data in multiple index internal memory, described method includes:
When the search condition received exists index accordingly time, according to this index and described routing configuration
Determine at least one the index internal memory corresponding to this search condition, when the search condition received does not exists
When indexing accordingly, it is defined as the index internal memory corresponding to this search condition by arbitrarily indexing internal memory；
According to the search condition received from determined by index internal memory and extract qualified search and describe
Mark, wherein, in described index internal memory, storage search describes mark and corresponding Key, described search
Describing mark is to be generated by the digital coding of search condition；
Utilize search to describe mark and obtain corresponding Key, and obtain relationship type by accessed Key
Value Value of data.
The embodiment of the present invention additionally provides the searcher of a kind of relational data, and described device includes distribution
Formula construction unit, indexed search unit and data capture unit, wherein,
Described distributed construction unit, for arranging the digital coding corresponding with each search condition, utilizes extremely
The digital coding of a few search condition generates index, according to index with routing configuration at multiple index internal memories
The key Key of middle storage relational data, in described index internal memory, storage search describes and identifies and corresponding
Key, it is to be generated by the digital coding of search condition that described search describes mark；
Described indexed search unit, for when the search condition received exists index accordingly time, root
At least one the index internal memory corresponding to this search condition is determined, when connecing according to this index and described routing configuration
The search condition received does not exists when indexing accordingly, be defined as this search condition by arbitrarily indexing internal memory
Corresponding index internal memory；And, according to the search condition received from determined by index internal memory and carry
Take qualified search and describe mark；
Described data capture unit, is used for utilizing search to describe mark and obtains corresponding Key, and pass through institute
The Key got obtains value Value of relational data.
The embodiment of the present invention provides the benefit that:
The embodiment of the present invention improves the speed of data search by directly accessing internal memory, and is capable of
According to search condition to the search of relational data in internal memory, significantly improve the motility of way of search,
Disclosure satisfy that the demand of various data search scene.
Further, this programme uses a kind of distributed structure, it is possible to perform phase respectively at multiple index internal memories
Answer the search of data, equalized the data process load in system, be favorably improved data search speed and
Systematic function.
Accompanying drawing explanation
The searching method flow chart of a kind of relational data that Fig. 1 provides for the embodiment of the present invention one；
The searcher structural representation of a kind of relational data that Fig. 2 provides for the embodiment of the present invention three；
The system structure of the searcher of the application relational data that Fig. 3 provides for the embodiment of the present invention three is shown
It is intended to.
Detailed description of the invention
For making the object, technical solutions and advantages of the present invention clearer, below in conjunction with accompanying drawing to this
Bright embodiment is described in further detail.
The technology design of the embodiment of the present invention is to select a certain search condition or combinatorial search condition to build
Lithol draws, and is stored in by the index set up in internal memory (index internal memory).Owing to holding when relational data
When measuring bigger, index capacity also can be relatively big, for realizing dilatation, sets up allocation list and joins as the route indexed
Put, namely by some index correspondence storage to a certain index internal memory；And when a certain index internal memory is visited
Ask when huge or its storage the index of pressure exceedes the internal memory upper limit, it is also desirable to realize dilatation, then by a certain
Index is respectively stored in multiple index internal memory, this completes the structure of distributed search system, when
So this system also supports that the key assignments according to index and relational data is updated index.
See Fig. 1, the searching method of a kind of relational data provided for the embodiment of the present invention one, described
Method includes:
11: the digital coding corresponding with each search condition is set, utilizes the numeral of at least one search condition
Coding generates index, stores the key of relational data in multiple index internal memories according to index and routing configuration
(Key)；
12: judge whether the search condition being currently received exists corresponding index, if so, perform step
Rapid 13a, if it is not, perform step 13b；
13a: when the search condition received exists index accordingly time, according to this index and described road
Determined at least one the index internal memory corresponding to this search condition by configuration, enter step 14.
13b: when the search condition received does not exists index accordingly time, by any one or more
Index internal memory is defined as the index internal memory corresponding to this search condition, enters step 14.
14: according to the search condition received from determined by index internal memory and extract qualified search
Mark is described, subsequently into step 15；Wherein, in described index internal memory, storage search describes mark and phase
Corresponding Key, it is to be generated by the digital coding of search condition that described search describes mark.
15: utilize search to describe mark and obtain corresponding Key, and obtained by accessed Key
The value (Value) of relational data.
In above-mentioned steps 14, it is also possible to occur according to search condition cannot from determined by index internal memory
Extract qualified search and describe the situation of mark, at this moment, can directly return failed message,
This, mainly qualified to can extracting according to search condition of being paid close attention in various embodiments of the present invention
Search describes the situation of mark and illustrates.
Below the searching method of the relational data that the embodiment of the present invention two provides is specifically described.This
Inventive embodiments illustrates, in this scene as a example by the scene of relational data storage user profile
Key be ID (UseId), Value be subscriber data.Subscriber data can be according to minimum
(LRU) mode of use is stored in datarams.The present embodiment compatible existing memcache, redis
Deng storage mode, can navigate to store the datarams of corresponding Value (in data by UseId
Deposit server), thus get the data of unique user.
21: the digital coding corresponding with each search condition is set, utilizes the numeral of at least one search condition
Coding generates index, according to index and routing configuration, the key (Key) of relational data is stored in correspondence
Index internal memory in.
Content according to relational data is different, and the search condition used is the most different, in the present embodiment,
Search condition can include " national ", " province ", " city " belonging to user, " the range of age ", " property
Not ", " presence " etc., then digital coding 1-1024 can be set and identify difference " city " respectively,
One city of each digitized representation, similar, digital coding 1-64 identifies difference " province " respectively,
Digital coding 1-16 identifies difference " national ", digital coding 1(man respectively) and 2(female) identify respectively
Different " sex " etc..
When the digital coding utilizing at least one search condition generates index, can be directly by a search
The digital coding of condition is directly as index, it is also possible to combined by the digital coding of multiple search conditions
As index, compound mode can be the modes such as merging or eliminating, such as the digital coding by search condition 1
Combine as index with the digital coding of search condition 2, the while that i.e. this index can be identified for that all
Meet search condition 1 and the key of search condition 2, or, will there is the digital coding of search condition 1
And get rid of the digital coding of search condition 2 as index, i.e. this index can be identified for that all satisfied search bars
Part 1 but be unsatisfactory for the key of search condition 2.
Generate search according to above-mentioned digital coding and describe mark (ProfileId), be used for representing search condition,
Also the subscriber data preserved is described.Such as, the digital coding of search condition is converted to ratio
Spy, describes mark by described bit according to the search of predefined procedure combination producing search condition, and this makes a reservation for suitable
The search condition that sequence can be following puts in order: city-province-country-sex-the range of age-and in wire
State-other.ProfileId in the present embodiment uses long shaping, and long shaping has 64 bits, thus
When above-mentioned digital coding is converted to bit, it is possible to have enough bits to represent various search bar
With bit 0-9, part, such as, represents that city, bit 10-15 represent province, bit 16-19
Representing country, bit 20-21 represents that sex, bit 22-24 represent the range of age, bit 25
Represent presence.Remain untapped bit and may be used for subsequent expansion.
Each ProfileId has multiple corresponding UserId, a corresponding UserId of ProfileId
Set, i.e. has multiple user all to meet the search condition represented by this ProfileId.When at relationship type number
According to during a newly-increased user UserId-1, obtain the ProfileId-1 that this user is corresponding by the way,
When ProfileId-1 in the presence of, UserId-1 is joined ProfileId-1 UserId set in,
When ProfileId-1 not in the presence of, then record this ProfileId-1 and corresponding UserId-1.
Exemplary, in the present embodiment by the bit field of search condition " province " (in ProfileId
10-15 bit) as index, and set up routing configuration for this index, routing configuration instruction indexes institute
Corresponding index memory group.Arranging one or more index internal memory in one index memory group (can be by indexing
Inner server realizes).Such as, index may indicate that " province " is Beijing, Shanghai, then Beijing institute
Corresponding index memory group loads 4 index inner servers, in the index memory group corresponding to Shanghai
Load 4 index inner servers, the index memory group corresponding to other provinces comprises in an index
Deposit server.The concrete quantity of server mainly inquires about pressure and number of users according to the user of different regions
Determine.
When building Distributed Relational type data search system, first generate ProfileId according to subscriber data,
Then mate according to 10-15 bit and routing configuration in ProfileId, determine this user's
Key(UseId) the index memory group belonging to, as the UseId of this user belongs to the rope corresponding to Beijing
Draw memory group 1, then the Key meeting search condition corresponding to described index is stored in determined by index
In memory group, the UseId that search condition is Pekinese user will be met and be stored in index memory group 1
In.
When the quantity of the index internal memory comprised in described index memory group is more than two, according to described rope
Draw the quantity indexing internal memory in memory group and Key is carried out modulo operation, to determine the index storing this Key
Internal memory.Such as, if the result to user's coupling is to belong to the index memory group 1 corresponding to Beijing, rope
Draw and memory group 1 has 4 index inner servers, then obtain identical according to the result of UserId mod 4
The lower numbering (being designated as AccessPoint) indexing inner server of index, by the ProfileId of this user and
UserId stores on the index inner server of the numbering calculated, and index inner server can store
The corresponding relation of ProfileId-UserId-AccessPoint.The present embodiment also safeguards a set of circumstances
ConditionCollection, in this set of circumstances record number be AccessPoint server in different
UserId number sum under ProfileId.Utilize this UserId number sum can be first when performing search
First return the number sum meeting condition to searcher, it is simple to searcher quick obtaining desired data, and profit
Paging data can be returned, it helps reduce the expense inquired about one by one with this UserId number sum.
Owing to Adding User, deleting user or existing subscriber's data are modified, or change index
Mode of choosing etc. all can cause indexing ProfileId and UserId stored in internal memory and lost efficacy or the completeest
Whole, after there are these events, the present embodiment is for UserId involved in event, to respective index
ProfileId and UserId stored in internal memory is updated, as deleted the inefficacy of storage in index internal memory
ProfileId or UserId, index internal memory in increase new ProfileId or UserId etc..
By the way, establish Distributed Relational type data search based on internal memory framework, the most right
The mode carrying out data search in the architecture illustrates.
22: receive current search condition.
When the search condition received exists index accordingly time, as by search condition according to digital coding
Be converted to the long numerical value identical with above-mentioned ProfileId, the 10-15 bit of this long numerical value
Value can be consistent with the value that selected standing wire draws, and i.e. there is index in this search condition, then according to this index
At least one index internal memory (the i.e. corresponding index internal memory corresponding to this search condition is determined with routing configuration
Group)；
When the search condition received does not exists index accordingly time, as by search condition according to numeral compile
Code is converted to the long numerical value identical with above-mentioned ProfileId, the 10-15 bit of this long numerical value
Value cannot be consistent with the value that selected standing wire draws, this search condition i.e. do not exists index, then will be arbitrarily
Index internal memory is defined as the index internal memory corresponding to this search condition.
23: extract qualified search and describe mark.
According to the search condition received from determined by index internal memory and extract qualified search and describe
Mark includes: extract consistent with the search description mark of the search condition received from index internal memory
Search describes the set of mark, and the quantity recording the ProfileId in this set is TotalCount, permissible
The ProfileId in this set is read in paging, is back to searcher.
Required search description mark is chosen in instruction of choosing according to receiving from described set.Such as select
Start page 1 selected by instruction fetch instruction, terminate page n, then from above-mentioned set, choose 1 to end of start page
Only the search in page n describes mark and describes mark as the qualified search finally extracted.
Further, when the UserId corresponding to a ProfileId is back to searcher, it is also possible to utilize
Under this ProfileId recorded in set of circumstances, the number sum of UserId uses the mode of Pagination Display,
It is back to searcher.
24: utilize search to describe mark and obtain corresponding Key, and closed by accessed Key
It is the Value of type data.
The UserId corresponding for each ProfileId that traversal is extracted, searches for datarams by this UserId
Obtain Query Result Value.
Further, the present embodiment can also use some Optimized Measures, to further speed up search speed
Degree:
Firstly, for above-mentioned steps 23, when determined by index the quantity of internal memory be more than two time,
Determined by index in internal memory, from arbitrary index internal memory, first extract qualified search describe mark
Set, when this index internal memory does not exist qualified search describe mark and described in choose instruction instruction
When continuing to extract operation, then change the index internal memory describing mark for extracting search.This optimal way,
The most first carry out digital independent at a station server, if the search extracted from an index inner server
Describe the set of mark when having met searcher demand, just terminate to extract operation, it is to avoid cross-server visit
Ask operation, improve search efficiency；
Secondly, the present embodiment also provides for the mode of a kind of fast search, is saved in root in executed operation
The Value obtained according to search condition, is stored in the search condition corresponding to this Value and this Value
In internal memory, when the newest search operation starts, when new search condition and executed search condition
When (search condition corresponding to this Value stored) is identical, from internal memory, extracting directly is stored
Value as the Value of this new search condition got, and be not repeated to perform search procedure.
It addition, the present embodiment can also in one search operation to the multiple search conditions received simultaneously
Process, by way of batch processing, improve search efficiency.
The embodiment of the present invention three provides the searcher of a kind of relational data, sees Fig. 2, described dress
Put and include distributed construction unit 21, indexed search unit 22 and data capture unit 23, wherein,
Described distributed construction unit 21, for arranging the digital coding corresponding with each search condition, utilizes
The digital coding of at least one search condition generates index, according to indexing with routing configuration in multiple indexes
Depositing the Key of middle storage relational data, in described index internal memory, storage search describes and identifies and corresponding
Key, it is to be generated by the digital coding of search condition that described search describes mark；
Described indexed search unit 22, for when the search condition received exists index accordingly time,
At least one the index internal memory corresponding to this search condition is determined according to this index and described routing configuration, when
The search condition received does not exists when indexing accordingly, be defined as this search bar by arbitrarily indexing internal memory
Index internal memory corresponding to part；And, according to the search condition received from determined by index internal memory
Extract qualified search and describe mark；
Described data capture unit 23, is used for utilizing search to describe mark and obtains corresponding Key, and pass through
Accessed Key obtains the Value of relational data.
Above-mentioned each index internal memory can be realized by an index inner server, sees Fig. 3, above-mentioned pass
It is that the searcher of type data can realize on server 31, each index memory group 32 comprises one
Platform or multiple stage index inner server.
Concrete, described distributed construction unit 21 includes distributed storage module, for according to index and
Routing configuration determines the index memory group belonging to Key；The search condition corresponding by meeting described index
Key be stored in determined by index in memory group, wherein, when what described index memory group comprised
When the quantity of index internal memory is more than two, according to the quantity pair indexing internal memory in described index memory group
Key carries out modulo operation, to determine the index internal memory storing this Key.Described distributed construction unit
21 also include identifier generation module, for being generated institute by the digital coding of search condition in the following way
State search description to identify:
The digital coding of search condition is converted to bit, and described bit is raw according to predefined procedure combination
The search becoming search condition describes mark.
Said apparatus also includes fast search unit, for obtaining relation by described data capture unit
After the Value of type data, by the search condition storage corresponding to the Value got and this Value
In internal memory, when new search condition is identical with the search condition corresponding to this Value, from internal memory
The Value that extracting directly is stored is as the Value of this new search condition got.By quickly
Search unit, it is not necessary to repeat identical search procedure, improve search efficiency.
In apparatus of the present invention embodiment, the specific works mode of each unit and module sees the method for the present invention in fact
Execute example.
From the above mentioned, the embodiment of the present invention improves the speed of data search by directly accessing internal memory, and
And be capable of according to search condition the search of relational data in internal memory, significantly improve way of search
Motility, it is possible to meet the demand of various data search scene.
Further, this programme uses a kind of distributed structure, it is possible to perform phase respectively at multiple index internal memories
Answer the search of data, equalized the data process load in system, be favorably improved data search speed and
Systematic function.
The foregoing is only presently preferred embodiments of the present invention, be not intended to limit the protection model of the present invention
Enclose.All any modification, equivalent substitution and improvement etc. made within the spirit and principles in the present invention, all
Comprise within the scope of the present invention.
Claims (10)
1. the searching method of a relational data, it is characterised in that arrange corresponding with each search condition
Digital coding, utilizes the digital coding of at least one search condition to generate index, joins according to index and route
Putting the key (Key) storing relational data in multiple index internal memories, described method includes:
When the search condition received exists index accordingly time, according to this index and described routing configuration
Determine at least one the index internal memory corresponding to this search condition, when the search condition received does not exists
When indexing accordingly, it is defined as the index internal memory corresponding to this search condition by arbitrarily indexing internal memory；
According to the search condition received from determined by index internal memory and extract qualified search and describe
Mark, wherein, in described index internal memory, storage search describes mark and corresponding key (Key), described
It is to be generated by the digital coding of search condition that search describes mark；
Utilize search to describe mark and obtain corresponding key (Key), and obtained by accessed key (Key)
The value (Value) of relational data.
Method the most according to claim 1, it is characterised in that described according to index and routing configuration
The key (Key) storing relational data in multiple index internal memories including:
The index memory group belonging to key (Key) is determined according to index and routing configuration；
Memory group is indexed determined by being stored in by the key (Key) meeting search condition corresponding to described index
In, wherein, when the quantity of the index internal memory comprised in described index memory group is more than two, according to
The quantity indexing internal memory in described index memory group carries out modulo operation to key (Key), to determine that storage should
The index internal memory of key (Key).
Method the most according to claim 1, it is characterised in that in the following way by search condition
Digital coding generate described search describe mark:
The digital coding of search condition is converted to bit；
Described bit is described mark according to the search of predefined procedure combination producing search condition.
Method the most according to claim 1, it is characterised in that the search bar that described basis receives
Part from determined by index internal memory and extract qualified search and describe mark and include:
From index internal memory, extract the search consistent with the search description mark of the search condition received retouch
State the set of mark；
Required search description mark is chosen in instruction of choosing according to receiving from described set.
Method the most according to claim 4, it is characterised in that described from index internal memory extract with
The search of the search condition received describes the set of the consistent search description mark of mark and includes:
Index the quantity of internal memory determined by when when being more than two, determined by index in internal memory, first
Extract from arbitrary index internal memory qualified search describe mark set, when in this index internal memory not
Exist qualified search describe mark and described in choose instruction instruction when continuing to extract operation, then change
The index internal memory of mark is described for extracting search.
Method the most according to claim 1, it is characterised in that by accessed key (Key)
After obtaining the value (Value) of relational data, described method also includes:
Search condition corresponding to the value (Value) got and described value (Value) is stored in internal memory,
When new search condition is identical with the search condition corresponding to described value (Value), straight from internal memory
Connect value (Value) that extraction the stored value (Value) as this new search condition got.
7. the searcher of a relational data, it is characterised in that described device includes distributed structure
Unit, indexed search unit and data capture unit, wherein,
Described distributed construction unit, for arranging the digital coding corresponding with each search condition, utilizes extremely
The digital coding of a few search condition generates index, according to index with routing configuration at multiple index internal memories
The key (Key) of middle storage relational data, in described index internal memory, storage search describes and identifies and corresponding
Key (Key), described search describe mark be by search condition digital coding generate；
Described indexed search unit, for when the search condition received exists index accordingly time, root
At least one the index internal memory corresponding to this search condition is determined, when connecing according to this index and described routing configuration
The search condition received does not exists when indexing accordingly, be defined as this search condition by arbitrarily indexing internal memory
Corresponding index internal memory；And, according to the search condition received from determined by index internal memory and carry
Take qualified search and describe mark；
Described data capture unit, is used for utilizing search to describe mark and obtains corresponding key (Key), and pass through
Accessed key (Key) obtains the value (Value) of relational data.
Device the most according to claim 7, it is characterised in that
Described distributed construction unit includes distributed storage module, for true according to index and routing configuration
Determine the index memory group belonging to key (Key)；The key (Key) of search condition corresponding to described index will be met
Index determined by being stored in memory group, wherein, when the index internal memory comprised in described index memory group
Quantity when being more than two, according to the quantity indexing internal memory in described index memory group, key (Key) is entered
Row modulo operation, to determine the index internal memory storing this key (Key).
Device the most according to claim 7, it is characterised in that
Described distributed construction unit also includes identifier generation module, in the following way by search bar
The digital coding of part generates described search description and identifies:
The digital coding of search condition is converted to bit, and described bit is raw according to predefined procedure combination
The search becoming search condition describes mark.
10. according to the device described in any one of claim 7 to 9, it is characterised in that described device is also
Including fast search unit, in the value being obtained relational data by described data capture unit
(Value), after, the search condition corresponding to the value (Value) got and described value (Value) is stored
In internal memory, when new search condition is identical with the search condition corresponding to described value (Value), from interior
Deposit value (Value) that middle extracting directly the stored value (Value) as this new search condition got.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210163273.9A CN103425694B (en) | 2012-05-23 | 2012-05-23 | The searching method of relational data and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210163273.9A CN103425694B (en) | 2012-05-23 | 2012-05-23 | The searching method of relational data and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103425694A CN103425694A (en) | 2013-12-04 |
| CN103425694B true CN103425694B (en) | 2016-12-14 |
Family
ID=49650450
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210163273.9A Active CN103425694B (en) | 2012-05-23 | 2012-05-23 | The searching method of relational data and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103425694B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104951449B (en) * | 2014-03-26 | 2020-12-01 | 腾讯科技（深圳）有限公司 | Data processing method and device |
| CN104516957A (en) * | 2014-12-18 | 2015-04-15 | 深圳市燃气集团股份有限公司 | Data query management method and system |
| CN105357306B (en) * | 2015-11-17 | 2019-06-11 | 贵阳朗玛信息技术股份有限公司 | Multi-platform data-sharing systems and its data sharing method |
| CN105912675B (en) * | 2016-04-13 | 2019-06-18 | 中国科学院计算技术研究所 | A batch deletion/query method and device for merging small files |
| CN108255877B (en) * | 2016-12-29 | 2020-11-24 | 北京国双科技有限公司 | Storage method and device of referee document |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6292795B1 (en) * | 1998-05-30 | 2001-09-18 | International Business Machines Corporation | Indexed file system and a method and a mechanism for accessing data records from such a system |
| CN1635494A (en) * | 2003-12-27 | 2005-07-06 | 海信集团有限公司 | Method for implementing class memory database access and retrieval |
| US7099898B1 (en) * | 1999-08-12 | 2006-08-29 | International Business Machines Corporation | Data access system |
| CN101510209A (en) * | 2009-03-30 | 2009-08-19 | 北京金山软件有限公司 | Method, system and server for implementing real time search |
-
2012
- 2012-05-23 CN CN201210163273.9A patent/CN103425694B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6292795B1 (en) * | 1998-05-30 | 2001-09-18 | International Business Machines Corporation | Indexed file system and a method and a mechanism for accessing data records from such a system |
| US7099898B1 (en) * | 1999-08-12 | 2006-08-29 | International Business Machines Corporation | Data access system |
| CN1635494A (en) * | 2003-12-27 | 2005-07-06 | 海信集团有限公司 | Method for implementing class memory database access and retrieval |
| CN101510209A (en) * | 2009-03-30 | 2009-08-19 | 北京金山软件有限公司 | Method, system and server for implementing real time search |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103425694A (en) | 2013-12-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Abuhashim et al. | Smart contract designs on blockchain applications | |
| CN102521405B (en) | Massive structured data storage and query methods and systems supporting high-speed loading | |
| CN109284299B (en) | Method for reconstructing a hybrid index with storage awareness | |
| CN103902698B (en) | A kind of data-storage system and storage method | |
| CN103853727B (en) | Improve the method and system of big data quantity query performance | |
| CN103425694B (en) | The searching method of relational data and device | |
| CN104252536B (en) | A kind of internet log data query method and device based on hbase | |
| CN113961514B (en) | Data query method and device | |
| CN104346345B (en) | The storage method and device of data | |
| CN103345521B (en) | A kind of method and apparatus processing key assignments in Hash table database | |
| CN104850572A (en) | HBase non-primary key index building and inquiring method and system | |
| CN101963993B (en) | Method for fast searching database sheet table record | |
| CN104035925B (en) | Date storage method, device and storage system | |
| CN103309958A (en) | OLAP star connection query optimizing method under CPU and GPU mixing framework | |
| CN104239377A (en) | Platform-crossing data retrieval method and device | |
| CN106250457B (en) | The inquiry processing method and system of big data platform Materialized View | |
| CN105159845A (en) | Memory reading method | |
| CN106599040A (en) | Layered indexing method and search method for cloud storage | |
| US11868328B2 (en) | Multi-record index structure for key-value stores | |
| CN115114293B (en) | Database index creation method, related device, equipment and storage medium | |
| CN103902705B (en) | Metadata-based cross-mechanism cloud digital content integration system and metadata-based cross-mechanism cloud digital content integration method | |
| CN108647266A (en) | A kind of isomeric data is quickly distributed storage, exchange method | |
| CN104391947B (en) | Magnanimity GIS data real-time processing method and system | |
| CN102214214B (en) | Method and device for processing data relationship and mobile communication terminal | |
| CN104301182B (en) | A kind of querying method and device of the exception information of website visiting at a slow speed |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CP02 | Change in the address of a patent holder |
Address after: Room 818, 8 / F, 34 Haidian Street, Haidian District, Beijing 100080 Patentee after: BEIJING ULTRAPOWER SOFTWARE Co.,Ltd. Address before: 100089 Beijing city Haidian District wanquanzhuang Road No. 28 Wanliu new building 6 storey block A Room 601 Patentee before: BEIJING ULTRAPOWER SOFTWARE Co.,Ltd. |
|
| CP02 | Change in the address of a patent holder |