Abstract: Provided is a process for determining a number of parallel threads for a request. The process involves receiving availability data regarding processing resources, wherein the availability data indicates which processing resources are idle or are to become idle. Based on the availability data, a number of parallel threads for the request is determined.

Abstract: A method, a master database node and a subscriber database node for optimizing an index. The method for optimizing index includes: checking, by a master database node, if role information of an index matches role information of the master database node, when the index is added into the master database node; updating database information by using the index when the role information of the index matches the role information of the master database node. In this invention, unnecessary indexes in the master database node and the subscriber database node are reduced while keeping the schema the same. Furthermore, unnecessary logs transmitted from the master database node to the subscriber database node are reduced.

Abstract: Method, device, and system for peer-to-peer data replication are provided. The method includes: generating a first commit redo record attached with a CSN when a first write operation happens on a first physical entity in a master node, wherein the master node is preset with the first physical entity and a second physical entity and is connected to a first subscriber node and a second subscriber node; pushing, the first commit redo record to a first subscriber node corresponding to the first physical entity based on mapping relationships between the physical entities and the subscriber nodes, wherein the first commit redo record is used for replicating data of the first write operation from the master node to the first subscriber node, and then to the second subscriber node through pushing, by the first subscriber node, the received first commit redo record to the second subscriber node.

Abstract: Provided is a process for determining a number of parallel threads for a request. The process involves receiving availability data regarding processing resources, wherein the availability data indicates which processing resources are idle or are to become idle. Based on the availability data, a number of parallel threads for the request is determined.

Abstract: A method, a master database node and a subscriber database node for optimizing index. The method for optimizing index includes: checking, by a master database node, if role information of an index matches role information of the master database node, when the index is added into the master database node; updating database information by using the index when the role information of the index matches the role information of the master database node. In this invention, unnecessary indexes in the master database node and the subscriber database node are reduced while keeping the schema the same. Furthermore, unnecessary logs transmitted from the master database node to the subscriber database node are reduced.

Abstract: A method, a master database node and a subscriber database node for optimizing index. The method for optimizing index includes: checking, by a master database node, if role information of an index matches role information of the master database node, when the index is added into the master database node; updating database information by using the index when the role information of the index matches the role information of the master database node. In this invention, unnecessary indexes in the master database node and the subscriber database node are reduced while keeping the schema the same. Furthermore, unnecessary logs transmitted from the master database node to the subscriber database node are reduced.

Abstract: A method and system for optimizing replication in a distributed network is described. The instant invention allows for determining existing cluster topology of the network by one or more router(s) device(s) operating in the network, identifying and optimizing a data replication stream/service in use in network, by said router(s); determining a routing scheme based on the cluster topology by the router routing data packets though said network based on said routing scheme and applying predefined policy to a predefined set of router(s) corresponding to identified data replication stream by the router.

Abstract: A debugging method is proposed in the disclosure. A computer running a program generates a master core dump file and one or more slave core dump files in response to a triggering event such as an internal failure. The core dump files are analyzed by another computer for debugging the program. The master core dump file includes an index list, and each entry of the index list corresponds to a slave core dump file of the one or more slave core dump files. The master core dump file can be the first to be transferred to the other computer. Based on the information in the index list, the other computer selectively requests one or more slave core dump files from the generated slave core dump files for debugging.

Abstract: A method for backing up data in a database system relates to dynamically monitoring usage of resources such as central processing unit (CPU), memory, and network bandwidth in order to utilize them in an optimal manner in the backup process, based on the current usage of resources. A resource monitoring subsystem is configured to monitor the usage of network, CPU and memory on a server, on which both the database and backup/restoring process of data is in progress.

Abstract: A method and an apparatus of maintaining data for online analytical processing in a database system. The method includes: tracking a changed page in a main process; and synchronizing the changed page to a child process for online analytical processing. In the method and apparatus of maintaining data for online analytical processing, the changed pages are tracked and then the child process is synchronized with the changed pages. Therefore, periodic forking is avoided, fork overhead due to periodic forking in the prior art is removed, the synchronization is faster since only the changed pages are synchronized, and the performance of online data processing is enhanced.

Abstract: An apparatus and method for creating user defined variable size tags on records in relational database management systems (RDBMS)are disclosed. When creating a table, one of the columns may be created as a new data-type called a “TAG” data-type. The new data-type called “TAG” is used to store various values for a single column against the single record.

