WO2017133538A1 - Procédé de réalisation d'une interrogation de données et serveur - Google Patents

Procédé de réalisation d'une interrogation de données et serveur Download PDF

Info

Publication number
WO2017133538A1
WO2017133538A1 PCT/CN2017/072178 CN2017072178W WO2017133538A1 WO 2017133538 A1 WO2017133538 A1 WO 2017133538A1 CN 2017072178 W CN2017072178 W CN 2017072178W WO 2017133538 A1 WO2017133538 A1 WO 2017133538A1
Authority
WO
WIPO (PCT)
Prior art keywords
query
data
statement
page
preset
Prior art date
Application number
PCT/CN2017/072178
Other languages
English (en)
Chinese (zh)
Inventor
景小卫
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2017133538A1 publication Critical patent/WO2017133538A1/fr

Links

Images

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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2455—Query execution
    • G06F16/24564—Applying rules; Deductive queries
    • G06F16/24565—Triggers; Constraints
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2455—Query execution
    • G06F16/24553—Query execution of query operations

Definitions

  • the present disclosure relates to data processing techniques, for example, to a method and server for implementing data queries.
  • Telecom network management, power system monitoring, online stores, etc. often maintain a large amount of data, these maintained data are generally stored in the database system table; for example, telecommunications network management and power system monitoring need to maintain the system's daily performance, alarm information and other data
  • the online store needs to maintain a large amount of commodity information data, etc., and the amount of data maintained is usually huge.
  • the table used to store the data is called a large table; for example, a large table for storing daily performance data of the telecommunication network management, by network element, single Each test point in the board and the board generates one performance data every 15 minutes, and the daily performance data of the large-scale telecommunication network coupled with the large-scale telecommunication network for one month will reach an astonishing scale.
  • the user queries and browses the data stored in the large table through the client to obtain the desired content (interesting, valuable content).
  • the purpose of querying large tables is very broad and may involve a large amount of data.
  • the data is accessed in a large table in the following manner:
  • the first type according to the data query, the server obtains all the data satisfying the query command according to the query command, and then sends all the data to the client;
  • the server distributes the fixed number of fixed or fixed time query results to the client according to the query command.
  • the present disclosure provides a method and a server for implementing data query, which can avoid a large amount of feedback query data when accessing a large table.
  • the present disclosure provides a method of implementing data query, including:
  • the server After receiving the query instruction, the server generates a page query statement according to the query instruction;
  • the server executes each generated page query statement and returns corresponding query data according to each page query statement.
  • generating a paged query statement includes:
  • the query size is a product of the number of query windows and the amount of data displayed by the query window;
  • the query record includes: the number of query windows, the query duration, the transmission duration of the query data, and the insertion duration of the query data when the page break query statement is executed in one-to-one correspondence with each page query statement.
  • the subsequent paged query statement generated according to the query record of the previous paged query statement includes:
  • the query size is not adjusted
  • the query size of the subsequent pagination query statement is adjusted according to the query record, and the next subsequent pagination query statement is generated according to the adjusted query size.
  • the method before the generating the subsequent paging query according to the query duration of the preceding paging query, the method further includes:
  • the query timing is respectively performed on each of the paging query statements to obtain the query duration of the previous paging query statement.
  • the method further includes:
  • the query failure information includes a query failure reason and/or a preset query failure code.
  • the method further includes:
  • the last packet data insertion process is performed in the query window of the browse query data: if it is not the last packet data of the last page query statement, the query data is browsed.
  • the query window performs the insertion processing of the intermediate data.
  • the method further includes:
  • the display of the query data of the current page query query is continued; if the current number of query windows for displaying the query data reaches the preset trigger threshold , then execute the next post-page query statement.
  • the method further includes:
  • the method further includes:
  • an embodiment of the present disclosure further provides a server for implementing data query, including: a generating unit and a returning unit; wherein
  • the generating unit is configured to generate a paging query statement according to the query instruction after receiving the query instruction;
  • the return unit is configured to execute each generated page query statement and return corresponding query data according to each page query statement.
  • the generating unit is configured to
  • the query size is a product of the number of query windows and the amount of data displayed by the query window;
  • the query record includes: the number of query windows, the query duration, the transmission duration of the query data, and the insertion duration of the query data when the page break query statement is executed in one-to-one correspondence with each page query statement.
  • the generating unit is configured to
  • the query size is not adjusted
  • the query size of the next page query query is adjusted according to the query time, and the next subsequent page query statement is generated according to the adjusted query size.
  • the server further includes a timing unit configured to generate the subsequent paging query according to the query duration of the preceding paging query.
  • the query timing is respectively performed on each of the paging query statements to obtain the query duration of the previous paging query statement.
  • the server further includes a query feedback unit, configured to feed back the query failure information when the query of the page query query fails;
  • the query failure information includes a query failure reason and/or a preset query failure code.
  • the server further includes a packet processing unit configured to determine whether the returned query data is the last packet data of the last page query statement;
  • the last packet data insertion process is performed in the query window of the browse query data: if it is not the last packet data of the last page query statement, the query data is browsed.
  • the query window performs the insertion processing of the intermediate data.
  • the server further includes a page turning processing unit:
  • the display of the query data of the current page query query is continued; if the current number of query windows for displaying the query data reaches the preset trigger threshold , then execute the next post-page query statement.
  • the server further includes a stopping unit configured to stop executing the paging query statement when the query window is not detected to be turned over or the operation of closing the query window is received.
  • a stopping unit configured to stop executing the paging query statement when the query window is not detected to be turned over or the operation of closing the query window is received.
  • the server further includes a triggering unit configured to count the display time of the previous preset number of query windows;
  • Embodiments of the present disclosure also provide a non-transitory computer readable storage medium storing computer executable instructions arranged to perform the above method.
  • An embodiment of the present disclosure further provides an electronic device, including:
  • At least one processor At least one processor
  • the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to cause the at least one processor to perform the method described above.
  • the technical solution of the present disclosure includes: after receiving the query instruction, the server generates a page query statement according to the query instruction; the server executes each generated page query statement, and returns corresponding query data according to each page query statement.
  • the paging query by the paging query generated by the query instruction reduces the feedback amount of the query data when the large table data is accessed, thereby avoiding waste of network communication and server resources, and improving the user experience.
  • FIG. 1 is a flowchart of a method for implementing data query according to an embodiment of the present disclosure
  • FIG. 2 is a structural block diagram of a server for implementing data query according to an embodiment of the present disclosure
  • FIG. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure.
  • FIG. 1 is a flowchart of a method for implementing data query according to an embodiment of the present disclosure. As shown in FIG. 1 , the method includes:
  • Step 100 After receiving the query instruction, the server generates a page query statement according to the query instruction.
  • generating a paged query statement includes:
  • the subsequent paging query statement is generated according to the query record of the previous paging query statement;
  • the query size is the product of the number of query windows and the amount of data displayed by the query window; here, the amount of data displayed by the query window can be understood as the size of the query window;
  • the query record includes: the number of query windows when executing each page query statement in one-to-one correspondence with each page query statement, the query duration, the transmission time of the query data, and the insertion time of the query data.
  • Each paged query statement contains a one-to-one correspondence record.
  • the subsequent paged query statement generated according to the query record of the previous paged query statement includes:
  • the query size is not adjusted
  • the preset interval of the embodiment of the present disclosure may be (0.8, 1.05).
  • the preset interval may be an empirical value of those skilled in the art, so that the browsing of the query data can be smoothly performed as a standard, and the feedback time of the slowest query data that can be accepted is used as the bottom line.
  • the query size of the next post-page query statement is not adjusted
  • the query size of the next page query query is adjusted according to the query record.
  • the application query duration can be recorded by the server; the client timer can be used to record the start time of the page query query to the time when the query data is inserted into the query window, and the start time of the page query is executed. The length of time that the query data is inserted into the query window minus the length of the query to get the query data.
  • the query duration, the transmission duration of the query data, and the insertion duration of the query data can be stored in a queue manner.
  • the query duration is T2
  • the target response time can be set to be the same as the preset response threshold value, or can be adjusted according to the actual query data feedback speed requirement.
  • the query size of the subsequent pagination query can be calculated on the client.
  • the server sends the recorded query duration to the client, and the client combines the transmission duration of the query data recorded by the client and the insertion of the query data.
  • the duration is calculated by using the first fitting function, the second fitting function and the target response time to obtain the query size of the subsequent pagination query statement;
  • the query size of the subsequent pagination query statement can be calculated on the server side, for example,
  • the client sends the recorded transmission time of the query data and the insertion time of the query data to the server, and the server combines the first fitting function, the second fitting function and the target response time to obtain the latter one. Minute
  • Minute The query size of the page query statement;
  • the ease factor when the query size of the subsequent page query statement is adjusted according to the query record, if the query size is too large, the ease factor is theoretically larger than the maximum value of the preset interval, and the subsequent page is reduced.
  • the number of query windows of the query statement can speed up the feedback of the query data, and the ease of use coefficient is theoretically reduced; if the query size is too small, the ease factor is theoretically smaller than the minimum value of the preset interval, by adding a subsequent page query.
  • the number of query windows of the statement can increase the amount of data of the query data; enable the user to obtain enough information when executing a paged query statement; that is, when the ease factor is greater than the maximum value of the preset interval, the query is reduced in the next page.
  • the reduction and increase of the number of query windows can be calculated by referring to the fitting function, or can be adjusted according to a preset step size or an adjustment function.
  • Step 101 The server executes each generated page query statement, and returns corresponding query data according to each page query statement.
  • the method of the embodiment of the present disclosure further includes: before the generating the subsequent paging query statement according to the query duration of the preceding paging query.
  • the query timing of each paging query statement is separately obtained to obtain the query duration of the previous paging query statement.
  • the method of the embodiment of the disclosure further includes:
  • the query failure information includes the reason for the query failure and/or a preset query failure code.
  • the method of the embodiment of the disclosure further includes:
  • the last packet data insertion process is performed in the query window of the browse query data: if it is not the last packet data of the last page query statement, the query data is browsed.
  • the query window performs the insertion processing of the intermediate data.
  • the method of the embodiment of the disclosure further includes:
  • the trigger threshold can be set to be fixed.
  • the number for example, is set to 1/3 of the number of query windows up or down;
  • the display of the query data of the current page query query is continued; if the current number of query windows for displaying the query data reaches the preset trigger threshold , then execute the next post-page query statement.
  • the method of the embodiment of the disclosure further includes:
  • the method of the embodiment of the disclosure further includes:
  • the processing of the foregoing method in the embodiment of the present disclosure may be implemented by a central processing unit; the execution content involved in the embodiment method may be added to the central processing unit after generating a corresponding execution instruction.
  • the paging query statement reduces the feedback amount of the query data when the large table data is accessed, thereby avoiding waste of network communication and server resources, and improving the user experience.
  • FIG. 2 is a structural block diagram of a server for implementing data query according to an embodiment of the present disclosure. As shown in FIG. 2, the method includes: a generating unit and a returning unit;
  • the generating unit is configured to generate a paging query statement according to the query instruction after receiving the query instruction;
  • the return unit is configured to execute each generated page query statement and return corresponding query data according to each page query statement.
  • the generating unit is configured to
  • the subsequent paging query statement is generated according to the query record of the previous paging query statement;
  • the query size is the product of the number of query windows and the amount of data displayed in the query window
  • the query record includes: the number of query windows when executing each page query statement in one-to-one correspondence with each page query statement, the query duration, the transmission time of the query data, and the insertion time of the query data.
  • the generating unit is configured to
  • the query size is not adjusted
  • the query size of the subsequent pagination query statement is adjusted according to the query record, and the next subsequent pagination query statement is generated according to the adjusted query size.
  • the embodiment of the present disclosure further includes a timing unit configured to generate a subsequent paging query according to a query duration of the preceding paging query.
  • the query timing of each paging query statement is separately obtained to obtain the query duration of the previous paging query statement.
  • the server of the disclosure further includes a query feedback unit configured to feed back the query failure information when the query of the page query query fails.
  • the query failure information includes the reason for the query failure and/or a preset query failure code.
  • the embodiment of the present disclosure further includes a packet processing unit configured to determine whether the returned query data is the last packet data of the last page query statement;
  • the inquiry window performs the insertion processing of the last packet data: if it is not the last packet data of the last page query statement, the interpolation processing of the intermediate data is performed in the query window of the browse query data.
  • the server of the disclosure further includes a page turning processing unit:
  • the display of the query data of the current page query query is continued; if the current number of query windows for displaying the query data reaches the preset trigger threshold , then execute the next post-page query statement.
  • the embodiment of the present disclosure further includes a stopping unit configured to stop executing the paging query statement when the query window is not detected to be turned over or the operation of closing the query window is received.
  • the server of the disclosed embodiment further includes a triggering unit configured to count a display time of the previous preset number of query windows;
  • the application example system includes a client and a server, and the client is deployed in a data access interface of the application system.
  • FIG. 3 is a flowchart of a method for applying the example of the present disclosure. As shown in FIG. 3, the method includes:
  • Step 300 The server starts a query thread for data access
  • the application data query thread of the present disclosure may also be established when the user opens the browsing window, which is a conventional technical means by those skilled in the art, and details are not described herein again.
  • the query thread refers to the query thread that accesses the large table data.
  • Step 301 The client receives a user instruction to determine a data range of the access data, and sends a query instruction to the server.
  • This step triggers the client to enter the data browsing process, and may include the following processing: by determining the data range, the client enters the query state, that is, the client query end state is false; sending the query command to Server, the server enters the query state.
  • the query instruction sent by the application example to the server may include: a conditional query statement, a browse window page size, and a query window number; wherein, the initial value of the query window number may adopt a preset value, for example, the preset value may be set to be determined by statistical analysis.
  • the average number of access pages, for example, the initial value of the number of query windows is 5.
  • Step 302 After receiving the query instruction, the server generates a page query statement according to the query instruction.
  • generating a paged query statement includes:
  • the subsequent paging query statement is generated according to the query record of the previous paging query statement;
  • the query size is the product of the number of query windows and the amount of data displayed in the query window
  • the query record includes: the number of query windows when executing each page query statement in one-to-one correspondence with each page query statement, the query duration, the transmission time of the query data, and the insertion time of the query data.
  • the query size of each generated paging query statement may be the same; for example, the number of query windows in the query size is set to a fixed value of 5-7. Value, at this time, according to the query instruction, all the paged query statements that meet the requirements are generated.
  • the query size can be saved as a fixed parameter.
  • the subsequent paged query statement generated according to the query record of the previous paged query statement includes:
  • the response threshold may be determined based on industry standards, customer requirements, or technician design indicators.
  • the response threshold mainly refers to the response duration of the paged query statement; in general, when the large table data is queried, the small operation response time is in the second level, for example, 3 to 5 seconds, the response threshold can be set to 3 to 5 seconds. If the response threshold is set too large, the user will be affected by the data query experience if the preset interval is unchanged.
  • the preset interval of this application example may be (0.8, 1.05).
  • the preset interval may be an empirical value of those skilled in the art, so that the browsing of the query data can be smoothly performed as a standard, and the feedback time of the slowest query data that can be accepted is used as the bottom line.
  • the query size is not adjusted; here, the query size is not adjusted: the post query statement is generated according to the query size of the previous pagination query;
  • the preset value can be set to an integer greater than or equal to 2.
  • the query record includes: the number of query windows and the query response time in one-to-one correspondence with each page query statement when executing each page query statement; wherein the query response time includes: the query duration, the transmission time of the query data, and the insertion time of the query data. ;
  • This application example query duration is recorded by the server; this application example can also record the start time of executing the paged query statement through the client timer to the time when the query data is inserted into the query window, and the start time of the paged query statement to the query data insertion.
  • the length of the query window is subtracted from the query window time to get the length of the query data.
  • the adjustment record can be processed in the server by means of a queue.
  • the query size of the subsequent page query statement is adjusted according to the query record.
  • Content can obtain c and d in the second fitting function; set the target response time, and calculate the target response time equal to (a*w+c)+(b*w+d) to obtain a subsequent paged query statement.
  • the value of the number of query windows w if the value obtained by the calculation is not an integer, it can be rounded up or down.
  • the target response time can be set to be the same as the preset response threshold value, or can be adjusted according to the actual query data feedback speed requirement.
  • the query size of the next paged query statement can be calculated on the client side.
  • the server sends the recorded query duration to the client, and the client combines the record length of the query data recorded by the client and the query data.
  • the insertion duration is calculated by using the first fitting function, the second fitting function and the target response time to obtain the query size of the subsequent pagination query statement;
  • the query size of the subsequent pagination query statement can be calculated on the server side, for example,
  • the client sends the record transmission time of the query data and the insertion time of the query data to the server, and the server combines the first fitting function, the second fitting function and the target response time to obtain the subsequent query time.
  • the ease factor exceeds the preset interval, where the value of the ease factor is less than the minimum value of the preset interval and the value of the ease factor is greater than the maximum value of the preset interval; the value of the ease factor is less than the minimum of the preset interval
  • the application example obtains the first fitting function and the second fitting function according to the query record fitting, and the number of query windows of the next post-page query statement can be calculated by setting the target response time to be larger than the previous pagination query.
  • the number of query windows of the statement when the value of the easy-to-use coefficient is greater than the maximum value of the preset interval, the application example obtains the first fitting function and the second fitting function according to the query record fitting, and can be calculated by setting the target response time.
  • the number of query windows for obtaining the next post-page query statement is smaller than the number of query windows for the previous page query statement; by adjusting, the query data fed back by each page query statement is integrated in the data amount and the feedback rate, thereby improving the user in the large table.
  • the experience of using data queries is smaller than the number of query windows for the previous page query statement; by adjusting, the query data fed back by each page query statement is integrated in the data amount and the feedback rate, thereby improving the user in the large table.
  • the default paging value may be used as the query size of the first paging query, and the query size is equal to the number of query windows.
  • the client window displays the product of the amount of data; the initial value of the general query window can be 5 to 7, and the value can be adjusted according to the query data return speed and the user experience when the page query statement is executed.
  • the example method of the present disclosure further includes: performing query timing on each page query statement to obtain a query duration of the previous page query statement.
  • the application query timing of the present disclosure can be performed by a timer, and the query duration can be obtained by recording the query start time and end time of each page query query. If it is a continuous query, the end of the previous page query statement The time is the starting time of the current paging query statement; if the paging query statement is a non-contiguous query, the query duration can be obtained by reading the system time from the beginning to the end of the paging query.
  • Step 303 The server executes each generated page query statement, and returns corresponding query data according to each page query statement.
  • the general starting time and the query size are pushed into the query stack.
  • the execution of the paging query is completed, the paging query in the query stack is cleared.
  • the execution of the query instruction according to the existing connection access needs to access the database or the large table, for example, through the database large table access interface to establish a connection with the database; access to the database or the contents of the large table in the database is a person skilled in the art The usual technical means will not be repeated here.
  • the application examples of the disclosure also include:
  • the query failure information may be a query failure reason, and/or a preset query failure code.
  • the application example of the present disclosure further includes determining whether the returned query data is the last packetized data of the last paged query statement:
  • the last packetized data insertion process is performed in the query window of the browse query data: optional,
  • the extracted data For each piece of data of the extracted sub-package data, determine whether it is the query data of the page-by-page query statement. If it is the query data of the page-by-page query statement, the extracted data is inserted into the client access window for display until the packet data is paginated. When the last data of the query data of the query is queried, the data insertion is completed;
  • the insertion state is true; when the insertion is stopped, the insertion state is false, the query end is true, and the page query statement ends.
  • the interpolation process of the intermediate data is performed in the query window of the browse query data.
  • each piece of data of the extracted packet data may be inserted into the client access window one by one; when the data is inserted, the out-of-boundary insertion state is false; the application example of the present application queries the paged query statement.
  • the query duration of the paged query statement is cut off.
  • the application example method further includes: when detecting the page of the query window for browsing the query data, determining whether the number of the query windows of the currently remaining display query data reaches a preset triggering threshold;
  • the display of the query data of the current page query query is continued; if the current number of query windows for displaying the query data reaches the preset trigger threshold , then execute the next post-page query statement.
  • This application example method also includes:
  • the application examples of the disclosure also include:
  • the preset number is set according to the actual usage, for example, two or three.
  • Step 304 End the data query according to the query instruction end information; here, when the query is ended, the query size, the query duration timer, etc. will be cleared, disconnected or kept connected with the database, ended or retained, and the query thread is set according to the actual situation.
  • Embodiments of the present disclosure also provide a non-transitory computer readable storage medium storing computer executable instructions arranged to perform the method of any of the above embodiments.
  • the embodiment of the present disclosure further provides a schematic structural diagram of an electronic device.
  • the electronic device includes:
  • At least one processor 40 which is exemplified by a processor 40 in FIG. 4; and a memory 41, may further include a communication interface 42 and a bus 43.
  • the processor 40, the communication interface 42, and the memory 41 can complete communication with each other through the bus 43.
  • Communication interface 42 can be used for information transmission.
  • Processor 40 may invoke logic instructions in memory 41 to perform the methods of the above-described embodiments.
  • logic instructions in the memory 41 described above may be implemented in the form of a software functional unit and sold or used as a stand-alone product, and may be stored in a computer readable storage medium.
  • the memory 41 is used as a computer readable storage medium for storing software programs, computer executable programs, and program instructions/modules corresponding to the methods in the embodiments of the present disclosure.
  • the processor 40 executes the function application and the data processing by executing the software program, the instruction and the module stored in the memory 41, that is, the method for implementing the data query in the above method embodiment.
  • the memory 41 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application required for at least one function; and the storage data area may be stored according to the use of the terminal device The data created, etc. Further, the memory 41 may include a high speed random access memory, and may also include a nonvolatile memory.
  • the technical solution of the embodiments of the present disclosure may be embodied in the form of a software product stored in a storage medium, including one or more instructions for causing a computer device (which may be a personal computer, a server, or a network) The device or the like) performs all or part of the steps of the method described in the embodiments of the present disclosure.
  • the foregoing storage medium may be a non-transitory storage medium, including: a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and the like.
  • the method and server for implementing data query provided by the present disclosure reduce the feedback amount of query data when performing large table data access, avoiding waste of network communication and server resources, and improving the user experience.

