CN112784139B - Query method, device, electronic equipment and computer readable medium - Google Patents
Query method, device, electronic equipment and computer readable medium Download PDFInfo
- Publication number
- CN112784139B CN112784139B CN202110045126.0A CN202110045126A CN112784139B CN 112784139 B CN112784139 B CN 112784139B CN 202110045126 A CN202110045126 A CN 202110045126A CN 112784139 B CN112784139 B CN 112784139B
- Authority
- CN
- China
- Prior art keywords
- query
- target
- target data
- sequence
- data sequence
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 48
- 230000004044 response Effects 0.000 claims description 11
- 238000004590 computer program Methods 0.000 claims description 10
- 230000006870 function Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 6
- 239000003550 marker Substances 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 239000000306 component Substances 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000008358 core component Substances 0.000 description 1
- 238000013523 data management Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
- 239000002994 raw material Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Embodiments of the present disclosure disclose a query method, apparatus, electronic device, and computer-readable medium. One embodiment of the method comprises the following steps: acquiring a query request input by a user; determining a first query parameter; determining a target data sequence according to the query request and the first query parameter; and storing the target data sequence and the target attribute information in a cache to obtain the target data sequence in the cache and the target attribute information in the cache. According to the embodiment, the maximum amount of target data included in the target data sequence of the query is limited by generating the first query parameter, repeated query on the same target data sequence is avoided by storing the target data sequence and the target attribute information in the cache, the query speed is improved, the query processing time is saved for a user, and the query pressure of the server is also reduced.
Description
Technical Field
Embodiments of the present disclosure relate to the field of computer technology, and in particular, to a query method, a device, an electronic apparatus, and a computer readable medium.
Background
With the development of the internet industry and the improvement of the internet technology architecture system, the middle platform becomes a core component in the internet enterprise architecture. In the system architecture of the internet industry, the middle platform bears the core business data management function and provides diversified and high-performance data support service systems for business systems or three-party systems. Middle-stage performance stability is critical to the internet enterprise architecture, and threshold limitation or dynamic adaptive limitation is generally carried out on the query mode of the client.
However, when the limitation of the query processing is based on the middle station, there are often the following technical problems:
firstly, the sudden system resource utilization rate is high due to the fact that the client application inquires the middle platform service concurrently, and the client inquiry efficiency is low and user experience is affected in the middle platform with relatively high pressure.
Secondly, the number of times of calling and accessing in unit time of the client is directly limited to a fixed value, so that the normal information acquisition speed is influenced, and the user accessing experience is directly influenced. The method for dynamically setting the times has high implementation cost and complex implementation flow, and also influences the stability of client inquiry and call.
Disclosure of Invention
The disclosure is in part intended to introduce concepts in a simplified form that are further described below in the detailed description. The disclosure is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
Some embodiments of the present disclosure propose a query method, apparatus, electronic device, and computer-readable medium to solve one or more of the technical problems mentioned in the background section above.
In a first aspect, some embodiments of the present disclosure provide a query method, the method comprising: acquiring a query request input by a user; determining a first query parameter; determining a target data sequence according to the query request and the first query parameter; and storing the target data sequence and the target attribute information in a cache to obtain the target data sequence in the cache and the target attribute information in the cache.
In a second aspect, some embodiments of the present disclosure provide a query device, the device comprising: the receiving unit is configured to acquire a query request input by a user; a determining unit configured to determine a first query parameter, wherein the first query parameter refers to a maximum number of target data included in a target data sequence of a query; a generation unit configured to determine a target data sequence according to a query request and the first query parameter; and a storage unit configured to store the target data sequence and the target attribute information in the buffer memory to obtain the target data sequence in the buffer memory and the target attribute information in the buffer memory.
In a third aspect, some embodiments of the present disclosure provide an electronic device comprising: one or more processors; a storage device having one or more programs stored thereon, which when executed by one or more processors, cause the one or more processors to implement the method as in any of the first aspects.
In a fourth aspect, some embodiments of the present disclosure provide a computer readable medium having a computer program stored thereon, wherein the program when executed by a processor implements a method as in any of the first aspects.
The above embodiments of the present disclosure have the following advantages: the query method of some embodiments of the present disclosure can limit the maximum amount of target data included in the target data sequence of the query by generating the first query parameter, and avoid repeated query on the same target data sequence by storing the target data sequence and the target attribute information in the cache, thereby improving the query speed, saving the query processing time for the user, and also reducing the query pressure of the server. In particular, the inventors have found that the inefficiency of client queries in an internet enterprise architecture is caused by: the limitation of the call and access times in unit time of the client affects the query efficiency and user experience, and in addition, too complex query limitation methods cause too high implementation cost. Based on this, first, some embodiments of the present disclosure determine a sequence of storage nodes. Wherein the storage nodes in the sequence of storage nodes store pairs of data comprising data elements and data attribute information. Second, some embodiments of the present disclosure generate a first query parameter limits the maximum amount of target data included in the target data sequence of the query. The number of single queries can be controlled by adding the first query parameter based on the query request. Some embodiments of the present disclosure then determine the number of queries and end-markers. The number of queries and end-markers may be used to control the number of queries that the client invokes, and whether the current query is ended. The problem of simply limiting the number of the query target data is solved by controlling the calling mode of the client. Finally, some embodiments of the present disclosure avoid repeated queries for the same target data sequence by storing the target data sequence and target attribute information in a cache. And in response to the fact that the target attribute information in the query request is the same as the target attribute information in the cache, determining the target data sequence in the cache as the target data sequence without executing the query operation again, and relieving the pressure of the server.
Drawings
The above and other features, advantages, and aspects of embodiments of the present disclosure will become more apparent by reference to the following detailed description when taken in conjunction with the accompanying drawings. The same or similar reference numbers will be used throughout the drawings to refer to the same or like elements. It should be understood that the figures are schematic and that elements and components are not necessarily drawn to scale.
FIG. 1 is an architecture diagram of an exemplary system in which some embodiments of the present disclosure may be applied;
FIG. 2 is a flow chart of some embodiments of a query method according to the present disclosure;
FIG. 3 is a flow chart of some embodiments of a querying device according to some embodiments of the present disclosure;
Fig. 4 is a schematic structural diagram of a terminal device suitable for use in implementing some embodiments of the present disclosure.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete. It should be understood that the drawings and embodiments of the present disclosure are for illustration purposes only and are not intended to limit the scope of the present disclosure.
It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings. Embodiments of the present disclosure and features of embodiments may be combined with each other without conflict.
It should be noted that the terms "first," "second," and the like in this disclosure are merely used to distinguish between different devices, modules, or units and are not used to define an order or interdependence of functions performed by the devices, modules, or units.
It should be noted that references to "one", "a plurality" and "a plurality" in this disclosure are intended to be illustrative rather than limiting, and those of ordinary skill in the art will appreciate that "one or more" is intended to be understood as "one or more" unless the context clearly indicates otherwise.
The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
FIG. 1 illustrates an exemplary system architecture 100 in which embodiments of the query methods of the present disclosure may be applied.
As shown in fig. 1, a system architecture 100 may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 is used as a medium to provide communication links between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
The user may interact with the server 105 via the network 104 using the terminal devices 101, 102, 103 to receive or send messages or the like. Various communication client applications such as an information generation application, an information display application, an information inquiry application, and the like may be installed on the terminal devices 101, 102, 103.
The terminal devices 101, 102, 103 may be hardware or software. When the terminal devices 101, 102, 103 are hardware, they may be various terminal devices with display screens including, but not limited to, smartphones, tablets, laptop and desktop computers, and the like. When the terminal apparatuses 101, 102, 103 are software, they can be installed in the above-listed terminal apparatuses. Which may be implemented as multiple software or software modules (e.g., to provide query request input, etc.), or as a single software or software module. The present invention is not particularly limited herein.
The server 105 may be a server that provides various services, for example, a server that stores a query request input by the terminal devices 101, 102, 103, or the like. The server may process the received query request and feed back the processing result (e.g., the queried target data sequence) to the terminal device.
It should be noted that, the query method provided in the embodiment of the present disclosure may be executed by the server 105 or the terminal device.
It should be noted that, the local server 105 may also directly query the request, and the server 105 may directly extract the local query request and obtain the target data sequence after processing, where the exemplary system architecture 100 may not include the terminal devices 101, 102, 103 and the network 104.
It should also be noted that the query application may also be installed in the terminal devices 101, 102, 103, in which case the processing method may also be performed by the terminal devices 101, 102, 103. At this point, the exemplary system architecture 100 may also not include the server 105 and the network 104.
The server 105 may be hardware or software. When the server 105 is hardware, it may be implemented as a distributed server cluster formed by a plurality of servers, or as a single server. When the server is software, it may be implemented as a plurality of software or software modules (e.g., to provide a query service), or as a single software or software module. The present invention is not particularly limited herein.
It should be understood that the number of terminal devices, networks and servers in fig. 1 is merely illustrative. There may be any number of electronic devices, networks, and servers, as desired for implementation.
With continued reference to fig. 2, a flow 200 of some embodiments of a query method according to the present disclosure is shown. The query method comprises the following steps:
step 201, a query request input by a user is obtained.
In some embodiments, the execution subject of the query method (e.g., the server shown in fig. 1) may obtain the query request through a wired connection or a wireless connection. It should be noted that the wireless connection may include, but is not limited to, 3G/4G connection, wiFi connection, bluetooth connection, wiMAX connection, zigbee connection, UWB (ultra wideband) connection, and other now known or later developed wireless connection.
Optionally, before acquiring the query request input by the user, the method further includes: a sequence of storage nodes is determined. Wherein the sequence of storage nodes comprises a first number of storage nodes, the storage nodes storing data pairs, the data pairs comprising data elements and data attribute information. Specifically, the storage node is used for storing the data pair to be queried by the user. The data pair includes data elements and data attribute information, wherein the data elements can be data, the data is a fact or observed result, a logical generalization of the objective thing, and raw material for representing the objective thing. The data may be represented in the form of binary information units 0, 1. The data attribute information may be used to characterize the data type. Specifically, the data attribute information may include, but is not limited to, one of: name, identification, detailed information.
Optionally, the query request entered by the user includes target attribute information. The target attribute information may be target attribute information in a target data queue stored in a target data sequence of a user query request.
Step 202, a first query parameter is determined.
In some embodiments, the executing entity determines the first query parameter. In particular, the first query parameter may be a maximum number of target data included in a target data sequence queried by the user. Specifically, the first query parameter may be defined as a data grabbing number, and the type of the first query parameter may be a number. The first query parameter may be "2". By setting the first query parameter, the data amount of each query of the executing body can be limited to be 2, so that the user query mode is limited to a small number of times. Specifically, the number of data to be queried is only 2 each time, and after 2 data are queried, the user can initiate a query request again.
Optionally, before determining the first query parameter, determining the target data sequence in the cache as the target data sequence in response to the target attribute information in the query request being the same as the target attribute information in the cache. Specifically, the target data sequence queried by the user can be stored in the cache. And responding to the fact that the target attribute information in the user query request is the same as the target attribute information in the cache, the target data sequence in the user query request can be stored in the cache after being queried, and can be directly searched from the cache, and the target data sequence in the cache is determined to be the target data sequence. Specifically, the buffer may be a buffer area for data exchange, and is a memory capable of performing high-speed data exchange in the execution body.
Step 203, determining a target data sequence according to the query request and the first query parameter.
In some embodiments, the executing entity determines the target data sequence according to the query request and the first query parameter. Optionally, the number of queries and the end marker are determined. Specifically, the number of queries and the first query parameter may be retrieved from the server. The number of queries may be the number of times the query request entered by the user was received. The type of query number may be a number. The end-marker may be a marker that characterizes whether the query for the query request entered by the user ends in the sequence of storage nodes of the execution body (e.g., the server shown in fig. 1) described above. Specifically, in response to the end flag being "1", the query has ended in the sequence of storage nodes for the query request entered by the user. In response to the end flag being "0," the query is not ended in the sequence of storage nodes for the query request entered by the user.
Optionally, in response to the number of queries being 0 and the end flag being 0, performing the following processing steps: and determining a first target storage node sequence according to the query request and the first query parameter. And generating a first target data sequence and a second query parameter according to the first target storage node sequence. The second query parameter is the position of the last first target storage node in the first target storage node sequence. The query number is incremented by 1. Updating the end mark. The first target data sequence is determined as the target data sequence.
In response to the number of queries not being 0 and the end flag being 0, the following processing steps are performed: and determining a second target storage node sequence according to the query request, the first query parameter and the second query parameter. Optionally, an initial second target storage node sequence is generated. Wherein the initial second target storage node sequence is empty. For each storage node in the sequence of storage nodes, matching the target attribute information with the attribute information of the storage node, and in response to the matching being consistent, placing the storage node in the initial second sequence of target storage nodes. And deleting each initial second target storage node positioned before the second query parameter in the initial second target storage node sequence. The initial second target storage node is determined to be a second target storage node sequence. And generating a second target data sequence and a third query parameter according to the second target storage node sequence. The value of the second query parameter is updated to the value of the third query parameter. The query number is incremented by 1. Updating the end mark. The second target data sequence is determined as the target data sequence.
The optional content in steps 201-203 above, namely: the technical content of determining the target data sequence according to the query request and the first query parameter is taken as an invention point of the embodiment of the disclosure, so that the technical problem mentioned in the background art is solved, the number of times of calling and accessing in unit time of the client is directly limited to a fixed value, the normal information acquisition speed is influenced, and the user access experience is directly influenced. The method for dynamically setting the times has high implementation cost and complex implementation flow, and also influences the stability of client inquiry and call. ". Factors that result in poor processing efficiency for the number of calls and accesses being limited tend to be as follows: the number of times of calling and accessing is directly limited to a fixed value, and calling and query failure conditions can be frequently generated, so that user experience and the information acquisition speed of normal query operation are affected. The number of times is dynamically adjusted, so that the complexity of flow implementation is increased, and the stability of the query process is also affected. If the above factors are solved, the effect of improving the processing level of the limit of the number of calls and accesses in the query process can be achieved. To achieve this, the present disclosure assists the query process by determining a first query parameter while performing a query operation in accordance with a query request. First, data elements and data attribute information of history data are constructed as data pairs, and a storage node sequence is generated. Second, generating the first query parameter limits the maximum amount of target data included in the sequence of target data in a query. Then, the number of queries and the end-marker are determined. The query times indicate that the client finishes the complete query on the target data sequence by a way of initiating the query for a plurality of times, but not by a way of limiting the number of times of one query. The method avoids adopting a method of simple frequency limitation or complex dynamic query limitation, improves the query efficiency by resetting the query parameters and the multiple query calling mode of the client, relieves the query pressure of the server, and improves the query experience of the client, thereby solving the second technical problem.
Step 204, storing the target data sequence and the target attribute information in the buffer memory to obtain the target data sequence in the buffer memory and the target attribute information in the buffer memory.
In some embodiments, the execution body stores the target data sequence and the target attribute information in a cache to obtain the target data sequence in the cache and the target attribute information in the cache. Specifically, the buffer may be a buffer area for data exchange, and is a memory capable of performing high-speed data exchange in the execution body.
Optionally, pushing the target data sequence to the target device to control the target device to perform the target operation. The target device with the display function may be a device communicatively connected to the execution body, and may display the target device according to the received target data sequence. For example, when the execution subject outputs the target data sequence to be displayed in the target device, the user can be helped to view the related information of the query. Specifically, the user may be prompted to perform the necessary resolution in response to the relevant information prompting that the operation is already in an overflow state. The implementation mode can be used as a method for concurrent query of users in an Internet enterprise architecture, repeated query of the same target data sequence is avoided, query speed is improved, query processing time is saved for the users, query pressure of a server is reduced, and a way for checking query results is provided for the users.
One embodiment, as illustrated in fig. 2, has the following beneficial effects: acquiring a query request input by a user; determining a first query parameter; determining a target data sequence according to the query request and the first query parameter; and storing the target data sequence and the target attribute information in a cache to obtain the target data sequence in the cache and the target attribute information in the cache. According to the embodiment, the maximum amount of target data included in the target data sequence of the query is limited by generating the first query parameter, repeated query on the same target data sequence is avoided by storing the target data sequence and the target attribute information in the cache, the query speed is improved, the query processing time is saved for a user, and the query pressure of the server is also reduced.
With further reference to fig. 3, as an implementation of the method described above for each of the above figures, the present disclosure provides some embodiments of a query device, which correspond to those method embodiments described above for fig. 2, which may find particular application in a variety of electronic devices.
As shown in fig. 3, the query device 300 of some embodiments, the device comprises: a receiving unit 301, a determining unit 302, a generating unit 303, and a storing unit 304. Wherein the receiving unit 301 is configured to obtain a query request input by a user. The determining unit 302 is configured to determine a first query parameter. Wherein the first query parameter refers to a maximum number of target data included in the target data sequence of the query. The generating unit 303 is configured to determine the target data sequence based on the query request and the first query parameter. The storage unit 304 is configured to store the target data sequence and the target attribute information in the buffer, so as to obtain the target data sequence in the buffer and the target attribute information in the buffer.
It will be appreciated that the elements described in the apparatus 300 correspond to the various steps in the method described with reference to fig. 2. Thus, the operations, features and resulting benefits described above with respect to the method are equally applicable to the apparatus 300 and the units contained therein, and are not described in detail herein.
Referring now to FIG. 4, there is illustrated a schematic diagram of a computer system 400 suitable for use in implementing a server of an embodiment of the present disclosure. The server illustrated in fig. 4 is merely an example, and should not be construed as limiting the functionality and scope of use of the disclosed embodiments.
As shown in fig. 4, the computer system 400 includes a central processing unit (CPU, central Processing Unit) 401 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 402 or a program loaded from a storage section 408 into a random access Memory (RAM, random Access Memory) 403. In RAM 403, various programs and data required for the operation of system 400 are also stored. The CPU 401, ROM 402, and RAM 403 are connected to each other by a bus 404. An Input/Output (I/O) interface 405 is also connected to bus 404.
The following components are connected to the I/O interface 405: a storage section 406 including a hard disk and the like; and a communication section 407 including a network interface card such as a LAN (local area network ) card, a modem, or the like. The communication section 407 performs communication processing via a network such as the internet. The driver 408 is also connected to the I/O interface 405 as needed. Removable media 409, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like, is installed as needed in drive 408, so that a computer program read therefrom is installed as needed in storage section 406.
In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 407, and/or installed from the removable medium 409. The above-described functions defined in the method of the present disclosure are performed when the computer program is executed by a Central Processing Unit (CPU) 401. It should be noted that the computer readable medium described in the present disclosure may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this disclosure, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present disclosure, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations of the present disclosure may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the C-language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by those skilled in the art that the scope of the invention referred to in this disclosure is not limited to the specific combination of features described above, but encompasses other embodiments in which features described above or their equivalents may be combined in any way without departing from the spirit of the invention. Such as those described above, are mutually substituted with the technical features having similar functions disclosed in the present disclosure (but not limited thereto).
Claims (9)
1. A method of querying, comprising:
Acquiring a query request input by a user, wherein the query request comprises target attribute information;
Determining a first query parameter, wherein the first query parameter refers to the maximum number of target data included in a target data sequence of query, the data of each query is only the maximum number, and a user initiates a query request again after the maximum number is queried;
determining a target data sequence according to the query request and the first query parameter;
Storing the target data sequence and the target attribute information in a cache to obtain the target data sequence in the cache and the target attribute information in the cache;
Wherein the determining the target data sequence according to the query request and the first query parameter includes:
Determining the number of inquiry times and an end mark, wherein the number of inquiry times is the number of times of receiving the inquiry request input by a user;
Responsive to the number of queries being 0 and the end flag being 0, the end flag being 0 indicating that the query has not ended in the sequence of storage nodes for the query request entered by the user, performing the following processing steps:
determining a first target storage node sequence according to the query request and the first query parameter;
generating a first target data sequence and a second query parameter according to the first target storage node sequence, wherein the second query parameter is the position of the last first target storage node in the first target storage node sequence;
Adding 1 to the query number;
Updating an end mark;
and determining the first target data sequence as the target data sequence.
2. The method of claim 1, wherein prior to the obtaining the user-entered query request, the method further comprises:
Determining a sequence of storage nodes, wherein the sequence of storage nodes comprises a first number of storage nodes, the storage nodes storing data pairs, the data pairs comprising data elements and data attribute information.
3. The method of claim 2, wherein the determining a target data sequence from the query request and the first query parameter further comprises:
in response to the number of queries not being 0 and the end flag being 0, performing the following processing steps:
Determining a second target storage node sequence according to the query request, the first query parameter and the second query parameter;
Generating a second target data sequence and a third query parameter according to the second target storage node sequence;
Updating the value of the second query parameter to the value of the third query parameter;
Adding 1 to the query number;
Updating an end mark;
And determining the second target data sequence as the target data sequence.
4. The method of claim 3, wherein the determining a second target sequence of storage nodes based on the query request, the first query parameter, and the second query parameter comprises:
Generating an initial second target storage node sequence, wherein the initial second target storage node sequence is empty;
For each storage node in the storage node sequence, matching the target attribute information with the attribute information of the storage node, and placing the storage node in the initial second target storage node sequence in response to the matching coincidence;
Deleting each initial second target storage node of the initial second target storage node sequence, wherein the position of each initial second target storage node is in front of the second query parameter;
and determining the initial second target storage node as the second target storage node sequence.
5. The method of claim 4, wherein prior to the determining the first query parameter, the method further comprises:
and determining the target data sequence in the cache as the target data sequence in response to the target attribute information in the query request being the same as the target attribute information in the cache.
6. The method according to one of claims 1-5, wherein the method further comprises:
pushing the target data sequence to target equipment so as to control the target equipment to perform target operation.
7. A query device, comprising:
A receiving unit configured to obtain a query request input by a user, wherein the query request includes attribute information;
The determining unit is configured to determine a first query parameter, wherein the first query parameter refers to the maximum number of target data included in a target data sequence of query, the data of each query is only the maximum number, and a user initiates a query request again after querying the maximum number;
a generating unit configured to determine a target data sequence according to the query request and the first query parameter;
A storage unit configured to store the target data sequence and the target attribute information in a buffer memory to obtain the target data sequence in the buffer memory and the target attribute information in the buffer memory;
Wherein the generating unit is further configured to:
Determining the number of inquiry times and an end mark, wherein the number of inquiry times is the number of times of receiving the inquiry request input by a user;
Responsive to the number of queries being 0 and the end flag being 0, the end flag being 0 indicating that the query has not ended in the sequence of storage nodes for the query request entered by the user, performing the following processing steps:
determining a first target storage node sequence according to the query request and the first query parameter;
generating a first target data sequence and a second query parameter according to the first target storage node sequence, wherein the second query parameter is the position of the last first target storage node in the first target storage node sequence;
Adding 1 to the query number;
Updating an end mark;
and determining the first target data sequence as the target data sequence.
8. A first terminal device, comprising:
one or more processors;
A storage device having one or more programs stored thereon;
when executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-6.
9. A computer readable medium having stored thereon a computer program, wherein the program when executed by a processor implements the method of any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110045126.0A CN112784139B (en) | 2021-01-13 | 2021-01-13 | Query method, device, electronic equipment and computer readable medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110045126.0A CN112784139B (en) | 2021-01-13 | 2021-01-13 | Query method, device, electronic equipment and computer readable medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112784139A CN112784139A (en) | 2021-05-11 |
| CN112784139B true CN112784139B (en) | 2024-07-02 |
Family
ID=75755950
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110045126.0A Active CN112784139B (en) | 2021-01-13 | 2021-01-13 | Query method, device, electronic equipment and computer readable medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112784139B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113806151B (en) * | 2021-09-07 | 2024-01-02 | 深圳宝新创信息技术有限公司 | Time sequence parameter determining method, device, electronic equipment and system |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103729471B (en) * | 2014-01-21 | 2017-03-08 | 华为软件技术有限公司 | Data base query method and device |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110019350B (en) * | 2017-07-28 | 2021-06-29 | 北京京东尚科信息技术有限公司 | Data query method and device based on configuration information |
| US11151167B2 (en) * | 2019-05-10 | 2021-10-19 | Georgetown University | Cache optimization via topics in web search engines |
| CN111026931A (en) * | 2019-12-09 | 2020-04-17 | 中国建设银行股份有限公司 | Data query method, device, equipment and medium |
| CN111722927B (en) * | 2020-06-12 | 2022-12-06 | 苏州浪潮智能科技有限公司 | Data cache management method, system, device and medium |
| CN111814045B (en) * | 2020-06-30 | 2024-06-14 | 平安科技（深圳）有限公司 | Data query method, device, electronic equipment and storage medium |
-
2021
- 2021-01-13 CN CN202110045126.0A patent/CN112784139B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103729471B (en) * | 2014-01-21 | 2017-03-08 | 华为软件技术有限公司 | Data base query method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112784139A (en) | 2021-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108011949B (en) | Method and apparatus for acquiring data | |
| CN110909022A (en) | Data query method and device | |
| CN111831503B (en) | Monitoring method based on monitoring agent and monitoring agent device | |
| CN113312553B (en) | User tag determining method and device | |
| CN112784139B (en) | Query method, device, electronic equipment and computer readable medium | |
| CN113760982B (en) | Data processing method and device | |
| CN112685481B (en) | Data processing method and device | |
| CN112948138A (en) | Method and device for processing message | |
| CN113760487B (en) | Service processing method and device | |
| CN113127561B (en) | Method and device for generating service single number, electronic equipment and storage medium | |
| CN109213815B (en) | Method, device, server terminal and readable medium for controlling execution times | |
| CN116861397A (en) | Request processing method, device, electronic equipment and computer readable medium | |
| CN112688982B (en) | User request processing method and device | |
| CN110019671B (en) | Method and system for processing real-time message | |
| CN109087097B (en) | Method and device for updating same identifier of chain code | |
| CN113779122A (en) | Method and apparatus for exporting data | |
| CN113722193A (en) | Method and device for detecting page abnormity | |
| CN111176679A (en) | Application program updating method and device | |
| CN113760965B (en) | Data query method and device | |
| CN112783914A (en) | Statement optimization method and device | |
| CN113726885B (en) | Flow quota adjusting method and device | |
| CN113760972B (en) | Data searching method and device | |
| CN112783904B (en) | Method and device for updating index data | |
| CN117061497A (en) | Data providing method and device | |
| CN118152340A (en) | ES operation method and device |
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 |