Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

906 results about "Shard" patented technology

A database shard is a horizontal partition of data in a database or search engine. Each individual partition is referred to as a shard or database shard. Each shard is held on a separate database server instance, to spread load.

Hot spot analysis of IMS databases

A method and system for analyzing the physical characteristics of database records, such as in IMS databases. The information obtained during this analysis may then be used to perform a more efficient reorganization or restructuring of the database. In one embodiment, the method involves tracing the database retrieval process to collect physical location information for each segment of each database record in an IMS database. The database retrieval process for each database record may begin at the root segment of the database record and traverse the child segments of the database record, preferably in hierarchical order, e.g. top to bottom, left to right. The database retrieval process identifies the segment code causing the first reference to a block and the number of segments retrieved from the block before fetching a new block. The physical location information for each segment of each database record in the IMS database may be analyzed to identify one or more segments which represent a fragmented boundary twin chain. Two calculations may be performed for those segments which are boundary twin chains. If the total number of physical blocks currently used to hold the boundary twin chain exceeds the minimum number of physical blocks needed to hold the boundary twin chain by a pre-determined amount, the boundary twin chain may be determined to be fragmented. Similar calculations may be performed for the database record. A reorganization recommendation list for the database record may be created in response to determining whether the database record is fragmented.
Owner:BMC SOFTWARE

Optimized deploying method based on virtual cluster online migration

InactiveCN106020934AOvercome the defect that the expected amount of requested resources cannot be obtainedReduce performance lossProgram initiation/switchingSoftware simulation/interpretation/emulationVirtualizationShard
The invention relates to an optimized deploying method based on virtual cluster online migration, and belongs to the cloud computing technical field; the method comprises the following steps: using a management module to connect with a management cluster node, wherein the management module is provided with an overall monitoring module, an algorithm forming module, a migration planning module and a migration driving module; using the overall monitoring module to receive the cluster node and virtual machine information data in the cloud computing environment, and sending the information to the algorithm forming module so as to predict future loads and build a long term load performance model; planning a deploying strategy for the virtual cluster, and sorting the virtual machines in the virtual cluster into different host nodes of the cluster, thus allowing the virtual machines to fully utilize the host resources in the cluster when the virtual cluster migration is finished. The novel method can solve the problems that the virtualization technology may easily cause resource fragments, and can solve the defects that the virtual machines cannot obtain the expected requesting resource quantity when the dynamic loading demands and the virtual machines are combined, thus reducing virtual machine performance loss in the cluster nodes, and improving resource utilization rate.
Owner:LANGCHAO ELECTRONIC INFORMATION IND CO LTD

Data processing method, system and device based on node group and medium

The invention relates to a data processing method, system and device based on a node group and a medium. The method is executed by one first node in a node group, and comprises the following steps: constructing a mapping relationship according to a local first user identifier, wherein the mapping relationship is used for mapping the first user identifier into a target value; carrying out homomorphic encryption on the mapping parameters of the mapping relation to obtain a mapping parameter ciphertext, and transmitting the mapping parameter ciphertext to a second node in the node group; receiving a reference value and fragment information correspondingly fed back by the second node; when a result obtained after homomorphic decryption is performed on the reference value is consistent with a target value, retaining the fragment information fed back corresponding to the reference value, triggering one of the first nodes in the node group to collect the fragment information retained in eachof the first nodes, and performing aggregating according to the collected fragment information to obtain a user identifier intersection between the nodes in the node group and aggregating user data corresponding to the user identifier intersection. According to the method, the data security during intersection solving of multi-party data can be ensured.
Owner:TENCENT TECH (SHENZHEN) CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products