CN110516141A - Data query method, apparatus, electronic equipment and readable storage medium storing program for executing - Google Patents

Data query method, apparatus, electronic equipment and readable storage medium storing program for executing Download PDF

Info

Publication number
CN110516141A
CN110516141A CN201910662741.9A CN201910662741A CN110516141A CN 110516141 A CN110516141 A CN 110516141A CN 201910662741 A CN201910662741 A CN 201910662741A CN 110516141 A CN110516141 A CN 110516141A
Authority
CN
China
Prior art keywords
terminal
result set
search
query
query value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201910662741.9A
Other languages
Chinese (zh)
Other versions
CN110516141B (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.)
Visionvera Information Technology Co Ltd
Original Assignee
Visionvera Information Technology 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 Visionvera Information Technology Co Ltd filed Critical Visionvera Information Technology Co Ltd
Priority to CN201910662741.9A priority Critical patent/CN110516141B/en
Publication of CN110516141A publication Critical patent/CN110516141A/en
Application granted granted Critical
Publication of CN110516141B publication Critical patent/CN110516141B/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/95Retrieval from the web
    • G06F16/953Querying, e.g. by the use of web search engines
    • G06F16/9532Query formulation
    • 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/95Retrieval from the web
    • G06F16/953Querying, e.g. by the use of web search engines
    • G06F16/9535Search customisation based on user profiles and personalisation

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

The embodiment of the invention provides a kind of data query methods, are related to technical field of data processing.Method includes: the search key for receiving terminal and sending;It is decomposed to obtain the first Query Value for search key;It is scanned for obtaining the first result set according to the first Query Value;Receive continue searching request when, search key is decomposed to obtain the second Query Value, is scanned in the first result set according to the second Query Value, and obtain the second result set, with this incremental search keyword, gradually simplifies result set and finally obtain search target.The present invention also provides a kind of data query device, electronic equipment and readable storage medium storing program for executing.Data query method, apparatus, electronic equipment and readable storage medium storing program for executing provided by the invention, be capable of fast accurate searches search target, while can also avoid the occurrence of and the phenomenon that responding slowly seemingly-dead pause occur because original data volume is big.

Description

