An efficient retrieval method, apparatus, device and medium

Abstract

This invention provides an efficient retrieval method, apparatus, device, and medium. It employs a serial approach to trigger three subtasks of a retrieval task: preloading, actual query, and total count query. When retrieval conditions change, previous invalid searches can be interrupted. The retrieval process consumes only the resources of one thread, avoiding the waste of resources from multiple threads. Furthermore, the serial approach allows the three subtasks to be performed step-by-step, with the retrieval results returned step-by-step. This fully leverages the efficiency of the preloading mechanism to ensure a superior user experience. The accurate data returned by subsequent subtasks can promptly supplement and update the preloaded data, achieving a seamless user experience with no perceptible time difference between subsequent steps. This ensures both retrieval speed and data accuracy while significantly reducing system resource consumption and preventing system lag.

Description

Technical Field

[0001] This invention relates to the field of retrieval technology, and in particular to an efficient retrieval method, apparatus, device, and medium. Background Technology

[0002] For searches within a limited scope, such as searching for songs, movies, and other multimedia resources in a multimedia resource database, multi-threading is generally used. Each search is performed in multiple steps within a single thread. Since all steps need to be completed before the results are returned, the search time is relatively long.

[0003] Furthermore, due to hardware limitations, Android karaoke machines experience slow song search speeds because of the large database size, numerous query conditions, and complex sorting rules. For example, when searching for songs in the database, traditional retrieval takes approximately 2 seconds from the start of the search to the actual display of the data; especially on some low-spec models, this can reach 5 seconds or even longer, significantly impacting the user experience.

[0004] The earliest retrieval methods were generally multi-threaded, with each retrieval being executed in multiple steps within a single thread. Since it was necessary to wait for all steps to complete before returning results, the retrieval time was relatively long.

[0005] Chinese invention patent CN112732973A, published on April 30, 2021, discloses a method for rapid retrieval. The patent discloses the following: each retrieval triggers multiple threads and utilizes a pre-loading mechanism to return results step-by-step. This allows for rapid return of pre-loaded information, while the actual information can be returned later, ensuring both query speed and data accuracy. Specifically, when the user inputs the search object A, three threads are executed concurrently in the Android background. The first thread retrieves results that precisely match the search object A, and refreshes the interface upon completion. This retrieval is very fast, ensuring the speed at which the search results are visible. The second thread retrieves results that precisely and fuzzily match the search object A. This retrieval is slower, and upon completion, the interface is notified to replace the data from the previous step. This process is imperceptible to the user, but it ensures data accuracy. The third thread retrieves the total number of results from the previous step. This retrieval is slower, and upon completion, the interface is notified to refresh and page turning is possible.

[0006] Because the aforementioned invention triggers three parallel steps simultaneously—preloading, actual querying, and total count querying—and these three steps have different speeds or times, when retrieving object B, some threads that were previously retrieving object A may continue retrieving until all threads have completed their searches. At this point, only the search for object B is valid for the user; the search results for object A that were already running are invalid, but the system is still executing the search thread for object A. When retrieving object C, the search results for object B that were already running are invalid, and so on, potentially accumulating multiple invalid searches. With this search method, as the input search data conditions become closer to the user's expectations, the already triggered search steps cannot be canceled. Especially when multiple search objects are quickly entered, the system needs to execute multiple search threads simultaneously, increasing the CPU load, occupying system resources for extended periods, affecting the normal rendering of the system interface, and leading to system lag and other problems. Summary of the Invention

[0007] The technical problem to be solved by this invention is to provide an efficient retrieval method, apparatus, device, and medium. It changes the original parallel execution mode of triggering three sub-tasks—preloading, actual query, and total count query—in a retrieval task to a step-by-step serial execution mode. This allows subsequent invalid retrieval steps that have not yet occurred to be controlled and canceled, releasing system resources in a timely manner, thereby ensuring the smoothness of the system. It is particularly suitable for multimedia resource retrieval in multimedia resource databases.

[0008] In a first aspect, the present invention provides an efficient retrieval method, comprising the following task thread control process:

[0009] Step S1: When the input search object changes and the current search condition is different from the previous search condition, determine whether there are unfinished task threads piled up in the task thread list of the thread pool.

[0010] If not, a new thread is triggered to execute different subtasks in the current retrieval task serially;

[0011] If so, the status flag of the unfinished task thread in the task thread list is changed to canceled, and then a new thread is triggered to execute different subtasks in the current retrieval task serially;

