CN104462104B - Filter method and server - Google Patents

Filter method and server Download PDF

Info

Publication number
CN104462104B
CN104462104B CN201310422744.8A CN201310422744A CN104462104B CN 104462104 B CN104462104 B CN 104462104B CN 201310422744 A CN201310422744 A CN 201310422744A CN 104462104 B CN104462104 B CN 104462104B
Authority
CN
China
Prior art keywords
attribute value
column index
keyword
object set
indexing
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
Application number
CN201310422744.8A
Other languages
Chinese (zh)
Other versions
CN104462104A (en
Inventor
郭光明
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201310422744.8A priority Critical patent/CN104462104B/en
Publication of CN104462104A publication Critical patent/CN104462104A/en
Application granted granted Critical
Publication of CN104462104B publication Critical patent/CN104462104B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/901Indexing; Data structures therefor; Storage structures

Abstract

The embodiment of the invention discloses filter methods and server.Based on the object indexing pre-established, the object indexing includes the column index established for attribute value;Above-mentioned filter method includes: reception filter condition, and the filter condition includes at least one attribute value;The object set in the column index to match with the attribute value in the filter condition is obtained, the object in the object set possesses the attribute value;Intersection is taken to the object set got, takes the object obtained after intersection as filter result.As it can be seen that in embodiments of the present invention, due to being provided with object set for each attribute value, in this way, in filtering the object set of the column index to match with the attribute value in filter condition can be got, then by taking intersection to object set, filtering can be realized.

Description

Filter method and server
Technical field
The present invention relates to inquiring technology fields, more specifically to filter method and server.
Background technique
In fields such as data query, information retrievals, it is often necessary to be filtered (inquiry, retrieval) to object.Above-mentioned object It may be product (such as mobile phone), personnel etc..Object generally has attribute and attribute value.Wherein, attribute is related to attribute value Connection, for example, " mobile phone operating system " (OS) of certain mobile phone is Android, then " OS " is an attribute of mobile phone, and Android is the corresponding attribute value of " OS " this attribute.How object is filtered, inquired, is the hot topic studied at present.
Summary of the invention
In view of this, the embodiment of the present invention is designed to provide filter method and server, to solve the above problems.
To achieve the above object, the embodiment of the present invention provides the following technical solutions:
According to a first aspect of the embodiments of the present invention, a kind of filter method is provided, based on the object indexing pre-established, institute Stating object indexing includes the column index established for attribute value;
The described method includes:
Filter condition is received, the filter condition includes at least one attribute value;
Obtain the object set in the column index to match with the attribute value in the filter condition, pair in the object set As possessing the attribute value;
Intersection is taken to the object set got, takes the object obtained after intersection as filter result.
With reference to first aspect, in the first possible implementation, the column index includes keyword and object set, institute Keyword is stated including at least attribute value;Attribute value in any column index is different from the attribute value in other column indexes;
The object indexing is established in the following way:
Using each attribute value of every an object as Target Attribute values, the column rope for being directed to the Target Attribute values is established Draw;
Described establish include: for the column indexes of the Target Attribute values
When there is no the column index for the Target Attribute values, column index is created, the key of newly-built column index is enabled Word includes the Target Attribute values, also, the object set of the newly-built column index, corresponding right comprising the Target Attribute values As;
When there is the column index for being directed to the Target Attribute values, the corresponding object of the Target Attribute values is inserted into, For in the object set of the column index of the Target Attribute values.
With reference to first aspect or the first possible implementation of first aspect, in second of possible implementation In, the column index is stored using Hash structure.
With reference to first aspect or second of the first possible implementation of first aspect or first aspect may Implementation, in the third possible implementation, object in the object set is arranged by natural order.
With reference to first aspect or second of the first possible implementation of first aspect or first aspect may Implementation or first aspect the third possible implementation, in the fourth possible implementation, described pair is obtained The object set got takes the intersection to include:
When getting N number of object set, N-1 wheel matched and searched processing is carried out, the N is the natural number not less than 2.
The 4th kind of possible implementation with reference to first aspect, in a fifth possible implementation, the i-th wheel matching Lookup processing includes the first processing and second processing, and the i is the natural number not less than 1 and no more than N-1, in which:
First processing includes: optional two object sets for having neither part nor lot in matched and searched processing, and one of object set is made For reference set, another object set is as searched collection;
Successively using the object in the reference set as object reference object;
Search whether there is the object to match with the object reference object in the searched concentration;
The second processing includes:
When being unsatisfactory for preset condition, retain the object of successful match to medium object collection, and by the medium object collection As the object set for having neither part nor lot in matched and searched processing;
When meeting preset condition, retain the object of successful match to final object set;
The preset condition includes i=N-1.
The 5th kind of possible implementation with reference to first aspect, it is in a sixth possible implementation, described to take The object obtained after intersection includes: as filter result
Using the object in the final object set as filter result.
6th kind of possible implementation of the 5th kind of possible implementation or first aspect with reference to first aspect, It is described to search whether exist and the object reference object phase in the searched concentration in the 7th kind of possible implementation Matched object includes:
It whether there is the object to match with the object reference object by binary search in searched concentrate.
The 7th kind of possible implementation with reference to first aspect, in the 8th kind of possible implementation, the reference The number of objects that concentration includes is no more than the searched number of objects concentrated.
The possible implementation of with reference to first aspect the first, in the 9th kind of possible implementation, further includes:
The related data of the newly-increased object of input is received, the related data includes at least attribute value;
Obtain the newly-increased object's property value;
From the object indexing, the object set in the column index that keyword and the attribute value match is obtained;
In the object set that the newly-increased object insertion is got.
Any possible implementation into the 9th kind of possible implementation of first aspect with reference to first aspect, In the second possible implementation, the object indexing is stored in cache server.
The tenth kind of possible implementation with reference to first aspect, it is described to obtain in a kind of the tenth possible implementation The object set in the column index to match with the attribute value in the filter condition is taken to include:
It is sent to the cache server, including at least the acquisition instruction of the attribute value in filter condition;So as to described slow The object set in the column index that the attribute value in server searching keyword and the acquisition instruction matches is deposited, and is returned.
The tenth kind of possible implementation with reference to first aspect, in the 12nd kind of possible implementation, it is described from In the object indexing, the object set obtained in the column index that keyword matches with the attribute value includes:
The acquisition instruction for including at least newly-increased object's property value is sent to the cache server;So as to caching clothes Business device finds the object set in the column index that the attribute value in keyword and the acquisition instruction matches as target object collection, And return to the target object collection;
Include: in the object set that the newly-increased object insertion is got
The newly-increased object insertion target object is concentrated local, obtains updated target object collection;
Utilize the target object collection in updated target object collection replacement cache server.
With reference to first aspect, in the 13rd kind of possible implementation, the filter condition is issued by foreground;
The method also includes:
Obtain the corresponding information of the filter result;
The information is returned to the foreground, so that the foreground is shown.
According to a second aspect of the embodiments of the present invention, a kind of filtering server is provided, based on the object indexing pre-established, The object indexing includes the column index established for attribute value;The filtering server includes at least:
First receiving unit, for receiving filter condition, the filter condition includes at least one attribute value;
First acquisition unit, for obtaining the object in the column index to match with the attribute value in the filter condition Collect, the object in the object set possesses the attribute value;
Filter element takes the object obtained after intersection as filter result for taking intersection to the object set got.
With reference to first aspect, in the first possible implementation, the column index includes keyword and object set, institute Keyword is stated including at least attribute value;Attribute value in any column index is different from the attribute value in other column indexes;
The server further include:
Object indexing establishes unit, for establishing needle using each attribute value of every an object as Target Attribute values To the column index of the Target Attribute values;
The object indexing establishes unit
First object indexing establishes subelement, for creating when there is no the column index for the Target Attribute values Column index enables the keyword of newly-built column index include the Target Attribute values, also, the object of the newly-built column index Collection includes the corresponding object of the Target Attribute values;
Second object indexing establishes subelement, when there is the column index for being directed to the Target Attribute values, by the target The corresponding object of attribute value is inserted into, in the object set of the column index of the Target Attribute values.
With reference to first aspect or the first possible implementation of first aspect, in second of possible implementation In, further includes:
Second receiving unit, the related data of newly-increased object for receiving input, the related data, which includes at least, to be belonged to Property value;
Second acquisition unit, for obtaining the newly-increased object's property value;
Third acquiring unit obtains in the column index that keyword and the attribute value match from the object indexing Object set;
It is inserted into unit, in the object set for getting the newly-increased object insertion.
With reference to first aspect or second of the first possible implementation of first aspect or first aspect may Implementation, in the third possible implementation, the filter condition is issued by foreground;
The filtering server further include:
4th acquiring unit, for obtaining the corresponding information of the filter result;
Return unit, for returning to the information to the foreground, so that the foreground is shown.
As it can be seen that in embodiments of the present invention, due to being provided with object set for each attribute value, in this way, in filtering, it can The object set of the column index to match with the attribute value in filter condition is got, then by taking intersection, Ji Keshi to object set Now filter.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with It obtains other drawings based on these drawings.
Fig. 1 is universal computer architecture schematic diagram provided in an embodiment of the present invention;
Fig. 2 is filter method flow chart provided in an embodiment of the present invention;
Fig. 3 a is column index schematic diagram provided in an embodiment of the present invention;
Fig. 3 b is another schematic diagram of column index provided in an embodiment of the present invention;
Fig. 4 is the another schematic diagram of column index provided in an embodiment of the present invention;
Fig. 5 takes intersection schematic diagram to be provided in an embodiment of the present invention;
Fig. 6 is binary search schematic diagram provided in an embodiment of the present invention;
Fig. 7 is another flow chart of filter method provided in an embodiment of the present invention;
Fig. 8 is Foreground and Background interaction diagrams provided in an embodiment of the present invention;
Fig. 9 is the another flow chart of filter method provided in an embodiment of the present invention;
Figure 10 is another flow chart of Foreground and Background provided in an embodiment of the present invention interaction;
Figure 11 is caching method flow chart provided in an embodiment of the present invention;
Figure 12 is filtering server structural schematic diagram provided in an embodiment of the present invention;
Figure 13 is another structural schematic diagram of filtering server provided in an embodiment of the present invention;
Figure 14 is cache server structural schematic diagram provided in an embodiment of the present invention;
Figure 15 is another structural schematic diagram of cache server provided in an embodiment of the present invention.
Specific embodiment
Attached drawing in example, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described Embodiment be only a part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, ability Domain those of ordinary skill every other embodiment obtained without creative efforts, belongs to guarantor of the present invention The range of shield.
In fields such as data query, information retrievals, often object is inquired, is retrieved.Above-mentioned object may be to produce Product (such as mobile phone), personnel etc..Object generally has multipair attribute and attribute value.Wherein, attribute and attribute value are associated , for example, " mobile phone operating system " (OS) of certain mobile phone is Android, then " OS " is an attribute of mobile phone, and Android is the corresponding attribute value of " OS " this attribute.How object is filtered, inquired, is the hot topic studied at present.
In view of this, the embodiment of the present invention provides filter method and filtering server, object was carried out at least realizing Filter.
Executing subject of the above-mentioned filtering server as filter method, universal computer architecture are as shown in Figure 1, it may include CPU101, memory 102 and transceiver 104.Wherein, transceiver 104 can be used for all data and instructions of sending and receiving, and CPU101 is logical The software program 103 that operation is stored in memory 102 is crossed, calls the data being stored in memory 102, and call transmitting-receiving Device 104 executes each step in filter method.
It should be noted that technical solution provided by the present invention, based on the object indexing pre-established.Above-mentioned object rope Draw the column index including establishing for attribute value.
Above-mentioned object indexing is to realize the basis quickly filtered.Based on object indexing, referring to fig. 2, filtering server is held Capable filter method may include following steps:
S1, filter condition is received, above-mentioned filter condition includes at least one attribute value;
S2, obtain with the object set in the column index that matches of attribute value in above-mentioned filter condition, in the object set Object possesses the attribute value in filter condition;
S3, intersection is taken to the object set got, takes the object obtained after intersection as filter result.
As it can be seen that in embodiments of the present invention, due to being provided with object set for each attribute value, in filtering, can obtain To the object set of the column index to match with the attribute value in filter condition, then by taking intersection, filtering can be realized.
In other embodiments of the present invention, Fig. 3 a is referred to, each column index may include keyword and object set.Due to column Index is established for attribute value, therefore, attribute value is included at least in keyword, and included in corresponding object set Object is owned by the attribute value in same attribute value namely keyword.Also, the targeted attribute value of any column index is different from The targeted attribute value of other column indexes.Or it can be said that each attribute value corresponds to an object set.
It should be noted that due to including attribute value in keyword, above-mentioned (step S2) " is obtained and above-mentioned filtering " matching " in the object set in column index that attribute value in condition matches ", can refer to attribute value in filter condition with Keyword matches.
More specifically, above-mentioned keyword can include simultaneously attribute and attribute value, and above-mentioned object can be product IDs, name Deng can also be other.
It takes the mobile phone as an example, refers to Fig. 3 b, the keyword in column index 1 is " OS:Android ", and object set includes The mobile phone products such as Galaxy S4, HTC G20, MX2 ID.Similarly, the keyword in column index 2 is " OS:IOS ", object set packet Include the mobile phone products such as IPhone4, IPhone4S, IPhone5 ID.And the keyword in column index 3 is " manufacturer: HTC ", it is right As collection includes the mobile phone products ID such as HTC G20, HTCS5.
Such as by taking Fig. 3 b as an example, it is assumed that the filter condition in step S1, including OS=Android and manufacturer=HTC.? That is, above-mentioned filter condition include attribute (OS and manufacturer) and, attribute value (Android and HTC).Then in step s 2, root According to attribute value Android and HTCS3, the object set of column index 1 and column index N can be got.And in step s3, then it can be to column The object set of index 1 and the object set of column index N take intersection, then this object (product IDs) of HTC G20 at least can be obtained, from And HTC G20 will be used as filter result.
In other embodiments of the present invention, above-mentioned object indexing can be established in the following way: by each of every an object Attribute value establishes the column index for being directed to the Target Attribute values respectively as Target Attribute values.
More specifically, above-mentioned foundation is directed to the column index of the Target Attribute values can include:
When there is no the column index for above-mentioned Target Attribute values, column index is created, the key of newly-built column index is enabled Word includes the Target Attribute values, also, the object set of above-mentioned newly-built column index, corresponding right comprising above-mentioned Target Attribute values As;
When there is the column index for being directed to above-mentioned Target Attribute values, the corresponding object of above-mentioned Target Attribute values is inserted into, For in the object set of the column index of the Target Attribute values.
For example, it is assumed that be intended to establish object indexing to all mobile phone products.Then traverse all mobile phone model (mobile phones ID), the attribute and attribute value of each mobile phone model are obtained.Column index is established for each attribute value:
It is assumed that there are two attribute OS and manufacturers for HTC G20 tool, corresponding attribute value is respectively Android and HTC;
It is then directed to this attribute value of Android, searches whether the column index for having for Android;
If it does not exist, then a newly-built column index, the keyword of the newly-built column index is " OS:Android ", object set In include " HTC G20 ";
It is the column index of " OS:Android " if there is keyword, then can be inserted into " HTC G20 " in its object set (can It is inserted into using binary search storage location, subsequent herein to introduce dichotomy);
Similarly, for this attribute value of HTC, similar treatment process is also carried out.
In other embodiments of the present invention, above-mentioned object indexing can be stored in cache server.Cache server starting When, object indexing can be loaded into cache server, so that filtering inquiry uses.Alternatively, object indexing also can be stored in In filter being locally stored of server, it is not limited thereto.
It, can be by based on the socket interface on existing ICP/IP protocol between filtering server and cache server It is communicated.
When object indexing stores in cache server, above-mentioned steps S2 be may particularly include:
The acquisition instruction for including at least the attribute value in querying condition is sent to cache server.So that cache server is sought The object set in column index that the attribute value looked in keyword and acquisition instruction matches, and return to the object set found.In addition, If do not found the column index to match, then cache server returns to empty object set.
In other embodiments of the present invention, Fig. 4 is referred to, the column index in above-described embodiment is stored using Hash structure. That is, object indexing is a big Hash(Hash) table, and each column index can be used as an item of Hash table.Hash data knot Key in structure is used for storage object collection for storing keyword, Value.
Column index is stored using Hash structure, very convenient can be deployed in independent cache server.Existing big portion Point independent cache server carrys out storing data with Hash structure, in this way, above-mentioned object indexing data can perfectly store it is this kind of In cache server.
In other embodiments of the present invention, can also be by above-mentioned all embodiments, cryptographic Hash corresponding to keyword is (above-mentioned Cryptographic Hash is at least and is calculated according to attribute value) storage location as the column index.
Fig. 3 b or Fig. 4 are still referred to, by taking keyword is the column index of OS:Android as an example, " OS:Android " can be calculated Or the cryptographic Hash of " Android ", it is assumed that its cryptographic Hash is equal to 1, then is stored in the column index that keyword is " OS:Android " The first item of Hash table;Similarly, it is assumed that the cryptographic Hash that keyword is OS:IOS is equal to 50, then is the column of " OS:IOS " by keyword Index is stored in the 50th of Hash table.
It is based on above-mentioned storage mode, then above-mentioned " to find what the attribute value in keyword and above-mentioned acquisition instruction matched Object set in column index " can include:
The first cryptographic Hash is calculated according at least to the attribute value in acquisition instruction in step A;
It is assumed that including " OS=Android " in acquisition instruction, the cryptographic Hash of " OS:Android " or " Android " can be calculated As the first cryptographic Hash.
Step B obtains object set from the storage location for being equal to above-mentioned first cryptographic Hash.
It is assumed that the value of the first cryptographic Hash be 1, then from the first item of Hash table obtain object set, obtain Galaxy S4, The mobile phone products such as HTC G20, MX2 ID.
It should be noted that due to being directly to obtain object set from the storage location for being equal to the first cryptographic Hash, no It needs to traverse the list item in entire Hash table, efficiency of algorithm is O (1).
It should be noted that being directed to each attribute value if in acquisition instruction including multiple attribute values, step will be executed Rapid A and B is primary, to get the corresponding object set of the attribute value.
In other embodiments of the present invention, the object in the object set in above-mentioned all embodiments can be arranged by natural order. It is so-called to can refer to sort by ASCII character size by natural order arrangement.
In field of computer technology, each character has a corresponding ASCII character corresponding.With the column index 1 in Fig. 3 b For, the object " Galaxy S4, HTC G20, MX2 " in object set can be considered character string.
In sequence, first compare the 1st character of two character strings, for example, by " G " and " HTC in " Galaxy S4 " " H " in G20 " compares, if it is equal, then compare the 2nd character in two character strings, it is such as equal again, then compare the 3rd A character, until comparing lesser character, then corresponding character string just comes above or below.
It, can be by arranging from big to small it should be noted that sort by ASCII character size, it can also be by arranging from small to large.It presses The sequence of ASCII character size, when taking intersection to the object set got, will play a role.It is subsequent herein to will be described.
Step S3 is related to taking intersection to the object set got.When taking intersection, merger principle two-by-two can be used.
Therefore, in other embodiments of the present invention, it includes: to work as to get that the step S3 in above-mentioned all embodiments, which can be refined, When N number of object set, N-1 wheel matched and searched processing is carried out, above-mentioned N is the natural number not less than 2.
More specifically, each round or the i-th wheel (i be referred to as the natural number not less than 1 and no more than N-1) are at matched and searched Reason, it may include the first processing and second processing.Wherein:
First processing can include: optional two have neither part nor lot in the object set of matched and searched processing, one of object set conduct Reference set, another object set is as searched collection;
Successively using the object in above-mentioned reference set as object reference object;
Search whether there is the object to match with above-mentioned object reference object in above-mentioned searched concentration;
And second processing can include:
When being unsatisfactory for preset condition, retain the object of successful match to medium object collection, and by above-mentioned intermediate object set As the object set for having neither part nor lot in matched and searched processing;
When meeting preset condition, retain the object of successful match to final object set;
Above-mentioned preset condition includes i=N-1.
Refer to Fig. 5, it is assumed that after step S2, got the object set of column index 1,2, X.3 are shared due to one Object set then needs to carry out the processing of 2 wheel matched and searcheds.
In the 1st wheel matched and searched processing, it is assumed that selected the object set of column index 1 as reference set, 2 conduct of column index Searched collection, then successively using the mobile phone products such as Galaxy S4, HTC G20, MX2 ID as object reference object.In searched collection Search whether there is the object to match with above-mentioned object reference object in (HTC G20, HTCS5).
In the present embodiment, matching, it is identical to refer specifically to.For example, when Galaxy S4 is as object reference object, such as There is object identical with Galaxy S4 in searched collection (HTC G20, HTCS5), then retains Galaxy S4 to centre Object set is such as not present, then Galaxy S4 will not retain to medium object collection.In HTC G20 as object reference object, It is such.
Why the object of successful match is retained to medium object collection, be because, this for the 1st wheel matched and searched processing, And 1 is less than 2(3-1=2), so to retain to medium object collection and non-final object set.
After all objects in reference set have all been matched, using medium object collection as have neither part nor lot in matched and searched processing Object set.Start the 2nd wheel matched and searched processing.
It is the object set of medium object collection and column index X, one is used as reference set, one in the 2nd wheel matched and searched processing It is a to collect as searched.Successively using the object in reference set as object reference object, search whether exist in searched concentration The object to match with object reference object.Due to being last wheel matched and searched processing, by the object of successful match Retain to final object set.
After all having matched all objects in reference set, the object in above-mentioned final object set is filter result. Therefore, " object obtained after intersection will be taken as filter result " in step S3 may particularly include: by above-mentioned final object set In object as filter result.
In the following, will be to " searching whether there is the object to match with above-mentioned object reference object in above-mentioned searched concentration " It describes in detail.
In other embodiments of the present invention, object reference object and the searched object concentrated can be carried out one by one Match.Alternatively, the object to match with object reference object can also be whether there is by binary search in searched concentrate.
Aforementioned to be referred to, the object in object set can sort by ASCII character size.Binary search is namely based on ASCII Code size is realized.
Binary search principle is: for given value X, comparing since the middle position of sequence.If present position values Equal to X, then success is searched;If X is less than present position values, searched in the front half section of sequence;If x is greater than present position values, Then continued to search in the second half section of sequence.
Binary search is now illustrated, Fig. 6 is referred to, it is assumed that the corresponding ASCII character of object reference object is 50, is searched 5 objects of Suo Jiyou (object 1- object 5), and, it is assumed that the corresponding SCII code of object 1-5 is 20,30,40,50,60.As it can be seen that The searched object concentrated is arranged from small to large by ASCII character.
The corresponding ASCII character -50 of object reference object is used as value X given herein above, and object 1 is then sequence to object 5, Its dichotomy search procedure is as follows: comparing since object 1 to the middle position of object 5, that is, by object 3 and object reference Object compares.The ASCII character of object 3 is 40, is less than X(50), then in the second half section of object 1 to object 5, (namely object 4 is to right As searching in 5).
Object 4 to the middle position of object 5 is object 4, by object 4 compared with object reference object, the ASCII of object 3 Code is 50, is equal to value X given herein above, then searches success.
It can be seen that by upper example, by searching twice, just have found the object to match with object reference object.And such as will Object reference object is matched one by one with the searched object concentrated, then needs to carry out 4 lookups.In fact, dichotomy Operation total degree is P*log2R.Wherein, P indicates the number of object in reference set, and R indicates the searched number for concentrating object. As can be seen that efficiency is very high.
It is mathematically easy to show that when R > P is big, P*log2R<R*log2P。
Therefore, further to save the time, the number of objects for including in above-mentioned reference set is no more than the searched object concentrated Number.That is, the less object set of selecting object number is as reference set.
Certainly, binary search can also be carried out based on cryptographic Hash to each calculation and object cryptographic Hash in object set.Due to Principle is similar, and therefore not to repeat here.
Based on above-mentioned filtering, in other embodiments of the present invention, it can also further realize user and pass through foreground queries object. In the present embodiment, referring to Fig. 7, filtering server (backstage) at least may include following steps:
S701, the querying condition from foreground is received, above-mentioned querying condition includes at least one attribute value;
The object set in column index that attribute value in S702, acquisition keyword and above-mentioned querying condition matches;
How to obtain object set can be found in record described previously herein, and therefore not to repeat here.
S703, intersection is taken to the object set got;
Intersection how is taken to can be found in record described previously herein, therefore not to repeat here.
S704, information corresponding to the object obtained after intersection is taken;
It has been addressed preceding, object can be for product IDs, name etc., therefore, and filtering server can be according to product IDs to database Inquire information, corresponding information of name corresponding to product IDs etc..
The foreground S705, Xiang Shangshu returns to above- mentioned information, so that above-mentioned foreground is shown.
It should be noted that between foreground and backstage, can be used based on the webservice interface on http agreement into Row communication.
Above-mentioned filter method is widely used scene.For example, it can be applicable in website, especially online shopping mall, with Convenient for user from thousands of product (commodity), quick search to qualified product.It should be noted that for net For standing, the object set in all column indexes takes union, is just all products in website (online shopping mall).
More specifically, Fig. 8 is referred to, Foreground and Background correlation interaction flow is as follows:
S801, it is assumed that user selects OS for " Android " in the mobile phone products list provided by front page layout, manufacture Quotient is " HTC ", and state (Condition) is " new " (New), then user has input the attribute and attribute value for inquiry;
S802, foreground system assemble user query condition (in the present embodiment, OS=Android;Manufacturer=HTC; Condition=New) after, submit to filtering server;
S803, filtering server are sent to cache server comprising the attribute value in querying condition according to querying condition Acquisition instruction.
GetCache (OS:Android), getCache (manufacturer: HTC) and getCache in Fig. 8 It (Condition:New), is exactly acquisition instruction.
S804, cache server return to the object set found;
How cache server, which obtains object set, can be found in record described previously herein, and therefore not to repeat here.
S805, filtering server take intersection to the object set got, and the intersection of each object set is finally to need to inquire Product IDs namely filter result;
Intersection how is taken to can be found in record described previously herein, therefore not to repeat here.
S806, filtering server return to foreground system to information corresponding to data base querying filter result;
S807, foreground system return the result tissue front page layout according to filtering server, and show user.
In addition, in practice, inevitably may require that newly-increased object.Therefore, referring to Fig. 9, in other implementations of the present invention In example, above-mentioned filter method may also include the steps of:
S91, the related data for receiving the newly-increased object inputted, above-mentioned related data include at least attribute value;
S92, above-mentioned newly-increased object's property value is obtained;
S93, from above-mentioned object indexing, obtain the object set that keyword and newly-increased object's property value match;
In S94, the object set for getting above-mentioned newly-increased object insertion.
When object indexing is stored in cache server, above-mentioned steps S93 be may particularly include:
The acquisition instruction for including at least newly-increased object's property value is sent to cache server;So as to cache server searching Attribute value in keyword and above-mentioned acquisition instruction, the object set in column index to match as target object collection, and return Above-mentioned target object collection.
How cache server is according to acquisition instruction searching object set, reference can be made to record described previously herein, therefore not to repeat here.
In addition, it should be noted that, matching for a certain attribute value for increasing object newly as cache server is not found Object set, then create a column index, the keyword of the newly-built column index includes the attribute value.
It corresponds, above-mentioned steps S94 can include:
(filtering server) concentrates newly-increased object insertion target object in local, obtains updated target object collection;
Utilize the target object collection in updated target object collection replacement cache server.
Referring to Figure 10, the interaction flow of equipment room is as follows:
S101, product manager are submitted to filtering server after backstage typing increases essential information and the attribute of object newly;
Newly-increased object is added to database by S102, filtering server;
S103, filtering server obtain newly-increased object's property value;
S104, filtering server obtain the corresponding object set of attribute value (column index) from cache server;
S105, after getting object set, newly-increased object is inserted into object set by filtering server by natural order (can make It is inserted into binary search storage location);
After the completion of S106, insertion, filtering server again the updated target object collection of PUT to cache server;More Body, filtering server is the column index built, by the storage of HASH data structure mode into cache server.
S107, cache server return successfully, indicate that the corresponding column index of this attribute value of the newly-increased object has delayed Update is deposited to complete.
It should be noted that repeating step S104 to S107 if newly-increased object has multiple attribute values;
S108, all properties value column index buffer update after, filtering server return operate successfully.
It should be noted that in the prior art one, website (store) is to filter out product, use product complete line by line Amount cache way: on startup, product all being checked out from database with attribute value corresponding to product, and one by one will Product and attribute value group in a row after, be fully loaded to be cached in server, to use for inquiry.That is, its be by For product as keyword, each product accounts for what the mode that a line records was cached.
(attribute value clicked is as filter attribute after the attribute value for clicking some product category of foreground by store user Value), server traverses each product of the type, by each attribute value of each product and filter attribute value phase in traversal Match, such as successful match, then the product of successful match, which is filtered out, comes.
There are following disadvantages for full dose cache way line by line for the said goods:
One, cache deployment issue: must be in same server, that is, which does not have to the caching of product, filtering inquiry Have and is mutually separated data cached with filtering.The deployment of online shopping mall's multiserver (in existing, large-scale store be substantially multimachine portion Administration) under environment, every server has required local cache, is one for this memory source limited to server and valuable The very big waste of kind.
In addition, after being such as updated from the background to product, needing synchronized update more under the conditions of multiserver deployment mall system Product caching in server, such as certain server update exception, is also also easy to produce the asynchronous problem of data.
Two, dilatancy problem: since the data volume of caching is huge, when carrying out local cache, dilatation will be by local memory The limitation in space.
Generally store run initial stage, since product quantity is few, above-mentioned dilatation problem is not too much obvious, arrived operation at For a long time, product volume will be doubled and redoubled, and dilatation problem will be got worse.
Three, response speed problem: inquiry this function of product, it is desirable that foreground response speed is generally within 2 seconds, it is contemplated that Network delay, to hind computation time less than 0.5 second.And in website (store), since product quantity is numerous, using product Full dose caching then needs to traverse matching from thousands of product line by line, and a large amount of cycle calculations is needed to match, in response speed Degree has certain room for improvement.
The shortcomings that with the above-mentioned prior art, is corresponding, above embodiments of the present invention can bring benefit include the following:
One, in embodiments of the present invention, cache server can mutually be separated with filtering server, thus by buffer memory and mistake Filter is calculated and is mutually separated.It directly has the advantage that: buffer memory can independently dispose under distributed environment, reduce to local Buffer size improves resource utilization;And due to the independence and public character of buffer memory, the object set structure of caching is simple, Allow that the update of backing objects data is highly reliable, synchronized update;
Two, good compatibility:, can very well and mesh due to using attribute value (Key)-object set (Value) this frame mode The combination of preceding independent cache server big absolutely, and this kind of cache server (such as Memcached, Redis) is distributed caching Formula, multi-level buffer system system (Cahe- memory-disk etc.) have very mature function;
Three, search speed is fast: the storage location using cryptographic Hash corresponding to keyword as the column index is searched, and is calculated Method efficiency is O (1).Also, lookup speed can be improved using " binary search " operation when taking intersection to the object set of acquisition Degree, must respond foreground queries so as to very quick.
It corresponding, the embodiment of the present invention also provides a kind of caching method, and executing subject is cache server, referring to Figure 11, the caching method are also based on aforementioned object index, include at least following steps:
S111, the acquisition instruction for including at least attribute value is received;
The object set in column index that attribute value in S112, searching keyword and above-mentioned acquisition instruction matches, and return It returns.
It is described previously herein to have described above-mentioned column index using the storage of Hash structure.In other embodiments of the present invention, on Cryptographic Hash corresponding to keyword in column index is stated, as the storage location of above-mentioned column index, above-mentioned cryptographic Hash is at least basis Attribute value is calculated.
Correspondingly, above-mentioned steps S112 may include following steps:
The first cryptographic Hash is calculated according at least to the attribute value in acquisition instruction;
Object set is obtained from the storage location for being equal to the first cryptographic Hash.
Related content can be found in record described previously herein, and therefore not to repeat here.
Corresponding with above-mentioned filter method, the embodiment of the present invention also provides a kind of filtering server.Figure 12 shows above-mentioned A kind of structure of filtering server, at least can include:
First receiving unit 1, for receiving querying condition, above-mentioned querying condition includes at least one attribute value;
First acquisition unit 2, for obtaining the object in the column index to match with the attribute value in above-mentioned querying condition Collection;
Filter element 3 takes the object obtained after intersection as filter result for taking intersection to the object set got.
Related content refers to record described previously herein, and therefore not to repeat here.
In other embodiments of the present invention, above-mentioned filtering server may also include object indexing and establish unit, be used for by Each attribute value of every an object establishes the column index for being directed to Target Attribute values respectively as Target Attribute values.
More specifically, it can further comprise that the first object indexing establishes subelement and second that above-mentioned object indexing, which establishes unit, Object indexing establishes subelement, in which:
First object indexing establishes subelement, for creating column rope when there is no the column index for Target Attribute values Draw, enables the keyword of newly-built column index include above-mentioned Target Attribute values, also, the object set of newly-built column index, comprising being somebody's turn to do The corresponding object of Target Attribute values;
Second object indexing establishes subelement, will be above-mentioned when for being directed to the column index of above-mentioned Target Attribute values in presence The corresponding object of Target Attribute values is inserted into the object set for the column index of Target Attribute values.
Related content refers to record described previously herein, and therefore not to repeat here.
In other embodiments of the present invention, for newly-increased object, above-mentioned filtering server may also include that
Second receiving unit, the related data of newly-increased object for receiving input, above-mentioned related data, which includes at least, to be belonged to Property value;
Second acquisition unit, for obtaining above-mentioned newly-increased object's property value;
Third acquiring unit obtains in the column index that keyword and above-mentioned attribute value match from above-mentioned object indexing Object set;It should be noted that for a certain attribute value for increasing object newly, as pair to match is not found in cache server As collection, then a column index is created, the keyword of the newly-built column index includes the attribute value.
It is inserted into unit, in the object set for getting above-mentioned newly-increased object insertion.
In other embodiments of the present invention, above-mentioned filtering server may also include that
4th acquiring unit, for taking information corresponding to the object obtained after intersection;
Return unit, for returning to above- mentioned information to foreground, so that above-mentioned foreground is shown.
Figure 13 gives a kind of hardware configuration of above-mentioned filtering server 130, may include CPU131,132 and of memory Transceiver 134.Wherein, transceiver 134 can be used for all data and instructions of sending and receiving, and CPU131 is stored in memory by operation Software program 133 in 132 calls the data being stored in memory 132, and calls transceiver 134, at least can be performed such as Lower step:
Filter condition is received, above-mentioned filter condition includes at least one attribute value;
Obtain the object set in the column index to match with the attribute value in above-mentioned filter condition;
Intersection is taken to the object set got, takes the object obtained after intersection as filter result.
In addition, above-mentioned filtering server 130 also achievable context of methods part is introduced, filtering server is executable The refinement of other steps and each step, therefore not to repeat here.
It corresponds, the embodiment of the invention also provides cache servers.Figure 14 shows above-mentioned cache server A kind of structure, at least can include:
4th receiving unit 7, for receiving the acquisition instruction for including at least attribute value;
Unit 8 is found, for finding pair in the column index that the attribute value in keyword and above-mentioned acquisition instruction matches As collection, and return.
Figure 15 gives a kind of hardware configuration of above-mentioned cache server 150, may include CPU151,152 and of memory Transceiver 154.Wherein, transceiver 154 can be used for all data and instructions of sending and receiving, and CPU151 is stored in memory by operation Software program 153 in 152 calls the data being stored in memory 152 and calls transceiver 154, at least executable as follows Step:
Receive the acquisition instruction for including at least attribute value;
The object set in the column index that the attribute value in keyword and above-mentioned acquisition instruction matches is found, and is returned.
In addition, what above-mentioned cache server 150 cache server that also achievable context of methods part is introduced can be performed The refinement of other steps and each step, therefore not to repeat here.
In the present invention, above-mentioned memory concretely DDR SDRAM, SRAM, FLASH, SSD, RAM, ROM etc., master It to include program storage area and data storage area, wherein program storage area can storage program area and at least one function institute The application program etc. needed;Data storage area can store the executive condition according to CPU and the data that finally generate, hold as CPU Intermediate data caused by row above-mentioned steps, then be stored in memory.It should be noted that in the present invention, CPU and memory It can be integrated in same chip, two devices can also be independent.
Each embodiment in this specification is described in a progressive manner, the highlights of each of the examples are with other The difference of embodiment, the same or similar parts in each embodiment may refer to each other.
The step of method described in conjunction with the examples disclosed in this document or algorithm, can directly be held with hardware, processor The combination of capable software module or the two is implemented.Software module can be placed in random access memory (RAM), memory, read-only deposit Reservoir (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technology In any other form of storage medium well known in field.
The foregoing description of the disclosed embodiments enables those skilled in the art to implement or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, as defined herein General Principle can be realized in other embodiments without departing from the spirit or scope of the present invention.Therefore, of the invention It is not intended to be limited to the embodiments shown herein, and is to fit to and the principles and novel features disclosed herein phase one The widest scope of cause.

Claims (18)

1. a kind of filter method, which is characterized in that based on the object indexing pre-established, the object indexing includes being directed to attribute It is worth the column index established;Each column index may include keyword and object set, and attribute value is included at least in the keyword, described Object in object set possesses the attribute value in the keyword;The object indexing is stored in cache server;The pass The corresponding cryptographic Hash of key word is storage location of the column index in the object indexing, the corresponding cryptographic Hash of the keyword At least it is calculated according to the attribute value in the keyword;
The described method includes:
Filter condition is received, the filter condition includes at least one attribute value;
The object set in the column index to match with the attribute value in the filter condition is obtained, the object in the object set is equal Possess the attribute value;
Intersection is taken to the object set got, takes the object obtained after intersection as filter result;
Wherein, the object set obtained in the column index to match with the attribute value in the filter condition includes:
The first cryptographic Hash is calculated according to the attribute value in the filter condition;
Object set is obtained from the storage location for being equal to first cryptographic Hash.
2. the method as described in claim 1, which is characterized in that the column index includes keyword and object set, the key Word includes at least attribute value;Attribute value in any column index is different from the attribute value in other column indexes;
The object indexing is established in the following way:
Using each attribute value of every an object as Target Attribute values, the column index for being directed to the Target Attribute values is established;
Described establish include: for the column indexes of the Target Attribute values
When there is no the column index for the Target Attribute values, column index is created, the keyword packet of newly-built column index is enabled Containing the Target Attribute values, also, the object set of the newly-built column index, it include the corresponding object of the Target Attribute values;
When there is the column index for being directed to the Target Attribute values, the corresponding object of the Target Attribute values is inserted into, for In the object set of the column index of the Target Attribute values.
3. method according to claim 1 or 2, which is characterized in that the column index is stored using Hash structure.
4. method according to claim 1 or 2, which is characterized in that the object in the object set is arranged by natural order.
5. method according to claim 1 or 2, which is characterized in that the described pair of object set got takes the intersection to include:
When getting N number of object set, N-1 wheel matched and searched processing is carried out, the N is the natural number not less than 2.
6. method as claimed in claim 5, which is characterized in that the i-th wheel matched and searched processing includes at the first processing and second Reason, the i are the natural number not less than 1 and no more than N-1, in which:
First processing includes: optional two object sets for having neither part nor lot in matched and searched processing, and one of object set is as ginseng Collection is examined, another object set is as searched collection;
Successively using the object in the reference set as object reference object;
Search whether there is the object to match with the object reference object in the searched concentration;
The second processing includes:
When being unsatisfactory for preset condition, retain the object of successful match to medium object collection, and using the medium object collection as Have neither part nor lot in the object set of matched and searched processing;
When meeting preset condition, retain the object of successful match to final object set;
The preset condition includes i=N-1.
7. method as claimed in claim 6, which is characterized in that described that the object obtained after intersection will be taken as filter result packet It includes:
Using the object in the final object set as filter result.
8. the method for claim 7, which is characterized in that it is described it is described it is searched concentration search whether exist with it is described The object that object reference object matches includes:
It whether there is the object to match with the object reference object by binary search in searched concentrate.
9. method according to claim 8, which is characterized in that the number of objects for including in the reference set is no more than searched collection In number of objects.
10. method according to claim 2, which is characterized in that further include:
The related data of the newly-increased object of input is received, the related data includes at least attribute value;
Obtain the newly-increased object's property value;
From the object indexing, the object in the column index that keyword matches with the newly-increased object's property value is obtained Collection;
In the object set that the newly-increased object insertion is got.
11. such as the described in any item methods of claim 1,2,10, which is characterized in that the object indexing is stored in buffer service In device.
12. method as claimed in claim 11, which is characterized in that the acquisition and the attribute value phase in the filter condition The object set in column index matched includes:
It is sent to the cache server, including at least the acquisition instruction of the attribute value in filter condition;So as to caching clothes Business device finds the object set in the column index that the attribute value in keyword and the acquisition instruction matches, and returns.
13. method as claimed in claim 11, which is characterized in that
It is described from the object indexing, the object set obtained in the column index that matches with the attribute value of keyword includes:
The acquisition instruction for including at least newly-increased object's property value is sent to the cache server;So as to the cache server The object set in the column index that the attribute value in keyword and the acquisition instruction matches is found as target object collection, and is returned Return the target object collection;
Include: in the object set that the newly-increased object insertion is got
The newly-increased object insertion target object is concentrated local, obtains updated target object collection;
Utilize the target object collection in updated target object collection replacement cache server.
14. the method as described in claim 1, which is characterized in that
The filter condition is issued by foreground;
The method also includes:
Obtain the corresponding information of the filter result;
The information is returned to the foreground, so that the foreground is shown.
15. a kind of filtering server, which is characterized in that based on the object indexing pre-established, the object indexing includes being directed to The column index that attribute value is established;Each column index may include keyword and object set, include at least attribute value in the keyword, Object in the object set possesses the attribute value in the keyword;The object indexing is stored in cache server;Institute Stating the corresponding cryptographic Hash of keyword is storage location of the column index in the object indexing, the corresponding Kazakhstan of the keyword Uncommon value is at least calculated according to the attribute value in the keyword;The filtering server includes at least:
First receiving unit, for receiving filter condition, the filter condition includes at least one attribute value;
First acquisition unit, for obtaining the object set in the column index to match with the attribute value in the filter condition, institute It states the object in object set and possesses the attribute value;
Filter element takes the object obtained after intersection as filter result for taking intersection to the object set got;
Wherein, the object set obtained in the column index to match with the attribute value in the filter condition includes:
The first cryptographic Hash is calculated according to the attribute value in the filter condition;
Object set is obtained from the storage location for being equal to first cryptographic Hash.
16. server as claimed in claim 15, which is characterized in that the column index includes keyword and object set, described Keyword includes at least attribute value;Attribute value in any column index is different from the attribute value in other column indexes;
The server further include:
Object indexing establishes unit, for establishing and being directed to institute using each attribute value of every an object as Target Attribute values State the column index of Target Attribute values;
The object indexing establishes unit
First object indexing establishes subelement, for creating column rope when there is no the column index for the Target Attribute values Draw, the keyword of newly-built column index is enabled to include the Target Attribute values, also, the object set of the newly-built column index, packet Containing the corresponding object of the Target Attribute values;
Second object indexing establishes subelement, when there is the column index for being directed to the Target Attribute values, by the objective attribute target attribute It is worth corresponding object to be inserted into, in the object set of the column index of the Target Attribute values.
17. the filtering server as described in claim 15 or 16, which is characterized in that further include:
Second receiving unit, the related data of newly-increased object for receiving input, the related data include at least attribute value;
Second acquisition unit, for obtaining the newly-increased object's property value;
Third acquiring unit obtains pair in the column index that keyword and the attribute value match from the object indexing As collection;
It is inserted into unit, in the object set for getting the newly-increased object insertion.
18. the filtering server as described in claim 15 or 16, which is characterized in that
The filter condition is issued by foreground;
The filtering server further include:
4th acquiring unit, for obtaining the corresponding information of the filter result;
Return unit, for returning to the information to the foreground, so that the foreground is shown.
CN201310422744.8A 2013-09-16 2013-09-16 Filter method and server Active CN104462104B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310422744.8A CN104462104B (en) 2013-09-16 2013-09-16 Filter method and server

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310422744.8A CN104462104B (en) 2013-09-16 2013-09-16 Filter method and server

Publications (2)

Publication Number Publication Date
CN104462104A CN104462104A (en) 2015-03-25
CN104462104B true CN104462104B (en) 2019-03-19

Family

ID=52908168

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310422744.8A Active CN104462104B (en) 2013-09-16 2013-09-16 Filter method and server

Country Status (1)

Country Link
CN (1) CN104462104B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109063199B (en) * 2018-09-11 2022-10-25 优视科技有限公司 Resource filtering method and device, electronic equipment and computer readable medium
CN111768202A (en) * 2019-04-24 2020-10-13 北京京东尚科信息技术有限公司 Payment verification method, payment verification node, full-amount node and storage medium
CN111368113B (en) * 2020-02-21 2021-03-26 北京值得买科技股份有限公司 Commodity data display method, system, medium and equipment

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101944086A (en) * 2009-07-10 2011-01-12 华中科技大学 Whole word index dictionary
CN101963999A (en) * 2010-11-03 2011-02-02 北京亮点时间科技有限公司 Music classified search engine system and music classified search method
CN102117320A (en) * 2011-01-11 2011-07-06 百度在线网络技术(北京)有限公司 Structured data searching method and device
CN102135974A (en) * 2010-08-06 2011-07-27 华为软件技术有限公司 Data source selecting method and system
CN103246664A (en) * 2012-02-07 2013-08-14 阿里巴巴集团控股有限公司 Web page retrieval method and device

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8452806B2 (en) * 2010-10-26 2013-05-28 Cbs Interactive Inc. Automatic catalog search preview
CN103164408B (en) * 2011-12-09 2016-03-30 阿里巴巴集团控股有限公司 Information based on vertical search engine stores, querying method and device thereof

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101944086A (en) * 2009-07-10 2011-01-12 华中科技大学 Whole word index dictionary
CN102135974A (en) * 2010-08-06 2011-07-27 华为软件技术有限公司 Data source selecting method and system
CN101963999A (en) * 2010-11-03 2011-02-02 北京亮点时间科技有限公司 Music classified search engine system and music classified search method
CN102117320A (en) * 2011-01-11 2011-07-06 百度在线网络技术(北京)有限公司 Structured data searching method and device
CN103246664A (en) * 2012-02-07 2013-08-14 阿里巴巴集团控股有限公司 Web page retrieval method and device

Also Published As

Publication number Publication date
CN104462104A (en) 2015-03-25

Similar Documents

Publication Publication Date Title
CN103810224B (en) information persistence and query method and device
US20170308621A1 (en) Hash-based efficient secondary indexing for graph data stored in non-relational data stores
JP5721627B2 (en) Method and system for saving database storage space
CN103902535B (en) Obtain the method, apparatus and system of associational word
CN105574054B (en) A kind of distributed caching range query method, apparatus and system
US9229961B2 (en) Database management delete efficiency
WO2016018201A1 (en) Searching relational and graph databases
CN104699718A (en) Method and device for rapidly introducing business data
CN104268295A (en) Data query method and device
CN103761102B (en) A kind of uniform data service platform and its implementation
CN107480260B (en) Big data real-time analysis method and device, computing equipment and computer storage medium
CN103123650A (en) Extensible markup language (XML) data bank full-text indexing method based on integer mapping
CN108037967A (en) A kind of menu loading method and electronic equipment based on more parent-child structures
CN104462104B (en) Filter method and server
CA2461871A1 (en) An efficient index structure to access hierarchical data in a relational database system
US20180150526A1 (en) Generic query language for data stores
CN103336782A (en) Relational distributed database system
CN105447342B (en) script encryption method, decryption method and engine
Kim et al. Supporting set-valued joins in NoSQL using MapReduce
CN102508884A (en) Method and device for acquiring hotpot events and real-time comments
CN107346317A (en) A kind of data query method and apparatus
CN107102995B (en) Method and device for determining SQL execution plan
KR20170039658A (en) Information operation
CN106933864A (en) A kind of search engine system and its searching method
CN107085613A (en) Enter the filter method and device of library file

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20200211

Address after: 518129 Bantian HUAWEI headquarters office building, Longgang District, Guangdong, Shenzhen

Patentee after: HUAWEI TECHNOLOGIES Co.,Ltd.

Address before: 210012 HUAWEI Nanjing base, 101 software Avenue, Yuhuatai District, Jiangsu, Nanjing

Patentee before: Huawei Technologies Co.,Ltd.

TR01 Transfer of patent right