Landscapes

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

Abstract

L'invention concerne un procédé de réalisation d'une interrogation de données et un serveur. Le procédé comporte les étapes suivantes: après avoir reçu une consigne d'interrogation, un serveur génère des instructions d'interrogation de pagination d'après la consigne d'interrogation (100); et le serveur exécute les instructions d'interrogation de pagination générées, et renvoie, en fonction des instructions respectives d'interrogation de pagination, des données d'interrogation correspondantes (101). L'invention effectue une interrogation de pagination au moyen d'instructions d'interrogation de pagination générées d'après une consigne d'interrogation, réduisant ainsi une quantité de données d'interrogation renvoyées après avoir accédé à des données de tables de grande taille, empêchant le gaspillage des ressources associées à une communication en réseau et à un serveur, et améliorant l'agrément d'utilisation.
PCT/CN2017/072178 2016-02-05 2017-01-23 Procédé de réalisation d'une interrogation de données et serveur WO2017133538A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610079493.1A CN107045499A (zh) 2016-02-05 2016-02-05 一种实现数据查询的方法和服务器
CN201610079493.1 2016-02-05

Publications (1)

Publication Number Publication Date
WO2017133538A1 true WO2017133538A1 (fr) 2017-08-10

Family

ID=59500457

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/072178 WO2017133538A1 (fr) 2016-02-05 2017-01-23 Procédé de réalisation d'une interrogation de données et serveur

