Abstract: A computer-implemented method to estimate computing cost of database queries. The method includes receiving a query. The method also includes generating one or more access plans for the query. The method further includes dynamically generating a learning model based on each of the generated access plans. The method includes estimating, by the learning model and for each of the one or more access plans, a predicted cost to execute the query. The method includes selecting, based on the predicted cost, a first access path associated with a lowest cost of the predicted costs and executing the query according the selected access path.

Abstract: A method for calculating a shortest path, a routing acquisition device, a server and a non-transitory computer-readable storage medium are disclosed. The method may include: acquiring resource information for a network according to a received routing request, where the routing request includes a start node, an end node, a service constraint, and an obligatory constraint; calculating service constraint weights for topological elements in the network according to the service constraint, and calculating obligatory constraint weights for the topological elements according to the obligatory constraint and the resource information for the network; and calculating, according to the service constraint weights and the obligatory constraint weights for the topological elements, a shortest path from the start node to the end node that satisfies the obligatory constraint.

Abstract: A method, computer program product, and system for managing parallel microservices are provided. The method may include identifying information pertaining to each of a plurality of target microservices to be invoked by an issuer microservice, a predefined condition associated with the plurality of target microservices, and an action to be executed by the issuer microservice in response to the predefined condition being satisfied. The method may also include sending a first request to available target microservices of the plurality of target microservices based on the information pertaining to the respective available target microservices. The method may also include, in response to receiving a response to the first request from an available target microservice of the available target microservices, determining whether the predefined condition is satisfied, and in response to determining that the predefined condition is satisfied, causing the action to be executed by the issuer microservice.

Abstract: The invention provides a polyetheretherketone (PEEK) composite and a method of preparing same. The PEEK composite is prepared from 55-90 parts by mass of PEEK, 5-30 parts by mass zinc aluminum (ZA) alloy, 5-15 parts by mass graphite, 0.3-1 parts by mass graphene oxide (GO) and a processing additive. The PEEK composite is prepared by the following steps: putting the ZA alloy into an aqueous solution of a quaternary ammonium salt surfactant, ultrasonically dispersing, filtering, washing and drying; dissolving the GO in deionized water, dispersing the ZA alloy in deionized water, and adding a GO solution dropwise to a ZA alloy dispersion to obtain a GO/ZA alloy complex; mixing the PEEK, the GO/ZA alloy complex, the graphite and the processing additive, and drying at 100-120° C. for 3-4 h; and mixing in a mixer, and carrying out compression molding at 380-400° C.

Abstract: Edge device task management is provided. It is determined whether a subtask cancel and migrate plan exists when a request to run a higher priority subtask of a second plurality of subtasks corresponding to a second task is received while a first task comprised of a first plurality of subtasks is running on a first cluster of edge devices. In response to determining that the subtask cancel and migrate plan does exist, a lower priority subtask of the first plurality of subtasks is canceled from a designated edge device of the first cluster of edge devices based on the subtask cancel and migrate plan. The lower priority subtask is migrated to another edge device for running based on the subtask cancel and migrate plan. The higher priority subtask of the second plurality of subtasks is sent to the designated edge device of the first cluster of edge devices for running.

Abstract: A plurality of metadata corresponding to a plurality of code versions of an application stored in a version control system is generated. A determination is made of a set of changes between a first metadata of a first code version and a second metadata of a second code version. A classification is made of elements in the set of changes into a first category and a second category based on a set of predetermined rules, wherein the elements classified into the first category are better candidates to determine causes of defects in the application than the elements classified into the second category. The elements classified in the first category are used to determine a cause of a defect in the application.

Abstract: Leveraging the competence of a computing cluster and a storage cluster by dynamically adjusting an SQL (structured query language) execution path to optimize system performance with fast response time under a distributed relational database on a data storage platform. Also, endpoint devices are divided into groups for the purpose of responding to queries and/or query blocks. The most suitable group of endpoint devices is chosen to respond to a given query or query block.

Abstract: Leveraging the competence of a computing cluster and a storage cluster by dynamically adjusting an SQL (structured query language) execution path to optimize system performance with fast response time under a distributed relational database on a data storage platform. Also, endpoint devices are divided into groups for the purpose of responding to queries and/or query blocks. The most suitable group of endpoint devices is chosen to respond to a given query or query block.

Abstract: An embodiment includes determining, based on historical data associated with a specific task, a baseline bandwidth recommendation for completing the specific task. The embodiment assigns, for a first time period, the specific task to a first computing device on a network. The embodiment allocates, for the first time period based on the baseline bandwidth recommendation, a first baseline bandwidth to the first computing device. The embodiment allocates, for the first time period, a portion of a shared buffer bandwidth as a first buffer bandwidth to the first computing device based on a weight value assigned to the specific task. The first buffer bandwidth combines with the first baseline bandwidth as a first total bandwidth for the specific task. The embodiment throttles, during the first time period, data packets associated with the specific task based on the first total bandwidth for the specific task.

Abstract: A lightweight database-management system (DBMS) is based on a dynamic microservices architecture that implements each granular DBMS feature or function as a distinct, independently executable microservice. The DBMS's Parser front-end responds to each incoming query by selecting the first bind-time database feature needed to process the query. The Parser forwards its selection through a Channel-Binding subsystem to an Event Services Activation subsystem that activates a corresponding microservice to perform the selected feature. The first feature then selects the next required bind-time feature for activation, and this process continues sequentially until all required bind-time microservices have been identified, activated, and run. Runtime query-processing features are then sequentially selected in a similar manner. However, each selected runtime microservice is preloaded but not run.

