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 have been shown in the accompanying drawings, it is to 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, but are provided to provide a more thorough and complete understanding of the present disclosure. 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 understood that the various steps recited in the method embodiments of the present disclosure may be performed in a different order and/or performed in parallel. Furthermore, method embodiments may include additional steps and/or omit performing the illustrated steps. The scope of the present disclosure is not limited in this respect.
The term "including" and variations thereof as used herein are intended to be open-ended, i.e., including, but not limited to. The term "based on" is based at least in part on. The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments. Related definitions of other terms will be given in the description below.
It should be noted that the terms "first," "second," and the like in this disclosure are used merely to distinguish one device, module, or unit from another device, module, or unit, and are not intended to limit the order or interdependence of the 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 names of messages or information interacted between the various devices in the embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.
The present disclosure provides an index construction method, apparatus, electronic device, and computer readable medium, which aim to solve the above technical problems in the prior art.
The following describes the technical solutions of the present disclosure and how the technical solutions of the present disclosure solve the above technical problems in detail with specific embodiments. The following embodiments may be combined with each other, and the same or similar concepts or processes may not be described in detail in some embodiments. Embodiments of the present disclosure will be described below with reference to the accompanying drawings.
In an embodiment provided in the present disclosure, the index building method may be applied to a data processing system, as shown in fig. 1, where the data processing system may include a plurality of node devices 110 and a server 120, and the index building method is applied to the server 120, as shown in fig. 2, and includes:
Step S201, data to be processed and nodes corresponding to the data to be processed are obtained.
Step S202, determining a master node in the nodes, and determining nodes except the master node as slave nodes;
Step 203, the data to be processed is sent to the master node, so that the master node constructs an index corresponding to the data to be processed according to the data to be processed;
Step S204, receiving the storage path of the index sent by the master node;
Step S205, transmitting the storage path to each slave node, so that each slave node loads the index according to the storage path, and obtains the data to be processed according to the index.
In step S201, data to be processed and nodes corresponding to the data to be processed are acquired.
In the embodiment of the disclosure, when the data processing system processes the data, the data is fragmented, and for each piece of data, a group of node devices can process the data, and the group of node devices can process a plurality of pieces of data at the same time; each node corresponding to the data to be processed refers to each node in the node equipment corresponding to the data fragment to which the data to be processed belongs.
For the embodiment of the present disclosure, for the data to be processed, each node corresponding to the data to be processed is obtained, for convenience of explanation, and for the data to be processed a, a specific embodiment is taken as an example, each node corresponding to the data to be processed a is obtained, where each node is used for processing the data a.
In step S202, one master node is determined among the nodes, and nodes other than the master node are determined as slave nodes.
In the embodiment of the disclosure, after each node corresponding to data to be processed is determined, one master node is determined among the nodes, and the remaining nodes are determined as slave nodes.
For the embodiment of the disclosure, the master node and the slave nodes may be determined in a preset manner, where only one master node and all nodes except the master node in the remaining nodes are slave nodes. For convenience of explanation, taking a specific embodiment as an example, the nodes corresponding to the data to be processed a are a1, a2, and a3, and if the node a1 is determined to be the master node, the nodes a2 and a3 are slave nodes, where the determination manner of the master node will be described in the following embodiments.
In step S203, the data to be processed is sent to the master node, so that the master node constructs an index corresponding to the data to be processed according to the data to be processed.
In the embodiment of the disclosure, an index is required to be constructed for the data to be processed, so that each node can conveniently inquire the data to be processed.
For the embodiment of the disclosure, after determining a master node corresponding to the data to be processed, the data to be processed is sent to the master node, and after receiving the data to be processed, the master node constructs an index of the data to be processed, stores the index, and determines a storage path.
In step S204, a storage path of the index transmitted by the master node is received.
In the embodiment of the disclosure, after the index is built, the master node stores the index, determines a storage path of the index, sends the storage path to the server, and the server receives the storage path.
In step S205, the storage path is sent to each slave node, so that each slave node loads the index according to the storage path, and obtains the data to be processed according to the index.
In the embodiment of the disclosure, after receiving the storage path sent by the master node, the server sends the storage path to the slave node, and after receiving the storage path, the slave node loads an index according to the storage path, so that the slave node can conveniently acquire data to be processed according to the index.
According to the embodiment of the disclosure, by acquiring the nodes corresponding to the data and determining one master node and a plurality of slave nodes in the nodes, only the master node is required to construct the index for the data needing to be constructed, after the master node constructs the index, other slave nodes can load the index according to the storage path of the index, update of all node indexes is realized, only one machine is required to construct the index, resources can be greatly saved, CPU use is reduced, and system performance is improved.
One possible implementation manner provided by the embodiment of the present disclosure, determining a master node among nodes, and determining nodes other than the master node as slave nodes, includes:
step S301, obtaining the connection establishment time between a server and each node;
Step S302, determining a master node and a slave node according to the sequence of the time when the server establishes connection with each node.
In step S301, the time for the server to establish a connection with each node is acquired.
In the embodiment of the disclosure, each node needs to be connected with a server, the server records the time for each node to be connected with the server, and when the master node and the slave node need to be determined, the time for each node to be connected with the server is acquired.
In step S302, the master node and the slave node are determined according to the order of the times when the server establishes a connection with each node.
In the embodiment of the disclosure, after acquiring the connection establishment time between each node and the server, the server determines the node which is first connected with the server as a master node and the rest nodes as slave nodes according to the connection establishment time sequence.
For the embodiment of the disclosure, for convenience of explanation, taking a specific embodiment as an example, the nodes corresponding to the data to be processed a are a1, a2, a3, when the server needs to determine the master node and the slave node, the server obtains the time for establishing connection between the nodes a1, a2, a3 and the server, if the node a2 is first connected with the server, the node a2 is determined to be the master node, and the nodes a1 and a3 are determined to be the slave nodes. Of course, in a specific embodiment, the specific number of nodes may be configured or adjusted according to the actual application requirement and the actual application scenario, which is not limited in this disclosure.
According to the embodiment of the disclosure, the time for establishing connection between the server and each node is obtained, the master node and the slave nodes are determined according to the sequence of the established connection time, and the node which is connected with the server first is determined as the master node, so that the master node builds an index of the proxy processing data, the condition of node waiting is avoided, and the node resource is utilized maximally.
The embodiment of the disclosure provides a possible implementation manner, when a master node fails, a new master node is determined in slave nodes according to the sequence of the time when the server establishes connection with each node.
In the embodiment of the disclosure, the master node device may fail, and when the master node device fails, a new master node needs to be determined in each slave node.
For the embodiment of the disclosure, when a master node fails, one slave node which is connected with a server first is determined as the master node according to the sequence of connection establishment between each slave node and the server. For convenience of explanation, taking the foregoing embodiment as an example, when the master node a2 fails, the time for the slave nodes a1 and a3 to establish connection with the server is obtained, and if the time for the node a1 to establish connection with the server is earlier than a3, the node a1 is determined to be a new master node, and the node a3 is still a slave node.
When the master node fails, the embodiment of the disclosure determines one slave node which is connected with the server first as a new master node according to the time for establishing connection between the slave node and the server, so as to ensure that the system cannot fail.
In one possible implementation manner provided by the embodiment of the present disclosure, the index construction method provided by the embodiment of the present disclosure further includes:
in step S401, index loading state information sent by the slave node is acquired, where, for any slave node, the index loading state information is sent by the slave node after completing index loading according to the storage path.
In the embodiment of the disclosure, the node status is used for indicating the working status of each node, each node can send its working status to the server in real time, and the server receives the working status of each node.
For the disclosed embodiments, the node states may include, but are not limited to: in creating an index, loading an index, waiting for switching an index, loading an index is completed, and switching an index is completed.
In step S402, according to the index loading status information of each slave node, the master node and each slave node are controlled to perform index update of the data to be processed based on the index.
In the embodiment of the disclosure, after receiving the working state sent by each node, the server adjusts the working of each node according to the working state, so that each node completes updating the index.
For the embodiment of the present disclosure, for convenience of explanation, taking a specific embodiment as an example, when the state that the master node sends to the server is index creation completion, and when the state that each slave node sends to the server is waiting for index loading, the server sends a storage path of the index to each slave node, so that each slave node loads the index according to the path.
The server in the embodiment of the disclosure determines the work of each node according to the work state by receiving the work state of each node, so that each node completes index updating.
In one possible implementation manner provided by the embodiment of the present disclosure, controlling, according to a node state, a master node and a slave node to update indexes according to indexes includes:
and when the node states sent by the master node and the slave node are the states to be updated by the index, controlling the master node and the slave node to update the index according to the index.
In the embodiment of the present disclosure, the state to be updated refers to a state that a node has loaded an index and waits for updating the index, and when the node states sent by the master node and the slave node are both states to be updated, the master node and the slave node are controlled to update the index according to the index.
For the embodiment of the present disclosure, for convenience of explanation, taking the foregoing embodiment as an example, when the node states sent by the nodes a1, a2, a3 to the server are all states to be updated, the server controls the nodes a1, a2, a3 to update the index.
According to the embodiment of the disclosure, by acquiring the nodes corresponding to the data and determining one master node and a plurality of slave nodes in the nodes, only the master node is required to construct the index for the data needing to be constructed, after the master node constructs the index, other slave nodes can load the index according to the storage path of the index, update of all node indexes is realized, only one machine is required to construct the index, resources can be greatly saved, CPU use is reduced, and system performance is improved.
The implementation of the present disclosure also provides a data processing method, as shown in fig. 5, where the data processing method includes:
In step S501, a data query request sent by a node is received, where the data query request includes an index of data, where the index is constructed by using the above-mentioned index construction method.
In the embodiment of the disclosure, for data to be processed, each node may query the data according to an index of the data to be processed, and when the node needs to query the data to be processed, send a target data query request to the server, where the target data query request includes the index of the target data, and the index is constructed according to the index construction method of any one of the foregoing optional embodiments.
In step S502, the target data is acquired according to the index, and the target data is sent to the node.
In the embodiment of the disclosure, the server sends the query result of the target data to the node according to the index of the target data in the target query request, and completes the query of the data. Wherein the query result may be data.
In the data processing method provided by the embodiment of the present disclosure, the index provided by the foregoing embodiment is used to query data, so that the index update speed is fast, CPU resources are saved, and system performance is improved.
Embodiments of the present disclosure provide an index building apparatus, as shown in fig. 6, the index building apparatus 60 may include: a first information acquisition module 601, a node determination module 602, a second information acquisition module 603, an index storage module 604, and an index information transmission module 605, wherein,
The first information acquisition module is used for acquiring data to be processed and nodes corresponding to the data to be processed;
the node determining module is used for determining a master node in the nodes and determining nodes outside the master node as slave nodes;
The second information acquisition module is used for sending the data to be processed to the master node so that the master node constructs an index corresponding to the data to be processed and receives a storage path of the index sent by the master node;
The index storage module is used for receiving the storage path of the index sent by the master node;
And the index information sending module is used for sending the storage path to the slave node so that the slave node loads the index according to the storage path to acquire the data to be processed according to the index.
Optionally, when the node determining module 602 determines a master node among the nodes and determines a node other than the master node as a slave node, it may be used to:
acquiring the time for establishing connection between a server and each node;
and determining the master node and the slave nodes according to the sequence of the time for establishing connection between the server and each node.
Optionally, when the node determining module determines a master node among the nodes and determines each node other than the master node as a slave node, the node determining module may be configured to:
when the master node fails, a new master node is determined in the slave nodes according to the sequence of the time when the server establishes connection with each node.
Optionally, the index building device may further include an index update control module, where the index update control module may be configured to:
receiving node states sent by a master node and a slave node;
and controlling the master node and the slave node to update the index of the data to be processed according to the index according to the node state.
Optionally, when the master node and the slave node are controlled to update indexes according to the node states, the index update control module may be configured to:
and when the node states sent by the master node and the slave node are the states to be updated by the index, controlling the master node and the slave node to update the index according to the index.
The index construction device according to the embodiments of the present disclosure may perform the index construction method shown in the foregoing embodiments of the present disclosure, and the implementation principle is similar, and will not be described herein.
According to the embodiment of the disclosure, by acquiring the nodes corresponding to the data and determining one master node and a plurality of slave nodes in the nodes, only the master node is required to construct the index for the data needing to be constructed, after the master node constructs the index, other slave nodes can load the index according to the storage path of the index, update of all node indexes is realized, only one machine is required to construct the index, resources can be greatly saved, CPU use is reduced, and system performance is improved.
The disclosed embodiment provides a data processing apparatus, as shown in fig. 7, the data processing apparatus 70 includes: a data query request receiving module 701, and a data query module 702, wherein,
The data query request receiving module is used for receiving a target data query request sent by a node, wherein the target data query request comprises an index of target data, and the target data is constructed by adopting the index construction method;
and the data query module is used for sending a target data query result to the node according to the target data query request.
The data processing device according to the embodiments of the present disclosure may perform the data processing method shown in the foregoing embodiments of the present disclosure, and the implementation principle is similar, and will not be described herein.
Referring now to fig. 8, a schematic diagram of an electronic device (e.g., node device or server of fig. 1) 800 suitable for use in implementing embodiments of the present disclosure is shown. The terminal devices in the embodiments of the present disclosure may include, but are not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and the like, and stationary terminals such as digital TVs, desktop computers, and the like. The electronic device shown in fig. 8 is merely an example and should not be construed to limit the functionality and scope of use of the disclosed embodiments.
An electronic device includes: a memory and a processor, where the processor may be referred to as a processing device 801, hereinafter, the memory may include at least one of a Read Only Memory (ROM) 802, a Random Access Memory (RAM) 803, and a storage device 808, as shown in detail below:
as shown in fig. 8, the electronic device 800 may include a processing means (e.g., a central processor, a graphics processor, etc.) 801, which may perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 802 or a program loaded from a storage means 808 into a Random Access Memory (RAM) 803. In the RAM 803, various programs and data required for the operation of the electronic device 800 are also stored. The processing device 801, the ROM 802, and the RAM 803 are connected to each other by a bus 804. An input/output (I/O) interface 805 is also connected to the bus 804.
In general, the following devices may be connected to the I/O interface 805: input devices 806 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, and the like; an output device 807 including, for example, a Liquid Crystal Display (LCD), speakers, vibrators, etc.; storage 808 including, for example, magnetic tape, hard disk, etc.; communication means 809. The communication means 809 may allow the electronic device 800 to communicate wirelessly or by wire with other devices to exchange data. While fig. 8 shows an electronic device 800 having various means, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead.
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 non-transitory computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via communication device 809, or installed from storage device 808, or installed from ROM 802. The above-described functions defined in the methods of the embodiments of the present disclosure are performed when the computer program is executed by the processing device 801.
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: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.
In some embodiments, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (HyperText Transfer Protocol ), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.
The computer readable medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device.
The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: acquiring data to be processed and nodes corresponding to the data to be processed; determining a master node in the nodes, and determining nodes except the master node as slave nodes; the data to be processed is sent to a main node, so that the main node constructs an index corresponding to the data to be processed; receiving a storage path of an index sent by a main node; and sending the storage path to the slave node so that the slave node loads the index according to the storage path to acquire the data to be processed according to the index.
Computer program code for carrying out operations of the present disclosure may be written in one or more programming languages, including, but not limited to, an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming 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 functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on 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.
According to one or more embodiments provided by the present disclosure, there is provided an index construction method including:
acquiring data to be processed and nodes corresponding to the data to be processed;
determining a master node in the nodes, and determining nodes except the master node as slave nodes;
The data to be processed is sent to a main node, so that the main node constructs an index corresponding to the data to be processed;
Receiving a storage path of an index sent by a main node;
and sending the storage path to the slave node so that the slave node loads the index according to the storage path to acquire the data to be processed according to the index.
Further, determining a master node among the nodes, and determining nodes other than the master node as slave nodes, includes:
acquiring the time for establishing connection between a server and each node;
and determining the master node and the slave nodes according to the sequence of the time for establishing connection between the server and each node.
Further, the method further comprises:
when the master node fails, a new master node is determined in the slave nodes according to the sequence of the time when the server establishes connection with each node.
Further, the method further comprises:
receiving node states sent by a master node and a slave node;
and controlling the master node and the slave node to update the index of the data to be processed according to the index according to the node state.
Further, controlling the master node and the slave node to update indexes according to the node state, including:
and when the node states sent by the master node and the slave node are the states to be updated by the index, controlling the master node and the slave node to update the index according to the index.
According to one or more embodiments provided by the present disclosure, there is provided a data processing method including:
Receiving a target data query request sent by a node, wherein the target data query request comprises an index of target data, and the index of the target data is constructed by adopting the index construction method;
And sending a target data query result to the node according to the target data query request.
According to one or more embodiments provided by the present disclosure, there is provided an index building apparatus including:
The information acquisition module is used for acquiring data to be processed and nodes corresponding to the data to be processed;
the node determining module is used for determining a master node in the nodes and determining the nodes except the master node as slave nodes;
The index construction module is used for sending the data to be processed to the main node so as to enable the main node to construct an index corresponding to the data to be processed;
the index storage module is used for receiving the storage path of the index sent by the main node;
and the index loading module is used for sending the storage path to the slave node so that the slave node loads the index according to the storage path to acquire the data to be processed according to the index.
Optionally, when the node determining module 602 of the index building apparatus provided in the embodiment of the present disclosure determines a master node among the nodes and determines a node other than the master node as a slave node, the node determining module may be configured to:
acquiring the time for establishing connection between a server and each node;
and determining the master node and the slave nodes according to the sequence of the time for establishing connection between the server and each node.
Optionally, the index building device provided by the embodiment of the present disclosure may further be used to:
when the master node fails, a new master node is determined in the slave nodes according to the sequence of the time when the server establishes connection with each node.
Optionally, the index building device provided by the embodiment of the present disclosure may further be used to:
receiving node states sent by a master node and a slave node;
and controlling the master node and the slave node to update the index of the data to be processed according to the index according to the node state.
Optionally, when controlling the master node and the slave node to update the index according to the node state, the index constructing device provided in the embodiment of the present disclosure may be further configured to:
and when the node states sent by the master node and the slave node are the states to be updated by the index, controlling the master node and the slave node to update the index according to the index.
According to one or more embodiments provided by the present disclosure, there is provided a data processing apparatus including:
The data query request receiving module is used for receiving a target data query request sent by a node, wherein the target data query request comprises an index of target data, and the target data is constructed by adopting the index construction method;
and the data query module is used for sending a target data query result to the node according to the target data query request.
According to one or more embodiments provided by the present disclosure, there is provided an electronic device including:
one or more processors;
A memory;
One or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the one or more processors, the one or more applications configured to: the index construction method and/or the data processing method described above are executed.
According to one or more embodiments provided by the present disclosure, there is provided a computer readable medium storing at least one instruction, at least one program, code set, or instruction set, the at least one instruction, at least one program, code set, or instruction set being loaded and executed by a processor to implement the foregoing index construction method and/or data processing method.
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 persons skilled in the art that the scope of the disclosure referred to in this disclosure is not limited to the specific combinations of features described above, but also covers other embodiments which may be formed by any combination of features described above or equivalents thereof without departing from the spirit of the disclosure. Such as those described above, are mutually substituted with the technical features having similar functions disclosed in the present disclosure (but not limited thereto).
Moreover, although operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order. In certain circumstances, multitasking and parallel processing may be advantageous. Likewise, while several specific implementation details are included in the above discussion, these should not be construed as limiting the scope of the present disclosure. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are example forms of implementing the claims.