[0012] The subtasks are arranged in a sequential order of execution as preloading, actual query, and total count query. Preloading is used to return exact match data, actual query is used to return the number of exact match data and fuzzy match data displayed on one page, and total count query is used to return all exact match data and fuzzy match data.

[0013] In a second aspect, the present invention provides a high-efficiency retrieval device, characterized in that it is used to execute the method described in the first aspect.

[0014] Thirdly, the present invention provides an electronic device including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the method described in the first aspect.

[0015] Fourthly, the present invention provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method described in the first aspect.

[0016] The one or more technical solutions provided in the embodiments of the present invention have at least the following technical effects or advantages: The present invention uses a serial approach to trigger three sub-tasks of a retrieval task: preloading, actual query, and total count query. When the user changes the input search conditions, the previous invalid search can be interrupted. The retrieval process consumes only the resources of one thread, avoiding the waste of resources of multiple threads. Furthermore, the serial approach allows the three sub-tasks to be performed step by step, and the retrieval results of the three sub-tasks are returned step by step. The high efficiency of the preloading mechanism is fully utilized to ensure a better user experience. The accurate data returned by the subsequent sub-tasks can timely supplement and update the preloaded data, and the user can be completely unaware of the time difference in the data returned by the subsequent steps. This ensures retrieval speed and data accuracy while greatly reducing the occupation of system resources and avoiding system lag.

[0017] The above description is merely an overview of the technical solution of the present invention. In order to better understand the technical means of the present invention and to implement it in accordance with the contents of the specification, and to make the above and other objects, features and advantages of the present invention more apparent and understandable, specific embodiments of the present invention are described below. Attached Figure Description

[0018] The present invention will be further described below with reference to the accompanying drawings and embodiments.

[0019] Figure 1 This is a flowchart of the method in Embodiment 1 of the present invention;

[0020] Figure 2 This is a flowchart of the method in Embodiment 2 of the present invention;

[0021] Figure 3 This is a flowchart of the thread pool preparation process in Embodiment 2 of the present invention;

[0022] Figure 4 This is a flowchart of the retrieval result return process in Embodiment 2 of the present invention;

[0023] Figure 5This is a flowchart of the object retrieval process in Embodiment 2 of the present invention;

[0024] Figure 6 This is a schematic diagram of the device in Embodiment 3 of the present invention;

[0025] Figure 7 This is a schematic diagram of the electronic device in Embodiment 4 of the present invention;

[0026] Figure 8 This is a schematic diagram of the structure of the medium in Embodiment 5 of the present invention. Detailed Implementation

[0027] This application provides an efficient retrieval method, apparatus, device, and medium. It changes the original parallel execution mode of triggering three sub-tasks—preloading, actual query, and total count query—in a retrieval task to a step-by-step serial execution mode. This allows subsequent invalid retrieval steps that have not yet occurred to be controlled and canceled, releasing system resources in a timely manner and ensuring the smoothness of the system.

[0028] The technical solution in this application embodiment has the following general idea: This invention uses a serial approach to trigger three sub-tasks of a retrieval task: preloading, actual query, and total count query. When the user changes the input search conditions, the previous invalid search can be interrupted. The retrieval process consumes only the resources of one thread, avoiding the waste of resources from multiple threads. Furthermore, the serial approach allows the three sub-tasks to be performed step by step, and the retrieval results of the three sub-tasks are returned step by step. This fully utilizes the efficiency of the preloading mechanism to ensure a better user experience. The accurate data returned by the subsequent sub-tasks can timely supplement and update the preloaded data, and the user can be completely unaware of the time difference in the data returned by the subsequent steps. This ensures retrieval speed and data accuracy while greatly reducing the occupation of system resources and avoiding system lag.

[0029] Example 1

[0030] like Figure 1 As shown, this embodiment provides an efficient retrieval method, including the following task thread control process:

[0031] When the input search object changes, making the current search condition different from the previous search condition, it is determined whether there are unfinished task threads piled up in the task thread list of the thread pool.

[0032] If not, a new thread is triggered to execute different subtasks in the current retrieval task serially;

[0033] If so, the status flag of the unfinished task thread in the task thread list is changed to canceled, and then a new thread is triggered to execute different subtasks in the current retrieval task serially;

[0034] Among them, the subtasks are arranged in a serial order of execution as preloading, true query, and total query. The preloading is used to return precisely matched data. The true query is used to return precisely matched data and fuzzy-matched data for the number of items displayed on one page. The total query is used to return all precisely matched data and fuzzy-matched data.