Abstract: A method for optimizing query execution comprises receiving one or more optimizing parameters from a user device for optimizing a query execution plan. The one or more optimizing parameters comprise at least one of a query statement, a planning time and a plan execution time. The one or more optimizing parameters are received when duration of execution of the one or more queries using the query execution plan is greater than a predefined time period required for executing the one or more queries. The query execution plan is latest of one or more query execution plans for executing one or more queries. The method comprises generating an optimized query execution plan by iterating optimization of the query execution plan until the optimization satisfies the one or more optimizing parameters.

Abstract: A system and method for multi-master synchronous replication optimization, which comprises one device in a system is chosen as insert leader during insert. The insert leader allocates a range of rows (row_ids) to the incoming queries. If the query inserts more records than the range, it is rolled back. During the commit, the row_id range and the new records are sent to other masters for conflict checking. The present disclosure scalability and a throughput of the system is increased because of optimistic concurrency based replication.

Abstract: A system and method for parallel optimization of database query using cluster cache improves the performance of group by aggregates by avoiding the merge phase of parallel aggregation with the use of dynamic clustering and by caching the clustering information and storing them in local memory of worker thread. The caching of cluster information is based on user configuration to avoid overuse of system memory.

Abstract: The invention relates to a sorting method (1100), the sorting method comprising: sorting (1101) the distributed input data locally per processing node (701, 702) by deploying first processes on the processing nodes (701, 702) to produce a plurality of sorted lists on the local memory partitions (401, 402, 403, 404) of the processing nodes (701, 702); creating (1102) a sequence of range blocks (703, 704, 713, 714) on the local memory partitions of the processing nodes (701, 702), copying (1103) the plurality of sorted lists to the sequence of range blocks (703, 704, 713, 714); and reading (1105) the sorted elements from the sequence of range blocks (703, 704, 713, 714) sequentially with respect to their range to obtain the sorted input data.

Abstract: A debugging method is proposed in the disclosure. A computer running a program generates a master core dump file and one or more slave core dump files in response to a triggering event such as an internal failure. The core dump files are analyzed by another computer for debugging the program. The master core dump file includes an index list, and each entry of the index list corresponds to a slave core dump file of the one or more slave core dump files. The master core dump file can be the first to be transferred to the other computer. Based on the information in the index list, the other computer selectively requests one or more slave core dump files from the generated slave core dump files for debugging.

Abstract: A method and system for optimizing replication in a distributed network is described. The instant invention allows for determining existing cluster topology of the network by one or more router(s) device(s) operating in the network, identifying and optimizing a data replication stream/service in use in network, by said router(s); determining a routing scheme based on the cluster topology by the router routing data packets though said network based on said routing scheme and applying predefined policy to a predefined set of router(s) corresponding to identified data replication stream by the router.

Abstract: A method and an apparatus of maintaining data for online analytical processing in a database system. The method includes: tracking a changed page in a main process; and synchronizing the changed page to a child process for online analytical processing. In the method and apparatus of maintaining data for online analytical processing, the changed pages are tracked and then the child process is synchronized with the changed pages. Therefore, periodic forking is avoided, fork overhead due to periodic forking in the prior art is removed, the synchronization is faster since only the changed pages are synchronized, and the performance of online data processing is enhanced.

Abstract: A method, a master database node and a subscriber database node for optimizing index. The method for optimizing index includes: checking, by a master database node, if role information of an index matches role information of the master database node, when the index is added into the master database node; updating database information by using the index when the role information of the index matches the role information of the master database node. In this invention, unnecessary indexes in the master database node and the subscriber database node are reduced while keeping the schema the same. Furthermore, unnecessary logs transmitted from the master database node to the subscriber database node are reduced.

Abstract: Method, device, and system for peer-to-peer data replication are provided. The method includes: generating a first commit redo record attached with a CSN when a first write operation happens on a first physical entity in a master node, wherein the master node is preset with the first physical entity and a second physical entity and is connected to a first subscriber node and a second subscriber node; pushing, the first commit redo record to a first subscriber node corresponding to the first physical entity based on mapping relationships between the physical entities and the subscriber nodes, wherein the first commit redo record is used for replicating data of the first write operation from the master node to the first subscriber node, and then to the second subscriber node through pushing, by the first subscriber node, the received first commit redo record to the second subscriber node.