Data query method, apparatus, electronic equipment and readable storage medium storing program for executing
Technical field
The present invention relates to technical field of data processing, more particularly to a kind of data query method, apparatus electronic equipment with And a kind of computer readable storage medium.
Background technique
User directly carries out data search in the case where original data volume is big when carrying out data query, according to The configuration of searcher, way of search, the difference for searching for content, the time of required cost are also different.
In the related technology, user is in inquiry, if directly scanning in data source, in the big situation of original data volume Under, directly judge that objective result will appear search relatively slowly or because the too big response of data does not come the phenomenon that seemingly-dead pause occur.
Summary of the invention
In view of the above problems, it proposes the embodiment of the present invention and overcomes the above problem or at least partly in order to provide one kind A kind of data query method, apparatus, electronic equipment and the readable storage medium storing program for executing to solve the above problems.
In a first aspect, the method is applied to background server the embodiment of the invention discloses a kind of data query method, The background server and terminal communicate to connect, which comprises
Receive the search key that the terminal is sent;
It is decomposed to obtain the first Query Value for described search keyword, wherein first Query Value is described searches The minimum unit value of rope keyword;
It scans for obtaining the first result set according to first Query Value, and first result set is sent to described Terminal, so that the first result set described in the terminal display;
Receive that the terminal sends continues searching request, wherein described to continue searching request be the terminal according to institute State the first result set judgement do not obtain search target when, Xiang Suoshu background server send;
Judge whether the first result in first result set is greater than pre-set level;
In the case where first result is greater than the pre-set level, decomposed to obtain the to described search keyword Two Query Values, wherein the unit value of second Query Value is greater than the unit value of first Query Value;
It is scanned in first result set according to second Query Value, and obtains the second result set;
Second result set is sent to the terminal, so that the second result set described in the terminal display;
It when stopping search of receiving that the terminal sends is requested, stops search, wherein the terminal is according to described the Two result sets judge whether to obtain search target, and when obtaining described search target, the transmission of Xiang Suoshu server, which stops search, is asked It asks, when not obtaining described search target, request is continued searching described in the transmission of Xiang Suoshu background server, until the terminal root Until obtaining described search target according to the result set received.
It is further, described to be decomposed the step of obtaining the first Query Value for described search keyword, comprising:
Described search keyword is decomposed, extracts the first word of described search keyword as the first Query Value.
It is further, described that the step of obtaining the second Query Value is decomposed to described search keyword, comprising:
Described search keyword is decomposed to obtain the adjacent keyword of first Query Value, is looked into according to described first Inquiry value and the adjacent keyword obtain second Query Value.
Further, the method also includes:
It establishes described search keyword and obtains the corresponding relationship of the objective result collection of described search target, and searched described Rope keyword and objective result collection storage are into historical data base.
Further, the method also includes:
Judge in the historical data base whether there is objective result collection corresponding with described search keyword, has pair When the objective result collection answered, the objective result collection is sent to the terminal.
Second aspect, the embodiment of the invention discloses a kind of data query device, described device is applied to background server, The background server and terminal communicate to connect, and described device includes:
Receiving module, the search key sent for receiving the terminal;
Decomposing module, for being decomposed to obtain the first Query Value for described search keyword, wherein described first looks into Inquiry value is the minimum unit value of described search keyword;
Enquiry module, for scanning for obtaining the first result set according to first Query Value, and by first knot Fruit collection is sent to the terminal, so that the first result set described in the terminal display;
The receiving module, be also used to receive the terminal transmission continues searching request, wherein described continue searching is asked When terminal described in Seeking Truth does not obtain search target according to first result set judgement, what Xiang Suoshu background server was sent;
First judgment module, for judging whether the first result in first result set is greater than pre-set level;
The decomposing module is also used in the case where first result is greater than the pre-set level, to described search Keyword is decomposed to obtain the second Query Value, wherein the unit value of second Query Value is greater than first Query Value Unit value;
The enquiry module is also used to be scanned in first result set according to second Query Value, and To the second result set;
Sending module, for second result set to be sent to the terminal, so that second described in the terminal display Result set;
Stopping modular, for stopping search, wherein described when stopping search of receiving that the terminal sends is requested Terminal judges whether to obtain search target, when obtaining described search target, Xiang Suoshu server according to second result set Transmission stops search request, when not obtaining described search target, Xiang Suoshu background server send described in continue searching request, Until the terminal obtains described search target according to the result set received.
Further, the decomposing module includes:
First decomposes submodule, for decomposing to described search keyword, extracts the first place of described search keyword Word is as the first Query Value.
Further, the decomposing module further include:
Second decomposes submodule, obtains the adjacent pass of first Query Value for being decomposed to described search keyword Key word obtains second Query Value according to first Query Value and the adjacent keyword.
Further, described device further include:
Creation module, the corresponding of objective result collection for establishing described search keyword and obtain described search target are closed System, and by described search keyword and objective result collection storage into historical data base.
Further, described device further include:
Second judgment module, for judging whether there is mesh corresponding with described search keyword in the historical data base The objective result collection is sent to the terminal when with corresponding objective result collection by mark result set.
The third aspect, the embodiment of the invention also discloses a kind of electronic equipment, comprising:
One or more processors;With
One or more machine readable medias of instruction are stored thereon with, are executed when by one or more of processors When, so that the equipment executes the data query method as described in any one of the embodiment of the present invention.
Fourth aspect, the embodiment of the invention also discloses a kind of computer readable storage medium, the computer journeys of storage Sequence makes processor execute data query method as described in the embodiments of the present invention.
The embodiment of the present invention includes following advantages:
In embodiments of the present invention, background server is divided by the search key sent to the terminal received Solution, obtains the first Query Value, carries out search for the first time according to the first Query Value and obtains the first result set, and be sent to terminal, eventually End continues searching request to background server transmission when needing to continue searching.Background server, which receives, continues searching request Afterwards, search key is decomposed again, obtains the second Query Value, and carry out in the first result set according to the second Query Value Search obtains the second result set, and the second result set is then sent to terminal.It is recycled with this, until being searched in result set Target.
It is searched for since the first Query Value of the minimum unit value with search key, when carrying out match query, because The unit value of minimum unit value is minimum, and required calculation amount is smaller when single is matched, to reduce whole search matching institute The calculation amount needed is effectively prevented from and seemingly-dead phenomenon occurs, promotes search speed.Meanwhile search key is split, for The match query of data source can value maximum result, reverse reduction result set is successively carried out on the basis of maximum result Size, finally accurately obtain search target, can be effectively avoided omit relevant search content.
Detailed description of the invention
Fig. 1 is a kind of networking schematic diagram of view networking of the invention;
Fig. 2 is a kind of hardware structural diagram of node server of the invention;
Fig. 3 is a kind of hardware structural diagram of access switch of the invention;
Fig. 4 is the hardware structural diagram that a kind of Ethernet association of the invention turns gateway;
Fig. 5 is a kind of step flow chart of data query method of the embodiment of the present invention;
Fig. 6 is a kind of a kind of implementation flow chart of data query method of the embodiment of the present invention;
Fig. 7 is a kind of a kind of flow chart of steps of data query method of the embodiment of the present invention;
Fig. 8 is a kind of structural schematic diagram of data query device embodiment of the embodiment of the present invention.
Specific embodiment
In order to make the foregoing objectives, features and advantages of the present invention clearer and more comprehensible, with reference to the accompanying drawing and specific real Applying mode, the present invention is described in further detail.
It is the important milestone of network Development depending on networking, is a real-time network, can be realized HD video real-time Transmission, Push numerous Internet applications to HD video, high definition is face-to-face.
Real-time high-definition video switching technology is used depending on networking, it can be such as high in a network platform by required service Clear video conference, Intellectualized monitoring analysis, emergency command, digital broadcast television, delay TV, the Web-based instruction, shows video monitoring Field live streaming, VOD program request, TV Mail, individual character records (PVR), Intranet (manages) channel by oneself, intelligent video Broadcast Control, information publication All be incorporated into a system platform etc. services such as tens of kinds of videos, voice, picture, text, communication, data, by TV or Computer realizes that high-definition quality video plays.
Embodiment in order to enable those skilled in the art to better understand the present invention is introduced to depending on networking below:
Depending on networking, applied portion of techniques is as described below:
Network technology (Network Technology)
Traditional ethernet (Ethernet) is improved depending on the network technology innovation networked, with potential huge on network First video flow.It is exchanged different from simple network packet packet switch (Packet Switching) or lattice network (Circuit Switching) meets Streaming demand using Packet Switching depending on networking technology.Depending on skill of networking Art has flexible, the simple and low price of packet switch, is provided simultaneously with the quality and safety assurance of circuit switching, realizes the whole network friendship Change the seamless connection of formula virtual circuit and data format.
Switching technology (Switching Technology)
Two advantages of asynchronous and packet switch that Ethernet is used depending on networking eliminate Ethernet under the premise of complete compatible and lack It falls into, has the end-to-end seamless connection of the whole network, direct user terminal, directly carrying IP data packet.User data is in network-wide basis It is not required to any format conversion.It is the more advanced form of Ethernet depending on networking, is a real-time exchange platform, can be realized at present mutually The whole network large-scale high-definition realtime video transmission that networking cannot achieve pushes numerous network video applications to high Qinghua, unitizes.
Server technology (Server Technology)
It is different from traditional server, its Streaming Media depending on the server technology in networking and unified video platform Transmission be built upon it is connection-oriented on the basis of, data-handling capacity is unrelated with flow, communication time, single network layer energy Enough transmitted comprising signaling and data.For voice and video business, handled depending on networking and unified video platform Streaming Media Complexity many simpler than data processing, efficiency substantially increase hundred times or more than traditional server.
Reservoir technology (Storage Technology)
The ultrahigh speed reservoir technology of unified video platform in order to adapt to the media content of vast capacity and super-flow and Using state-of-the-art real time operating system, the programme information in server instruction is mapped to specific hard drive space, media Content is no longer pass through server, and moment is directly delivered to user terminal, and user waits typical time less than 0.2 second.It optimizes Sector distribution greatly reduces the mechanical movement of hard disc magnetic head tracking, and resource consumption only accounts for the 20% of the internet ad eundem IP, but The concurrent flow greater than 3 times of traditional disk array is generated, overall efficiency promotes 10 times or more.
Network security technology (Network Security Technology)
Depending on the structural design networked by servicing independent licence system, equipment and the modes such as user data is completely isolated every time The network security problem that puzzlement internet has thoroughly been eradicated from structure, does not need antivirus applet, firewall generally, has prevented black The attack of visitor and virus, structural carefree secure network is provided for user.
It services innovative technology (Service Innovation Technology)
Business and transmission are fused together by unified video platform, whether single user, private user or a net The sum total of network is all only primary automatic connection.User terminal, set-top box or PC are attached directly to unified video platform, obtain rich The multimedia video service of rich colorful various forms.Unified video platform is traditional to substitute with table schema using " menu type " Complicated applications programming, considerably less code, which can be used, can be realized complicated application, realize the new business innovation of " endless ".
Networking depending on networking is as described below:
It is a kind of central controlled network structure depending on networking, which can be Tree Network, Star network, ring network etc. class Type, but centralized control node is needed to control whole network in network on this basis.
As shown in Figure 1, being divided into access net and Metropolitan Area Network (MAN) two parts depending on networking.
The equipment of access mesh portions can be mainly divided into 3 classes: node server, access switch, terminal (including various machines Top box, encoding board, memory etc.).Node server is connected with access switch, and access switch can be with multiple terminal phases Even, and it can connect Ethernet.
Wherein, node server is the node that centralized control functions are played in access net, can control access switch and terminal. Node server can directly be connected with access switch, can also directly be connected with terminal.
Similar, the equipment of metropolitan area mesh portions can also be divided into 3 classes: metropolitan area server, node switch, node serve Device.Metropolitan area server is connected with node switch, and node switch can be connected with multiple node servers.
Wherein, node server is the node server for accessing mesh portions, i.e. node server had both belonged to access wet end Point, and belong to metropolitan area mesh portions.
Metropolitan area server is the node that centralized control functions are played in Metropolitan Area Network (MAN), can control node switch and node serve Device.Metropolitan area server can be directly connected to node switch, can also be directly connected to node server.
It can be seen that be entirely a kind of central controlled network structure of layering depending on networking network, and node server and metropolitan area The network controlled under server can be the various structures such as tree-shaped, star-like, cyclic annular.
Visually claim, access mesh portions can form unified video platform (part in virtual coil), and multiple unified videos are flat Platform can form view networking;Each unified video platform can be interconnected by metropolitan area and wide area depending on networking.
Classify depending on networked devices
1.1 embodiment of the present invention can be mainly divided into 3 classes: server depending on the equipment in networking, interchanger (including ether Net association turns gateway), terminal (including various set-top boxes, encoding board, memory etc.).Metropolitan Area Network (MAN) can be divided on the whole depending on networking (or national net, World Wide Web etc.) and access net.
1.2 equipment for wherein accessing mesh portions can be mainly divided into 3 classes: node server, access switch (including ether Net association turns gateway), terminal (including various set-top boxes, encoding board, memory etc.).
The specific hardware structure of each access network equipment are as follows:
Node server:
As shown in Fig. 2, mainly including Network Interface Module 201, switching engine module 202, CPU module 203, disk array Module 204;
Wherein, Network Interface Module 201, the Bao Jun that CPU module 203, disk array module 204 are come in enter switching engine Module 202;Switching engine module 202 look into the operation of address table 205 to the packet come in, to obtain the navigation information of packet; And the packet is stored according to the navigation information of packet the queue of corresponding pack buffer 206;If the queue of pack buffer 206 is close It is full, then it abandons;All pack buffer queues of 202 poll of switching engine module, are forwarded: 1) end if meeting the following conditions It is less than that mouth sends caching;2) the queue package counting facility is greater than zero.Disk array module 204 mainly realizes the control to hard disk, packet Include the operation such as initialization, read-write to hard disk;CPU module 203 be mainly responsible for access switch, terminal (not shown) it Between protocol processes, to address table 205 (including descending protocol packet address table, uplink protocol package address table, data packet addressed table) Configuration, and, the configuration to disk array module 204.
Access switch:
As shown in figure 3, mainly including Network Interface Module (downstream network interface module 301, uplink network interface module 302), switching engine module 303 and CPU module 304;
Wherein, the packet (upstream data) that downstream network interface module 301 is come in enters packet detection module 305;Packet detection mould Whether mesh way address (DA), source address (SA), type of data packet and the packet length of the detection packet of block 305 meet the requirements, if met, It then distributes corresponding flow identifier (stream-id), and enters switching engine module 303, otherwise abandon;Uplink network interface mould The packet (downlink data) that block 302 is come in enters switching engine module 303;The data packet that CPU module 304 is come in enters switching engine Module 303;Switching engine module 303 look into the operation of address table 306 to the packet come in, to obtain the navigation information of packet; If the packet into switching engine module 303 is that downstream network interface is gone toward uplink network interface, in conjunction with flow identifier (stream-id) packet is stored in the queue of corresponding pack buffer 307;If the queue of the pack buffer 307 is close full, It abandons;If the packet into switching engine module 303 is not that downstream network interface is gone toward uplink network interface, according to packet Navigation information is stored in the data packet queue of corresponding pack buffer 307;If the queue of the pack buffer 307 is close full, Then abandon.
All pack buffer queues of 303 poll of switching engine module, may include two kinds of situations:
If the queue is that downstream network interface is gone toward uplink network interface, meets the following conditions and be forwarded: 1) It is less than that the port sends caching;2) the queue package counting facility is greater than zero;3) token that rate control module generates is obtained;
If the queue is not that downstream network interface is gone toward uplink network interface, meets the following conditions and is forwarded: 1) it is less than to send caching for the port;2) the queue package counting facility is greater than zero.
Rate control module 308 is configured by CPU module 304, to all downlink networks in programmable interval Interface generates token toward the pack buffer queue that uplink network interface is gone, to control the code rate of forwarded upstream.
CPU module 304 is mainly responsible for the protocol processes between node server, the configuration to address table 306, and, Configuration to rate control module 308.
Ethernet association turns gateway:
As shown in figure 4, mainly including Network Interface Module (downstream network interface module 401, uplink network interface module 402), switching engine module 403, CPU module 404, packet detection module 405, rate control module 408, address table 406, Bao Huan Storage 407 and MAC adding module 409, MAC removing module 410.
Wherein, the data packet that downstream network interface module 401 is come in enters packet detection module 405;Packet detection module 405 is examined Ethernet mac DA, ethernet mac SA, Ethernet length or frame type, the view networking mesh way address of measured data packet DA, whether meet the requirements depending on networking source address SA, depending on networking data Packet type and packet length, corresponding stream is distributed if meeting Identifier (stream-id);Then, MAC DA, MAC SA, length or frame type are subtracted by MAC removing module 410 (2byte), and enter corresponding receive and cache, otherwise abandon;
Downstream network interface module 401 detects the transmission caching of the port, according to the view of packet networking mesh if there is Bao Ze Address D A knows the ethernet mac DA of corresponding terminal, adds the ethernet mac DA of terminal, Ethernet assists the MAC for turning gateway SA, Ethernet length or frame type, and send.
The function that Ethernet association turns other modules in gateway is similar with access switch.
Terminal:
It mainly include Network Interface Module, Service Processing Module and CPU module;For example, set-top box mainly connects including network Mouth mold block, video/audio encoding and decoding engine modules, CPU module;Encoding board mainly includes Network Interface Module, video encoding engine Module, CPU module;Memory mainly includes Network Interface Module, CPU module and disk array module.
The equipment of 1.3 metropolitan area mesh portions can be mainly divided into 2 classes: node server, node switch, metropolitan area server. Wherein, node switch mainly includes Network Interface Module, switching engine module and CPU module;Metropolitan area server mainly includes Network Interface Module, switching engine module and CPU module are constituted.
2, networking data package definition is regarded
2.1 access network data package definitions
Access net data packet mainly include following sections: destination address (DA), source address (SA), reserve bytes, payload(PDU)、CRC。
As shown in the table, the data packet for accessing net mainly includes following sections:
DA SA Reserved Payload CRC
Wherein:
Destination address (DA) is made of 8 bytes (byte), and first character section indicates type (such as the various associations of data packet Discuss packet, multicast packet, unicast packet etc.), be up to 256 kinds of possibility, the second byte to the 6th byte is metropolitan area net address, Seven, the 8th bytes are access net address;
Source address (SA) is also to be made of 8 bytes (byte), is defined identical as destination address (DA);
Reserve bytes are made of 2 bytes;
The part payload has different length according to the type of different datagrams, is if it is various protocol packages 64 bytes are 32+1024=1056 bytes if it is single group unicast packets words, are not restricted to above 2 kinds certainly;
CRC is made of 4 bytes, and calculation method follows the Ethernet CRC algorithm of standard.
2.2 Metropolitan Area Network (MAN) packet definitions
The topology of Metropolitan Area Network (MAN) is pattern, may there is 2 kinds, connection even of more than two kinds, i.e. node switching between two equipment It can all can exceed that 2 kinds between machine and node server, node switch and node switch, node switch and node server Connection.But the metropolitan area net address of metropolitan area network equipment is uniquely, to close to accurately describe the connection between metropolitan area network equipment System, introduces parameter in embodiments of the present invention: label, uniquely to describe a metropolitan area network equipment.
(Multi-Protocol Label Switch, multiprotocol label are handed over by the definition of label and MPLS in this specification Change) label definition it is similar, it is assumed that between equipment A and equipment B there are two connection, then data packet from equipment A to equipment B just There are 2 labels, data packet also there are 2 labels from equipment B to equipment A.Label is divided into label, outgoing label, it is assumed that data packet enters The label (entering label) of equipment A is 0x0000, and the label (outgoing label) when this data packet leaves equipment A may reform into 0x0001.The networking process of Metropolitan Area Network (MAN) is to enter network process under centralized control, also means that address distribution, the label of Metropolitan Area Network (MAN) Distribution be all to be dominated by metropolitan area server, node switch, node server be all passively execute, this point with The label distribution of MPLS is different, and the distribution of the label of MPLS is the result that interchanger, server are negotiated mutually.
As shown in the table, the data packet of Metropolitan Area Network (MAN) mainly includes following sections:
DA SA Reserved Label Payload CRC
That is destination address (DA), source address (SA), reserve bytes (Reserved), label, payload (PDU), CRC.Its In, the format of label, which can refer to, such as gives a definition: label is 32bit, wherein high 16bit retains, only with low 16bit, its position Set is between the reserve bytes and payload of data packet.
Data query method disclosed by the invention can be applied in view networking, depending on may include terminal and backstage in networking Server, terminal and background server communication connection.Data query method disclosed by the invention is a kind of associative search mode, It goes to match corresponding result set according to certain atom collection.In data source, for wanting to obtain target value, from search key Minimum cargo tracer place value starts, and obtains result set, and on the basis of the result set that upper primary inquiry obtains, successively inverted order is passed Increase Query Value to scan for, gradually simplify query results, final reverse screening obtains target value.
It is a kind of step flow chart of data query method of the embodiment of the present invention with reference to Fig. 5, the method may include Following steps:
Step S501 receives the search key that the terminal is sent.
Step S502 is decomposed to obtain the first Query Value for described search keyword, wherein first Query Value For the minimum unit value of described search keyword.
Search key can be user and be input to terminal, and terminal is then forwarded to background server.Background server exists After receiving search key, search key is decomposed, then extracts the first Query Value.The magnitude of first Query Value is The minimum unit value of search key.For example, the search key of user's input is " video conference ", then background server is to searching Rope keyword is decomposed, and respectively obtains view, frequency, meeting, the Query Value for discussing 4 minimum unit values, then one of them is as the One Query Value.When background server scans in data source according to the first Query Value, with the first inquiry of minimum unit value Matching is compared in value, and required calculation amount is smaller, can effectively promote the speed of data search.
Step S503 scans for obtaining the first result set according to first Query Value, and by first result set It is sent to the terminal, so that the first result set described in the terminal display.
In data source, scanned for obtaining the first result set in data source according to the first Query Value.For example, search is closed Keyword is " video conference ", and server extracts " depending on " as the first Query Value, according to " depending on " after being decomposed " video conference " Scan in data source, may include in the first result set searched for: so-and-so video, so-and-so videograph, so-and-so Video conference, video, video conference record, video conferencing record, video conference etc. include the result of " depending on " word.
It is scanned for according to the minimum unit value of search key, can search for obtain comprising more relevant search contents Result set, for example, above-mentioned video conferencing records.And the first result set that search obtains is sent to terminal, passes through terminal Search result more abundant is showed into user, promotes the usage experience of user.
Step S504, receive that the terminal sends continues searching request, wherein described to continue searching request be the end When end does not obtain search target according to first result set judgement, what Xiang Suoshu background server was sent.
Terminal judges search target whether is obtained in the first result set after showing the first result set, and is not obtaining Request is continued searching to background server transmission to when searching for target.
It should be noted that can judge whether obtain search target in the first result set using various ways.One In kind judgment mode, the operation of active user can be intended to continue searching request to determine whether sending by terminal, for example, If user ceaselessly stirs, browser interface, do not stopped in some page but, terminal can think user the of current presentation It does not search to obtain search target in one result set, continues searching request to background server transmission.In another judgment mode, It can also decide whether to send depending on the user's operation and continue searching request, for example, if the first knot that user shows in browsing It when the first page of fruit collection, just wants to continue searching for, button can be continued searching by clicking, send out terminal to background server It send and continues searching request.
Outside divided by upper type, the judgement of terminal and the operation of user can also be combined, to decide whether to take to backstage Business device transmission continues searching request, continues for example, terminal can be sent in the case where meeting the following conditions to background server Searching request:
1, user sends after browser interface preset time and continues searching request, and preset time can be set according to demand, For example, any time in 15-20S.
2, whether terminal recognition current presentation interface jumps.If the interface of current presentation is jumped, i.e., it is believed that User is interested in some search result in the first result set, at this point, not continuing searching request to background server transmission.
3, background server judgement is preferential, subject to user's operation.When background server is judged to need to continue searching, to User interface sends the click interface for whether continuing searching request, only in the case where user agrees to send and continues searching request, Just request is continued searching to background server transmission.
In this embodiment, it is preferred that the third above-mentioned mode can be used, i.e., backstage judges preferential that user's operation is Standard can effectively promote the usage experience of user.
Step S505, judges whether the first result in first result set is greater than pre-set level.
Step S506 carries out described search keyword in the case where first result is greater than the pre-set level Decomposition obtains the second Query Value, wherein the unit value of second Query Value is greater than the unit value of first Query Value.
Specifically, background server judges the first result in the first result set after receiving and continuing searching request Whether quantity is greater than pre-set level, wherein pre-set level can be configured according to the actual situation.For example, pre-set level can be with It is 1,10 or 20.When pre-set level is 1, when indicating that the quantity of the first result in the first result set is greater than 1, to search Keyword is decomposed to obtain the second Query Value;When pre-set level is 10, the number of the first result in the first result set is indicated When amount is greater than 10, search key is decomposed to obtain the second Query Value;It is similar when correspondingly, greater than 20, it is no longer superfluous It states.When specific setting, the quantity that the size of pre-set level can be the search result shown according to terminal current interface is set It sets.And the difference of the size according to the displaying interface of terminal, the search result quantity for showing that interface can be shown are different, because This, in this embodiment, it is preferred that, 1 can be set by pre-set level, under different size of terminal display interface, all It can be that user brings friendly usage experience.
Step S507 is scanned in first result set according to second Query Value, and is obtained the second result Collection.
Second result set is sent to the terminal by step S508, so that the second result described in the terminal display Collection.
After decomposing to obtain the second Query Value to search key, scanned in the upper result set once searched for. The unit value of second Query Value is greater than the unit value of the first Query Value, and compared to the first Query Value, matching condition when search is mentioned Rise, and scanned in the first result set, the data that when search compares, be all search for the first time obtain with the first inquiry It is worth relevant content, therefore, even if the unit value of Query Value increases, improves matching condition, also can complete to fast accurate Search.
It after obtaining the second result set, also needs the second result set being sent to terminal, by terminal by the second result Collection shows user.
It should be noted that after the second result set shows user, if continue searching request to background server transmission Judgment mode and the above-mentioned type that illustrates to step S504, related place is referring to above description, and details are not described herein again.It can To understand, if not obtaining search target in the second result set, it is also necessary to continue to send searching request, backstage to background server Server is decomposed to obtain third Query Value to search key according to continuing searching request, and according to third Query Value the Third time search is carried out in two result sets.
Step S509 stops search, wherein the terminal when stopping search of receiving that the terminal sends is requested Judged whether to obtain search target according to second result set, when obtaining described search target, Xiang Suoshu server is sent Stop search request, when not obtaining described search target, continues searching request described in the transmission of Xiang Suoshu background server, until Until the terminal obtains described search target according to the result set received.
In the present embodiment, search key is decomposed to obtain Query Value scan for be a circulation process, The unit value of the Query Value decomposed each time is all greater than the unit value of the last Query Value for decomposing and obtaining;Meanwhile often Primary search is all in the result set that upper primary search obtains in addition to search is scanned in data source for the first time It scans for.
It should be noted that the condition that background server stops search, except the request that stops search for receiving terminal transmission In addition, it can also stop search for when the fruiting quantities in result set are less than pre-set level.
In embodiments of the present invention, background server is divided by the search key sent to the terminal received Solution, obtains the first Query Value, carries out search for the first time according to the first Query Value and obtains the first result set, and be sent to terminal, eventually End continues searching request to background server transmission when needing to continue searching.Background server, which receives, continues searching request Afterwards, search key is decomposed again, obtains the second Query Value, and carry out in the first result set according to the second Query Value Search obtains the second result set, and the second result set is then sent to terminal.It is recycled with this, until being searched in result set Target.
It is searched for since the first Query Value of the minimum unit value with search key, when carrying out match query, because The unit value of minimum unit value is minimum, and required calculation amount is smaller when single is matched, to reduce whole search matching institute The calculation amount needed is effectively prevented from and seemingly-dead phenomenon occurs, promotes search speed.Meanwhile search key is split, for The match query of data source can value maximum result, reverse reduction result set is successively carried out on the basis of maximum result Size, finally accurately obtain search target, can be effectively avoided omit relevant search content.
Optionally, in an embodiment of the present invention, it is decomposed to obtain the first Query Value for described search keyword Step may include:
Described search keyword is decomposed, extracts the first word of described search keyword as the first Query Value.It is right In the decomposition of search key, decomposed according to minimum unit value, wherein minimum unit value can be according to actual search Demand is set, for example, being in the present embodiment single character, in some other possible embodiment, or word Group.
In the present embodiment, after decomposing to search key, according to sequence from left to right, the head of search key is extracted Position word is as the first Query Value.It should be understood that, according to the difference of setting, extracting mode can also in some other embodiment With difference, for example, can successively extract from right to left, can also be extracted since the intermediate character of search key.
Optionally, is decomposed to described search keyword the step of obtaining the second Query Value, comprising:
Described search keyword is decomposed to obtain the adjacent keyword of first Query Value, is looked into according to described first Inquiry value and the adjacent keyword obtain second Query Value.Adjacent keyword can be left adjacent keyword, be also possible to the right side Adjacent keyword is also possible to left adjacent keyword and right adjacent keyword.Different according to the mode for extracting the first Query Value, decomposition obtains Adjacent keyword it is also different, for example, successively extracting Query Value from left to right, the second Query Value is exactly the first Query Value and right neighbour Crucial combinatorics on words;Query Value is extracted since centre, the second Query Value can be the first Query Value pass adjacent with left and right Key combinatorics on words.It should be noted that even if the first Query Value is extracted since the centre of search key, it can also be independent The left adjacent keyword or right adjacent keyword for selecting the first Query Value are combined as the second Query Value.
It is a kind of a kind of implementation flow chart of data query method of the embodiment of the present invention with reference to Fig. 6.For the ease of reason Solution, can be with reference to the specific implementation process below for carrying out search process twice, comprising:
Step S601, user input search key by terminal, and search key is sent to background server by terminal;
Step S602, background server decompose search key to obtain the first Query Value;
Step S603, background server carry out first time search according to the first Query Value in data source;
Step S604, background server obtain the first result set of result searched for for the first time;
First result set is sent to terminal by step S605, background server;
Step S606, terminal judge search target whether is obtained in the first result set, are that this search terminates;It is no, into Enter step S607;
Step S607, terminal continue searching request to background server transmission, and background server is requested according to continuing searching It continues searching;
Step S608, background server continue searching, and carry out second to search key and decompose, obtain the second inquiry Value;
Step S609, background server carry out second in the first result set according to the second Query Value and search for;
Step S610, background server obtain the second result set of result of second of search;
Second result set is sent to terminal by step S611, background server;
Step S612, terminal obtain search target in the second result set, and search terminates.
It should be noted that above-mentioned process only illustrates the process judged twice, in practical application, may hold The more searching times of row, for example, background server can decompose search key to obtain third when being searched for three times Query Value, and scanned for obtaining third result set in the second result set according to third Query Value.The side of subsequent decomposition search Formula is similar, and details are not described herein again.
It is a kind of a kind of flow chart of steps of data query method of the embodiment of the present invention with reference to Fig. 7.Of the invention one In kind embodiment, the data query method can also include:
Step S701 establishes described search keyword and obtains the corresponding relationship of the objective result collection of described search target, And by described search keyword and objective result collection storage into historical data base.
It, can be by search key pass corresponding with the search objective result collection foundation of target is obtained after obtaining search target It is and is saved in historical data base.Obtain the result set of search target, it may be possible to which primary search just obtains, it is also possible to pass through It is obtained after carrying out multiple decomposition query to search key.It is understood that finally obtain in the result set of search target, it can There can be certain recommendation meaning therefore to build the search target of user comprising search result similar with search target It founds search key and obtains the corresponding relationship of objective result collection, and be saved in historical data base, to facilitate subsequent searched Rope.
Step S702 judges whether there is objective result corresponding with described search keyword in the historical data base Collection, when with corresponding objective result collection, is sent to the terminal for the objective result collection.
It, can be direct after judging that there is objective result collection corresponding with current search keyword in historical data base The objective result collection is sent to terminal, to promote search efficiency.Because the resource in historical data base is searched according to history Hitch fruit is updated, and the real-time update speed compared to data source will be to lag, therefore, if terminal is showing objective result After collection, it is still desirable to when continuing searching, searching request can be sent to background server by terminal, background server receives After searching request, then search key decompose and extracts the first Query Value, scanned for for data source, to be mentioned for user For accurately search service.
In the present embodiment, background server is decomposed by the search key sent to the terminal received, is obtained To the first Query Value, search for the first time is carried out according to the first Query Value and obtains the first result set, and be sent to terminal, terminal is needing Request is continued searching to background server transmission when continuing searching.Background server receives continue searching request after, again Search key is decomposed, obtains the second Query Value, and scan in the first result set according to the second Query Value To the second result set, the second result set is then sent to terminal.It is recycled with this, until obtaining search target in result set.
It is searched for since the first Query Value of the minimum unit value with search key, when carrying out match query, because The unit value of minimum unit value is minimum, and required calculation amount is smaller when single is matched, to reduce whole search matching institute The calculation amount needed is effectively prevented from and seemingly-dead phenomenon occurs, promotes search speed.Meanwhile search key is split, for The match query of data source can value maximum result, reverse reduction result set is successively carried out on the basis of maximum result Size, finally accurately obtain search target, can be effectively avoided omit relevant search content.
It should be noted that for simple description, therefore, it is stated as a series of action groups for embodiment of the method It closes, but those skilled in the art should understand that, embodiment of that present invention are not limited by the describe sequence of actions, because according to According to the embodiment of the present invention, some steps may be performed in other sequences or simultaneously.Secondly, those skilled in the art also should Know, the embodiments described in the specification are all preferred embodiments, and the related movement not necessarily present invention is implemented Necessary to example.
It is a kind of structural schematic diagram of data query device embodiment of the embodiment of the present invention with reference to Fig. 8.Described device is answered For background server, the background server and terminal are communicated to connect, and described device includes:
Receiving module 801, the search key sent for receiving the terminal;
Decomposing module 802, for being decomposed to obtain the first Query Value for described search keyword, wherein described the One Query Value is the minimum unit value of described search keyword;
Enquiry module 803, for scanning for obtaining the first result set according to first Query Value, and by described first Result set is sent to the terminal, so that the first result set described in the terminal display;
The receiving module 801, be also used to receive the terminal transmission continues searching request, wherein described to continue to search When rope asks terminal described in Seeking Truth not obtain search target according to first result set judgement, Xiang Suoshu background server is sent 's;
First judgment module 804, for judging whether the first result in first result set is greater than pre-set level;
The decomposing module 802 is also used to search in the case where first result is greater than the pre-set level to described Rope keyword is decomposed to obtain the second Query Value, wherein the unit value of second Query Value is greater than first Query Value Unit value;
The enquiry module 803 is also used to be scanned in first result set according to second Query Value, and Obtain the second result set;
Sending module 805, for second result set to be sent to the terminal, so that described in the terminal display Two result sets;
Stopping modular 806, for stopping search, wherein institute when stopping search of receiving that the terminal sends is requested It states terminal to be judged whether to obtain search target according to second result set, when obtaining described search target, to the service Device sends the request that stops search, and when not obtaining described search target, continues searching and asks described in the transmission of Xiang Suoshu background server It asks, until the terminal obtains described search target according to the result set received.
Optionally, the decomposing module includes:
First decomposes submodule, for decomposing to described search keyword, extracts the first place of described search keyword Word is as the first Query Value.
Optionally, the decomposing module further include:
Second decomposes submodule, obtains the adjacent pass of first Query Value for being decomposed to described search keyword Key word obtains second Query Value according to first Query Value and the adjacent keyword.
Optionally, described device further include:
Creation module, the corresponding of objective result collection for establishing described search keyword and obtain described search target are closed System, and by described search keyword and objective result collection storage into historical data base.
Optionally, described device further include:
Second judgment module, for judging whether there is mesh corresponding with described search keyword in the historical data base The objective result collection is sent to the terminal when with corresponding objective result collection by mark result set.
For data query device embodiment, since it is substantially similar to data query embodiment of the method, so retouching That states is fairly simple, and related place illustrates referring to the part of data query embodiment of the method.
The embodiment of the invention also provides a kind of electronic equipment, comprising:
One or more processors;With
One or more machine readable medias of instruction are stored thereon with, are executed when by one or more of processors When, so that the electronic equipment executes the data query method as described in any one of the embodiment of the present invention.
The embodiment of the invention also provides the computer programs of a kind of computer readable storage medium, storage to handle Device executes data query method as described in the embodiments of the present invention.
All the embodiments in this specification are described in a progressive manner, the highlights of each of the examples are with The difference of other embodiments, the same or similar parts between the embodiments can be referred to each other.
It should be understood by those skilled in the art that, the embodiment of the embodiment of the present invention can provide as method, apparatus or calculate Machine program product.Therefore, the embodiment of the present invention can be used complete hardware embodiment, complete software embodiment or combine software and The form of the embodiment of hardware aspect.Moreover, the embodiment of the present invention can be used one or more wherein include computer can With in the computer-usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) of program code The form of the computer program product of implementation.
The embodiment of the present invention be referring to according to the method for the embodiment of the present invention, terminal device (system) and computer program The flowchart and/or the block diagram of product describes.It should be understood that flowchart and/or the block diagram can be realized by computer program instructions In each flow and/or block and flowchart and/or the block diagram in process and/or box combination.It can provide these Computer program instructions are set to general purpose computer, special purpose computer, Embedded Processor or other programmable data processing terminals Standby processor is to generate a machine, so that being held by the processor of computer or other programmable data processing terminal devices Capable instruction generates for realizing in one or more flows of the flowchart and/or one or more blocks of the block diagram The device of specified function.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing terminal devices In computer-readable memory operate in a specific manner, so that instruction stored in the computer readable memory generates packet The manufacture of command device is included, which realizes in one side of one or more flows of the flowchart and/or block diagram The function of being specified in frame or multiple boxes.
These computer program instructions can also be loaded into computer or other programmable data processing terminal devices, so that Series of operation steps are executed on computer or other programmable terminal equipments to generate computer implemented processing, thus The instruction executed on computer or other programmable terminal equipments is provided for realizing in one or more flows of the flowchart And/or in one or more blocks of the block diagram specify function the step of.
Although the preferred embodiment of the embodiment of the present invention has been described, once a person skilled in the art knows bases This creative concept, then additional changes and modifications can be made to these embodiments.So the following claims are intended to be interpreted as Including preferred embodiment and fall into all change and modification of range of embodiment of the invention.
Finally, it is to be noted that, herein, relational terms such as first and second and the like be used merely to by One entity or operation are distinguished with another entity or operation, without necessarily requiring or implying these entities or operation Between there are any actual relationship or orders.Moreover, the terms "include", "comprise" or its any other variant meaning Covering non-exclusive inclusion, so that process, method, article or terminal device including a series of elements not only wrap Those elements are included, but also including other elements that are not explicitly listed, or further includes for this process, method, article Or the element that terminal device is intrinsic.In the absence of more restrictions, being wanted by what sentence "including a ..." limited Element, it is not excluded that there is also other identical elements in process, method, article or the terminal device for including the element.
Above to a kind of data query method, apparatus provided by the present invention, electronic equipment and readable storage medium storing program for executing into It has gone and has been discussed in detail, used herein a specific example illustrates the principle and implementation of the invention, the above implementation The explanation of example is merely used to help understand method and its core concept of the invention;Meanwhile for the general technology people of this field Member, according to the thought of the present invention, there will be changes in the specific implementation manner and application range, in conclusion this explanation Book content should not be construed as limiting the invention.