[0035] Since the true query returns precisely matched data and fuzzy-matched data for the number of items displayed on one page, the problem of slow data loading on the first page is solved. Starting from the second page, only the real data needs to be loaded.

[0036] Specific example: When a user needs to retrieve the song "My Motherland", the user first enters the retrieval object "I". Then, the following three-step retrieval process is carried out: The first step is preloading: Retrieve the results that precisely match the retrieval object "I", that is, retrieve the songs whose title is exactly "I". After the retrieval is completed, the interface is refreshed. This retrieval is very fast, ensuring the visual speed of the retrieval results. The second step is the true query: Retrieve the results that precisely and fuzzy match the retrieval object "I", and only need to return the retrieval results for the number of items displayed on the first page, that is, retrieve some songs whose first character is "I". This retrieval is also very fast. After the retrieval is completed, notify the interface to update the data displayed on the first page. Then, carry out the third step of the total query, returning all precisely matched data and fuzzy-matched data, that is, retrieve all the results that precisely and fuzzy match the retrieval object "I". This retrieval step is relatively slow. When the results of the third step are retrieved, when the user scrolls to the end of the first page, other retrieval results are automatically loaded. The user cannot perceive that the system has supplemented the retrieval results, and can only feel that the system quickly feedbacks the retrieval results and the retrieval results are accurate.

[0037] When the character "of" in the retrieval object is received, the previous retrieval object "I" and the newly received retrieval object "of" are regarded as a whole as a new retrieval condition. First, judge which step of the above three steps the "I" retrieval is in. If the current retrieval step is not completed, mark it as terminated and then jump out of the execution of the remaining steps; then check the tasks in the queue that have not been executed. If the third step of "I" has not been executed, directly cancel the third step task of "I" and then check and cancel the remaining tasks in the queue in turn; after completing the above steps, both the tasks being executed and the tasks in the queue that have not been executed are cleared; then repeat the three-step retrieval with "my" as the new retrieval condition. When the character "ancestral" is received again, repeat the above process. When the character "country" is received again, repeat the above retrieval process.

[0038] When the user performs other operations, the retrieval process ends. That is, when the user clicks on one of the songs "My Motherland", the process of the retrieval task ends. When the user re-enters the retrieval object, the process of the retrieval task is started again.

[0039] This embodiment uses a serial approach to trigger three subtasks of a retrieval task: preloading, actual query, and total count query. When the user changes the input search criteria, it can interrupt previous invalid searches. The retrieval process consumes only the resources of one thread, avoiding the waste of resources from multiple threads. Furthermore, the serial approach allows the three subtasks to be performed step by step, and the retrieval results of the three subtasks are returned step by step. This fully utilizes the efficiency of the preloading mechanism to ensure a better user experience. The accurate data returned by the subsequent subtasks can promptly supplement and update the preloaded data, and the user can be completely unaware of the time difference in the data returned by the subsequent steps. This ensures retrieval speed and data accuracy while greatly reducing the occupation of system resources and avoiding system lag.

[0040] Example 2

[0041] like Figure 2 As shown, this embodiment provides an efficient retrieval method, which, in addition to the task thread control process of Embodiment 1, also includes at least one of the following: a thread pool preparation process, a task thread listening process, and a retrieval result return process.

[0042] like Figure 3 As shown, the preparation process for the thread pool is as follows:

[0043] The maximum number of core running threads and the maximum number of threads in the waiting queue are set. The maximum number of core running threads is set to "1", and the maximum number of threads in the waiting queue is, for example, 50. When the number of threads waiting to be executed exceeds the maximum number of threads in the waiting queue, the thread pool will reclaim idle threads that have exceeded the time limit. The core running thread count is controlled at 1 to ensure that only one core thread is executing, preventing multiple threads from consuming resources. The maximum number of threads in the waiting queue can be set according to the device's performance. For example, it can be set to 50 to control the upper limit of waiting tasks, that is, at a certain point in time, the maximum number of tasks that can be accepted for waiting processing is 50, to prevent the response speed from slowing down. The time limit can be set to 60 seconds, that is, after the number of waiting threads exceeds 50, the thread pool will reclaim idle threads that have exceeded 60 seconds.

[0044] Still Figure 3 As shown, the task thread listening process is as follows:

[0045] Listen to whether the status flag of the current task thread has been modified to "cancelled". If yes, terminate the current task thread; otherwise, continue execution.

[0046] When a task thread that is waiting to be executed in the task thread list is to be started, it is determined whether the task thread to be started has been canceled. If so, the task thread is skipped; otherwise, the task thread is started.