Country Status (2)

Country Link
CN (1) CN107045499A (fr)
WO (1) WO2017133538A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109359060A (zh) * 2018-10-24 2019-02-19 北京奇虎科技有限公司 数据抽取方法、装置、计算设备及计算机存储介质
CN111125148A (zh) * 2019-12-12 2020-05-08 中化石化销售有限公司 一种数据库的分页查询方法及装置
CN112667662A (zh) * 2020-12-25 2021-04-16 银盛支付服务股份有限公司 一种基于json键值的解析sql和nosql的通用方法
CN114039970A (zh) * 2021-11-11 2022-02-11 北京沃东天骏信息技术有限公司 信息下载方法、装置、电子设备和计算机可读介质

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112416967B (zh) * 2020-12-11 2024-05-14 北京北信源软件股份有限公司 数据分页查询方法、装置、电子设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040148273A1 (en) * 2003-01-27 2004-07-29 International Business Machines Corporation Method, system, and program for optimizing database query execution
CN101216840A (zh) * 2008-01-21 2008-07-09 金蝶软件（中国）有限公司 一种数据查询方法和一种数据查询系统
CN102521405A (zh) * 2011-12-26 2012-06-27 中国科学院计算技术研究所 支持高速加载的海量结构化数据存储、查询方法和系统
CN102880685A (zh) * 2012-09-13 2013-01-16 北京航空航天大学 一种时间密集大数据量的b/s分区间分页查询方法

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8996486B2 (en) * 2004-12-15 2015-03-31 Applied Invention, Llc Data store with lock-free stateless paging capability
CN103853727B (zh) * 2012-11-29 2018-07-31 深圳中兴力维技术有限公司 提高大数据量查询性能的方法及系统
CN104965873A (zh) * 2015-06-10 2015-10-07 努比亚技术有限公司 一种分页查询方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040148273A1 (en) * 2003-01-27 2004-07-29 International Business Machines Corporation Method, system, and program for optimizing database query execution
CN101216840A (zh) * 2008-01-21 2008-07-09 金蝶软件（中国）有限公司 一种数据查询方法和一种数据查询系统
CN102521405A (zh) * 2011-12-26 2012-06-27 中国科学院计算技术研究所 支持高速加载的海量结构化数据存储、查询方法和系统
CN102880685A (zh) * 2012-09-13 2013-01-16 北京航空航天大学 一种时间密集大数据量的b/s分区间分页查询方法

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109359060A (zh) * 2018-10-24 2019-02-19 北京奇虎科技有限公司 数据抽取方法、装置、计算设备及计算机存储介质
CN109359060B (zh) * 2018-10-24 2023-06-16 三六零科技集团有限公司 数据抽取方法、装置、计算设备及计算机存储介质
CN111125148A (zh) * 2019-12-12 2020-05-08 中化石化销售有限公司 一种数据库的分页查询方法及装置
CN111125148B (zh) * 2019-12-12 2023-07-07 中化石化销售有限公司 一种数据库的分页查询方法及装置
CN112667662A (zh) * 2020-12-25 2021-04-16 银盛支付服务股份有限公司 一种基于json键值的解析sql和nosql的通用方法
CN114039970A (zh) * 2021-11-11 2022-02-11 北京沃东天骏信息技术有限公司 信息下载方法、装置、电子设备和计算机可读介质