Claims (12)

1. a kind of data query method, which is characterized in that the method is applied to background server, the background server and end End communication connection, which comprises
Receive the search key that the terminal is sent;
It is decomposed to obtain the first Query Value for described search keyword, wherein first Query Value is described search pass The minimum unit value of keyword;
It is scanned for obtaining the first result set according to first Query Value, and first result set is sent to the end End, so that the first result set described in the terminal display;
Receive that the terminal sends continues searching request, wherein described to continue searching request be the terminal according to described the When the judgement of one result set does not obtain search target, what Xiang Suoshu background server was sent;
Judge whether the first result in first result set is greater than pre-set level;
In the case where first result is greater than the pre-set level, described search keyword is decomposed to obtain second and is looked into Inquiry value, wherein the unit value of second Query Value is greater than the unit value of first Query Value;
It is scanned in first result set according to second Query Value, and obtains the second result set;
Second result set is sent to the terminal, so that the second result set described in the terminal display;
When stopping search of receiving that the terminal sends is requested, stop search, wherein the terminal is according to second knot Fruit collection judges whether to obtain search target, and when obtaining described search target, Xiang Suoshu server sends the request that stops search, In When not obtaining described search target, Xiang Suoshu background server send described in continue searching request, until the terminal is according to connecing Until the result set received obtains described search target.
2. the method according to claim 1, wherein described decomposed to obtain for described search keyword The step of one Query Value, comprising:
Described search keyword is decomposed, extracts the first word of described search keyword as the first Query Value.
3. the method according to claim 1, wherein described decomposed to obtain second to described search keyword The step of Query Value, comprising:
Described search keyword is decomposed to obtain the adjacent keyword of first Query Value, according to first Query Value Second Query Value is obtained with the adjacent keyword.
4. the method according to claim 1, wherein the method also includes:
It establishes described search keyword and obtains the corresponding relationship of the objective result collection of described search target, and described search is closed Keyword and objective result collection storage are into historical data base.
5. according to the method described in claim 4, it is characterized in that, the method also includes:
Judge whether there is objective result collection corresponding with described search keyword in the historical data base, with corresponding When objective result collection, the objective result collection is sent to the terminal.
6. a kind of data query device, which is characterized in that described device is applied to background server, the background server and end End communication connection, described device include:
Receiving module, the search key sent for receiving the terminal;
Decomposing module, for being decomposed to obtain the first Query Value for described search keyword, wherein first Query Value For the minimum unit value of described search keyword;
Enquiry module, for scanning for obtaining the first result set according to first Query Value, and by first result set It is sent to the terminal, so that the first result set described in the terminal display;
The receiving module, is also used to receive that the terminal sends continues searching request, wherein described to continue searching request and be When the terminal does not obtain search target according to first result set judgement, what Xiang Suoshu background server was sent;
First judgment module, for judging whether the first result in first result set is greater than pre-set level;
The decomposing module is also used in the case where first result is greater than the pre-set level, to described search key Word is decomposed to obtain the second Query Value, wherein the unit value of second Query Value is greater than the unit of first Query Value Value;
The enquiry module is also used to be scanned in first result set according to second Query Value, and obtains Two result sets;
Sending module, for second result set to be sent to the terminal, so that the second result described in the terminal display Collection;
Stopping modular, for stopping search, wherein the terminal when stopping search of receiving that the terminal sends is requested Judged whether to obtain search target according to second result set, when obtaining described search target, Xiang Suoshu server is sent Stop search request, when not obtaining described search target, continues searching request described in the transmission of Xiang Suoshu background server, until Until the terminal obtains described search target according to the result set received.
7. device according to claim 6, which is characterized in that the decomposing module includes:
First decomposes submodule, and for decomposing to described search keyword, the first word for extracting described search keyword is made For the first Query Value.
8. device according to claim 6, which is characterized in that the decomposing module further include:
Second decomposes submodule, obtains the adjacent key of first Query Value for being decomposed to described search keyword Word obtains second Query Value according to first Query Value and the adjacent keyword.
9. device according to claim 6, which is characterized in that described device further include:
Creation module, for establishing the corresponding relationship of described search keyword with the objective result collection for obtaining described search target, And by described search keyword and objective result collection storage into historical data base.
10. device according to claim 9, which is characterized in that described device further include:
Second judgment module, for judging whether there is target knot corresponding with described search keyword in the historical data base Fruit collection, when with corresponding objective result collection, is sent to the terminal for the objective result collection.
11. a kind of electronic equipment characterized by comprising
One or more processors;With
One or more machine readable medias of instruction are stored thereon with, when being executed by one or more of processors, are made Obtain data query method of the electronic equipment execution as described in claim 1 to 5 any one.
12. a kind of computer readable storage medium, which is characterized in that its computer program stored executes processor as weighed Benefit requires data query method described in 1 to 5 any one.
CN201910662741.9A 2019-07-22 2019-07-22 Data query method and device, electronic equipment and readable storage medium Active CN110516141B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910662741.9A CN110516141B (en) 2019-07-22 2019-07-22 Data query method and device, electronic equipment and readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910662741.9A CN110516141B (en) 2019-07-22 2019-07-22 Data query method and device, electronic equipment and readable storage medium