[0047] A new task thread is added to the tail of the waiting queue of threads in the thread pool. The thread pool automatically manages and executes tasks. Furthermore, when an executing task thread becomes empty or completes its task, the thread pool removes the task thread from the head of the waiting queue (hereinafter referred to as the waiting queue) and changes its state from waiting to executing to executing. A task thread can only begin execution if there are no currently executing task threads and it is at the head of the waiting queue. Removing a task thread from the waiting queue signifies that the task is about to complete and the task thread has been terminated. Additionally, task threads can be cancelled regardless of whether they are currently executing or waiting to execute. A marker position exists within the task thread to indicate that its current state is cancelled. Specifically, if the task thread is in a waiting state, the thread pool will automatically cancel the task thread. Specifically, when the task thread changes from a waiting state to an executing state, it will determine whether it has been canceled. If it has been canceled, the task will be completed directly without execution. If the task thread marked as canceled is an executing task thread, it needs to determine within the task whether it has been canceled before each step begins. If it has been canceled, the unfinished steps will be skipped and the task will be completed.

[0048] like Figure 4 As shown, the process of returning search results specifically includes the following steps:

[0049] First, refresh the data returned by the preloaded subtasks, and keep the load size within one page;

[0050] When the actual subtask returns data, the page refreshes to display the actual subtask returned data.

[0051] When the total count query subtask returns the total number of search results, the total number of search results is first refreshed on the page; when the displayed data list scrolls to the end, the next page of data is automatically loaded. That is, the second page cannot be loaded until the first page of data has finished loading. Here, the return of the total count is used to determine whether the first page has finished loading, and knowing the total count is necessary to calculate the total number of pages and determine how many pages need to be loaded.

[0052] The total number of data to be loaded can be set. If the total number of data to be loaded is set, the next page of data will be loaded automatically when the displayed data list scrolls to a point where there is less than one page of data remaining. If the total number of data to be loaded is not set, the loading of the next page of data will not be triggered when the displayed data list scrolls to a point where there is less than one page of data remaining.

[0053] The display of search results can be achieved through UI controls. These controls should support auto-loading; specifically, they should allow users to set the total number of data items to load. When the list scrolls to a point where less than one page of data remains undisplayed, the next page should be loaded automatically. However, if no total number of data items is set, loading the next page should not be triggered. Furthermore, they should support data concatenation and UI refresh. Specifically, the returned data should automatically append, replace, and refresh the page based on the current page number. For example, if the search criteria prioritize returning exact matches followed by fuzzy matches, when a search task is triggered, it will first query and refresh the page with pre-loaded exact matches. This pre-loaded data only needs to be loaded up to one page for user preview. Then, it will retrieve the actual searched data and provide it to the view controls for data concatenation. At this point, the UI controls determine that the pre-loaded search data is a subset of the actual searched data and that the order is identical. The controls do not need to refresh the already displayed data; they only need to refresh when scrolling to data outside the pre-loaded search results. This process is imperceptible to the user, enabling pre-loading and backend data concatenation. Finally, it returns the total number of search results.