Also Published As

Publication number Publication date
CN107045499A (zh) 2017-08-15

Similar Documents

Publication Publication Date Title
WO2017133538A1 (fr) Procédé de réalisation d'une interrogation de données et serveur
CN111225041B (zh) 一种实现延时消息队列的方法及系统
CN110324793B (zh) 一种信息提醒的方法、装置及电子终端
CN105677815B (zh) 一种网页书签添加方法及终端
WO2017004921A1 (fr) Procédé, dispositif et appareil permettant de promouvoir un résultat de recherche et support de stockage informatique non volatil
CN108628890B (zh) 一种数据导出方法及系统
CN113132267B (zh) 一种分布式系统、数据聚合方法和计算机可读存储介质
CN107784085B (zh) 一种数据列表的导出方法及其终端
CN107992271B (zh) 数据预读方法、装置、设备及计算机可读存储介质
CN104881214A (zh) 一种阅读器的翻页方法及阅读器
CN107798039B (zh) 一种数据同步方法和装置
WO2015081715A1 (fr) Procédé et appareil de comptage d'utilisateurs connectés sur un site web
CN109558088B (zh) 一种压缩方法、系统、设备及计算机可读存储介质
CN106452898A (zh) 数据请求控制方法及装置
CN113656178A (zh) 数据处理方法、装置、设备及可读存储介质
CA3166090A1 (fr) Procede et appareil de diffusion selective de donnees d'abonnement dans l'internet des objets, dispositif et support de stockage associes
CN109656645A (zh) 展现时间确定方法和页面渲染完成时间的确定方法及装置
EP4231173A1 (fr) Procédé et appareil d'affichage d'historique de page web, dispositif et support de stockage
CN111078697A (zh) 一种数据存储方法、装置、存储介质及电子设备
CN107517273B (zh) 数据迁移的方法、系统、计算机可读存储介质及服务器
US20230195352A1 (en) Method for diluting cache space, and device and medium
CN115599806A (zh) 一种即席查询方法、装置、电子设备及存储介质
CN114741266A (zh) 页面白屏时长确定方法、装置、电子设备及存储介质
CN106209737B (zh) 控制远程服务调用频率的方法和装置
CN108966160B (zh) 一种短信处理方法、装置及计算机可读存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17746858

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17746858

Country of ref document: EP

Kind code of ref document: A1