Publications (2)

Publication Number Publication Date
CN110516141A true CN110516141A (en) 2019-11-29
CN110516141B CN110516141B (en) 2022-08-30

Family

ID=68622731

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910662741.9A Active CN110516141B (en) 2019-07-22 2019-07-22 Data query method and device, electronic equipment and readable storage medium

Country Status (1)

Country Link
CN (1) CN110516141B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112650775A (en) * 2020-12-30 2021-04-13 深圳云天励飞技术股份有限公司 Data searching method and device, electronic equipment and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101963965A (en) * 2009-07-23 2011-02-02 阿里巴巴集团控股有限公司 Document indexing method, data query method and server based on search engine
CN102479207A (en) * 2010-11-29 2012-05-30 阿里巴巴集团控股有限公司 Information search method, system and device
US20170242934A1 (en) * 2011-11-16 2017-08-24 Ptc Inc. Methods for integrating semantic search, query, and analysis and devices thereof

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101963965A (en) * 2009-07-23 2011-02-02 阿里巴巴集团控股有限公司 Document indexing method, data query method and server based on search engine
CN102479207A (en) * 2010-11-29 2012-05-30 阿里巴巴集团控股有限公司 Information search method, system and device
US20170242934A1 (en) * 2011-11-16 2017-08-24 Ptc Inc. Methods for integrating semantic search, query, and analysis and devices thereof

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112650775A (en) * 2020-12-30 2021-04-13 深圳云天励飞技术股份有限公司 Data searching method and device, electronic equipment and storage medium
CN112650775B (en) * 2020-12-30 2024-01-05 深圳云天励飞技术股份有限公司 Data searching method and device, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN110516141B (en) 2022-08-30