[0054] The efficient retrieval method of this invention is particularly suitable for information retrieval with a defined retrieval scope. For example, it can be used to retrieve multimedia resources such as songs and movies from a multimedia resource database. Since the retrieval scope is fixed, the precise matching data returned by this pre-loaded retrieval will inevitably be a subset of the actual query returned data (returning a page's worth of precise matching data and fuzzy matching data), and the order of the data will be the same, thus facilitating the updating of the search results on the first page.

[0055] Based on the same inventive concept, this application also provides an apparatus corresponding to the method in Embodiment 1 or Embodiment 2, as detailed in Embodiment 2.

[0056] Example 3

[0057] like Figure 6 As shown, this embodiment provides a high-efficiency retrieval device for implementing any of the embodiments in Embodiment 1 or Embodiment 2.

[0058] Since the apparatus described in Embodiment 3 of this invention is an apparatus used to implement the method of Embodiment 1 or Embodiment 2 of this invention, those skilled in the art can understand the specific structure and variations of the apparatus based on the method described in Embodiment 1 or Embodiment 2 of this invention, and therefore will not be described again here. All apparatuses used in the method of Embodiment 1 or Embodiment 2 of this invention fall within the scope of protection of this invention.

[0059] Based on the same inventive concept, this application provides electronic device embodiments corresponding to Embodiment 1 or Embodiment 2, as detailed in Embodiment 4.

[0060] Example 4

[0061] This embodiment provides an electronic device, such as... Figure 7 As shown, it includes a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it can implement any of the embodiments in Embodiment 1 or Embodiment 2.

[0062] Since the electronic device described in this embodiment is the device used to implement the method in Embodiment 1 or Embodiment 2 of this application, those skilled in the art can understand the specific implementation method and various variations of the electronic device in this embodiment based on the method described in Embodiment 1 or Embodiment 2 of this application. Therefore, how the electronic device implements the method in the embodiments of this application will not be described in detail here. Any device used by those skilled in the art to implement the method in the embodiments of this application falls within the scope of protection of this application.

[0063] Based on the same inventive concept, this application provides storage media corresponding to Embodiment 1 or Embodiment 2, as detailed in Embodiment 5.

[0064] Example 5

[0065] This embodiment provides a computer-readable storage medium, such as... Figure 8 As shown, a computer program is stored thereon. When the computer program is executed by the processor, it can implement any of the embodiments in Embodiment 1 or Embodiment 2.

[0066] The methods, apparatus, systems, devices, and media provided in this application have at least the following technical effects or advantages: The present invention uses a serial approach to trigger three sub-tasks of a retrieval task: preloading, actual query, and total count query. When the user changes the input search conditions, it can interrupt previous invalid searches. The retrieval process consumes only the resources of one thread, avoiding the waste of resources from multiple threads. Furthermore, the serial approach allows the three sub-tasks to be performed step-by-step, and the retrieval results of the three sub-tasks are returned step-by-step. This fully utilizes the efficiency of the preloading mechanism to ensure a better user experience. The accurate data returned by subsequent sub-tasks can promptly supplement and update the preloaded data, achieving the effect that the user is completely unaware of the time difference in the data returned by subsequent steps. This ensures retrieval speed and data accuracy while significantly reducing the occupation of system resources and avoiding system lag.

[0067] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, apparatus, or systems, or as computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0068] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0069] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0070] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0071] While specific embodiments of the present invention have been described above, those skilled in the art should understand that the specific embodiments described are merely illustrative and not intended to limit the scope of the present invention. Equivalent modifications and variations made by those skilled in the art in accordance with the spirit of the present invention should be covered within the scope of protection of the claims of the present invention.

Claims

1. An efficient retrieval method characterized in that: This includes the following task thread control procedures: When the input search object changes, making the current search condition different from the previous search condition, it is determined whether there are unfinished task threads piled up in the task thread list of the thread pool. If not, a new thread is triggered to execute different subtasks in the current retrieval task serially; If so, the status flag of the unfinished task thread in the task thread list is changed to canceled, and then a new thread is triggered to execute different subtasks in the current retrieval task serially; The subtasks are arranged in a sequential order of execution as preloading, actual query, and total count query. Preloading is used to return exact match data, actual query is used to return the number of exact match data and fuzzy match data displayed on one page, and total count query is used to return all exact match data and fuzzy match data.

2. The method according to claim 1, characterized in that: Also includes: The thread pool preparation process involves setting a maximum number of core running threads and a maximum number of threads in the waiting queue, where the maximum number of core running threads is set to "1". When the number of threads waiting to be executed exceeds the maximum number of threads in the waiting queue, the thread pool will reclaim idle threads that have exceeded the time limit.

3. The method according to claim 1, characterized in that: Also includes: Task thread monitoring process: Monitor whether the status flag of the current task thread has been modified to "cancelled". If yes, the current task thread is terminated; otherwise, execution continues. When a task thread in the task thread list is waiting to be started, check whether the task thread to be started has been cancelled. If yes, skip this task thread; otherwise, start this task thread.

4. The method according to claim 1, characterized in that: Also includes: The process of returning search results is as follows: First, refresh the preloaded data returned by the subtasks, and keep the load within one page; when the actual subtask returns data, refresh the page to display the actual subtask returned data; when the total number of search results returned by the subtask is reached, refresh the total number of search results on the page for display.

5. The method according to claim 4, characterized in that: During the process of returning search results, after the total number query subtask returns the total number of search results and refreshes the total number of search results on the page for display, it also includes: automatically loading the next page of data when the displayed data list scrolls to the end.

6. The method according to claim 1, characterized in that: The unfinished task threads include task threads that are currently executing but have not yet completed, and task threads that are waiting to be executed.

7. A high-efficiency retrieval device, characterized in that: Used to perform the method as described in any one of claims 1 to 6.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the method as described in any one of claims 1 to 6.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the method as described in any one of claims 1 to 6.

Images