Abstract: The present disclosure provides a computer-implemented method, computer system and computer program product for managing a task flow. According to the computer-implemented method, a definer module may receive a request for executing a task flow. The definer module may determine a cluster of edge devices to execute the task flow from a set of edge devices. The definer module may retrieve metadata information for the task flow and edge devices in the cluster, wherein the metadata information is used to schedule the task flow in the cluster. Then the edge devices in the cluster may execute the task flow according to the metadata information.

Abstract: A computer-implemented method, computer system and computer program product dynamically manage failure in an edge computing environment. According to the method, a request for executing a task may be sent to a first edge device according to a defined process, where the defined process is used to schedule tasks to be executed on edge devices. In response to the first edge device failing to execute the task, the defined process may be suspended. Then, a request for executing the task may be sent to a second edge device. A task result that is received first may be taken as the task result for the task, where the task result is from either the first edge device or the second edge device. And, continuing the rest of the defined process.

Abstract: Building and using multiple different types of sub-indices to search a database is provided. A plurality of different physical data ranges is generated within the database based on a set of logical hot data ranges and a set of logical non-hot data ranges to form a set of physical hot data ranges and a set of physical non-hot data ranges. A set of sub-index types is built for each respective data range of the plurality of different physical data ranges within the database using a set of selected high-speed sub-index types for the set of physical hot data ranges and another set of selected sub-index types for the set of physical non-hot data ranges to accelerate data availability for query. An index is built for the database using the set of sub-index types built for each respective data range of the plurality of different physical data ranges within the database.

Abstract: A method, system, and computer program product for using logical segments to help manage database tasks and performance for SQL parallelism. The method may include identifying a database object within a database resource of a database. The method may further include determining a database access method for the database object. The method may further include dividing data within the database object into a plurality of logical segments based on the database access method. The method may further include receiving a query for the database. The method may further include identifying the database object that corresponds to the query. The method may further include analyzing the logical segments of the database object. The method may further include distributing access to the database resource based on the logical segments of the database object.

Abstract: A method, computer program product, and system for managing parallel microservices are provided. The method may include identifying information pertaining to each of a plurality of target microservices to be invoked by an issuer microservice, a predefined condition associated with the plurality of target microservices, and an action to be executed by the issuer microservice in response to the predefined condition being satisfied. The method may also include sending a first request to available target microservices of the plurality of target microservices based on the information pertaining to the respective available target microservices. The method may also include, in response to receiving a response to the first request from an available target microservice of the available target microservices, determining whether the predefined condition is satisfied, and in response to determining that the predefined condition is satisfied, causing the action to be executed by the issuer microservice.

Abstract: Data segment-based indexing includes identifying data segments of a column of a database based on a data distribution of data of the column, indexing the data segments, including, for each data segment, determining an index type and creating an index of the determined index type, and building a composite link between indexes of a common index type, which indexes of the common index type include a created index, from indexing the data segments of the column, of the common index type and at least one other index, of the common index type, which is for other data segment(s), of other column(s) of the database, that have been indexed using the common index type. The composite link provides for parallel searching against the indexes in the group to search corresponding different data segments, in different columns of the database, indexed using the common index type.

Abstract: A method, computer system, and a computer program product may perform document reference and reference update. One or more processors may assign marker information for a reference of a reference source. The reference may reference a target portion of a target document. The one or more processors may determine identification information for the target portion. The determined identification information may be based on content in the target portion and context information for the target portion in the target document. The one or more processors may generate a mapping of at least the marker information, the identification information, and a relative location of the target portion within the target document for use in the referencing of the target portion by the reference source.

Abstract: An approach for distributed tracing is provided. The approach for distributed tracing comprises receiving a user request for a transaction by one or more processing units, and extracting feature data from the received user request by one or more processing units. Further, if the extracted feature data matches at least one policy generated based on at least one error response received from at least one service is determined by one or more processing units and the at least one service is instructed to collect tracing data for the transaction in a head-based fashion responsive to the extracted feature data matching at least one policy by one or more processing units.

Abstract: Embodiments of the present disclosure relate to policy-based request tracing in a distributed environment. In an embodiment, a computer-implemented method is disclosed. According to the method, a first set of requests and a second set of requests are determined in a plurality of received requests based on a policy. A first subset of requests is selected from the first set of requests based on a first sampling rate, and a second subset of requests is selected from the second set of requests based on a second sampling rate that is less than the first sampling rate. Executions of the first subset of requests and the second subset of requests on components of a distributed system are then traced. In other embodiments, a system and a computer program product are disclosed.

Abstract: An example operation may include one or more of connecting, by a virtual blockchain manager node, to a blockchain configured to store a plurality of user transactions committed by a user node, identifying, by the virtual blockchain manager node, a user request transaction from the plurality of the user transactions for a creation of a virtual blockchain for the user, wherein the user request transaction contains a rule, creating, by the virtual blockchain manager node, the virtual blockchain based on the user request transaction, populating, by the virtual blockchain manager node, the virtual blockchain with the user transactions from the plurality of the user transactions from the blockchain based on the rule, and executing, by the virtual blockchain manager node, a smart contract to record the rule and a hash of all blocks from the virtual blockchain onto the blockchain.