Similar Documents

Publication Publication Date Title
CN108234396A (en) A kind of method and device of monitoring device status information real-time synchronization
CN108965912B (en) A kind of method, client and the server of video data processing
CN109348171A (en) A kind of view networking monitoring video acquiring method and device
CN108234816A (en) The method and device of resource information real-time synchronization is monitored between a kind of monitoring device
CN108012106A (en) A kind of method and system regarding networking monitoring source synchronous
CN109672856A (en) Resource synchronization method and device
CN109302451A (en) A kind of methods of exhibiting and system of picture file
CN108574818A (en) A kind of method, apparatus and server of presentation of information
CN109379254A (en) A kind of detection method and system of the network connection based on video conference
CN109286826A (en) Information display method and device
CN109714604A (en) A kind of processing method and system regarding networking data
CN109660753A (en) Resource synchronization method and device
CN109040656A (en) A kind of processing method and system of video conference
CN109284265A (en) A kind of date storage method and system
CN110502548A (en) A kind of search result recommended method, device and computer readable storage medium
CN110046222A (en) A kind of intelligent answer method and system
CN109936563A (en) A kind of data processing method and device of simultaneous interpretation
CN109005378A (en) A kind of processing method and system of video conference
CN109525663A (en) A kind of methods of exhibiting and system of video data
CN109802952A (en) Monitoring data synchronous method and device
CN110430168A (en) A kind of method and apparatus of data compression
CN110516141A (en) Data query method, apparatus, electronic equipment and readable storage medium storing program for executing
CN110134892A (en) A kind of loading method and system monitoring the Resources list
CN110012316A (en) A kind of processing method and processing device regarding networking service
CN109963107A (en) A kind of display methods and system of audio, video data

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant