Sear request processing method and system

A search request and processing method technology, applied in the computer field, can solve the problem of fast decompression speed and achieve the effect of fast compression and decompression

Active Publication Date: 2016-06-01
ALIBABA (CHINA) CO LTD
View PDF6 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In this way, only one request string can be sent to compress one. Existing compression algorithms such as gzip cannot ensure that the compressed query is small enough and the compression and decompression speed are fast.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Sear request processing method and system
  • Sear request processing method and system
  • Sear request processing method and system

Examples

Experimental program
Comparison scheme
Effect test

no. 1 example

[0021] figure 1 Shows a flowchart of a search request processing method provided by the first embodiment of the present invention, please refer to figure 1 , The method includes:

[0022] Step S110: The routing node receives a search request sent by a client, and the search request includes a request string input by the user through the client;

[0023] After the user enters the search content into the client through keyboard, voice, handwriting, etc., the client converts it into a request string containing multiple characters. The characters in the request string can include text, pinyin, symbols, Numbers or their combination. The client will send a search request containing the request string to the routing node.

[0024] Step S120, the routing node uses a dictionary compression algorithm to compress the request string into a compression code using a pre-loaded dictionary;

[0025] After the routing node receives the search request, it can directly compress the request string in th...

no. 2 example

[0035] figure 2 It shows a flowchart of a search request processing method provided by the second embodiment of the present invention. See figure 2 This embodiment describes the process of constructing and updating a full offline dictionary in the search request processing process. Therefore, the offline dictionaries in this embodiment (unless otherwise specified) are all offline dictionaries. Specifically, the method includes:

[0036] Step S210, the construction node trains the offline request string to construct an offline dictionary;

[0037] Preferably, the construction node can train the offline request string during the time when the network is not very busy (for example, 0 o'clock in the evening to 6 o'clock in the morning) to construct an offline dictionary.

[0038] Please refer to image 3 Specifically, step S210 may include:

[0039] Step S211, build a dictionary tree according to the offline request string;

[0040] Specifically, the type of offline request string can b...

no. 3 example

[0059] Figure 4 Shows a flowchart of a search request processing method provided by the third embodiment of the present invention. See Figure 4 This embodiment describes the process of constructing and updating an incremental offline dictionary in the search request processing process. Therefore, the offline dictionary in this embodiment (unless otherwise specified) is an incremental offline dictionary. Specifically, the method includes:

[0060] Step S310: If the number of request strings that do not belong to the predetermined type in the offline request string exceeds a predetermined number, the offline request string is separately trained to construct an incremental offline dictionary.

[0061] For the specific construction process, refer to the second embodiment, which will not be repeated here.

[0062] Step S320, the management node sends the information of the incremental offline dictionary to the routing node and the search node. The information of the incremental offline...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

Embodiments of the invention disclose a search request processing method and system, and aims at realizing the rapid compression and decompression of request strings and causing relatively small compression results. The method comprises the following steps: receiving, by a routing node, a search request sent by a client, wherein the search request comprises a request string input by a user through the client; using a pre-loaded dictionary to compress the request into a compressed code by the routing node by utilizing a dictionary compression algorithm; sending the compressed code and a version number of the dictionary by the routing node; and decompressing the compressed code by a search node through using the dictionary corresponding to the version number.

Description

Technical field [0001] The present invention relates to the field of computer technology, and in particular to a method and system for processing search requests. Background technique [0002] In the search system, every query will retrieve the services of hundreds of nodes. In a query, a small request string (query) may add a large amount of information after the multi-layer processing of the search system. For example, the weight, location, closeness, related words, synonyms, category and other information of the term in the request string, as well as other system additional information, such as timeliness, click data, display data, etc., and Location information and access information related to the inquirer. In this way, when an ordinary query reaches the bottom of the retrieval system, the size of the query increases by tens or even hundreds of times. In this way, when a large number of queries are sent from the upstream to the routing node (router node) of the retrieval s...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
CPCG06F16/951
Inventor 代俊
Owner ALIBABA (CHINA) CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products