912 results about "Shard" patented technology

A defragmentation technique determines the extent to which data blocks of a file are fragmented on disks of a computer and, in response, efficiently relocates those blocks if such relocation improves the on-disk layout of the file. Each indirect block of the file is examined and the current layout of the range of pointers referencing the data blocks is determined. In addition, the number of operations needed to retrieve those data blocks from disks is calculated. A potential new layout is then estimated based on an average fullness of the file system. If the potential new layout improves the fragmentation of the current layout, then the data blocks for that range are relocated, if there is sufficient free space on disk. Otherwise, the blocks are not relocated and the current on-disk layout of the file is maintained.

A file shard store includes high performance encoding and compaction circuits. An apparatus and its method of operation avoids duplicate storage of file fragments. A plurality of tables control write operations into a plurality of log segments. Shard keys are transferred to uniquely identify fragments of files which may have been previously stored and associated with one or more of client subscribers. An apparatus comprises a plurality of location / subscription tables, a shard transfer circuit, a storage control circuit, an append-to-log circuit coupled to a large storage array, and a log segment compactor circuit.

The present invention relates to a distributed storage scheme, the distributed storage scheme, every file is encrypted, interleaved and fragmented, and the various fragments are stored on different constituent physical file systems.

A method and system for creating, reading and writing compressed files for use with a file access storage. The compressed data of a raw file are packed into a plurality of compressed units and stored as compressed files. One or more corresponding compressed units may be read and / or updated with no need for restoring the entire file whilst maintaining de-fragmented structure of the compressed file.

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.

A nonvolatile storage device can read and write data by receiving a logical address from a host. The nonvolatile storage device includes: a nonvolatile memory writing and reading data based on a physical address; a logical / physical conversion table storing information on correspondence between the logical address and the physical address for each of a plurality of data management units; a duplication table storing information on correspondence between the logical address and the physical address of data arranged over a plurality of areas in a duplicate (redundant) manner in the nonvolatile memory and having a size smaller than a size of a data management unit; and a controller controlling an operation of the nonvolatile storage device. The controller permits duplicate (redundant) writing of data having a same logical address as the data (which has been written in one data management unit in another data management unit), and the controller performs a plurality of write modes for the duplicate (redundant) writing, and selectively switches between the write modes according to situation of a logical address change designated by the host.

Use situations of storage devices utilizing a storage area network (SAN) are predicted and the devices are automatically managed on the basis of the predicted results. To manage the devices utilizing the SAN, there is established the policy prescribing actions each executed when some object to be judged satisfies some condition with regard to storage devices. Information concerning use situations of the devices is collected and a value of an object to be judged of the policy is calculated based on collected information to judge whether the value of the object to be judged satisfies a condition of the policy. When the condition is satisfied, the action of the policy is executed. The objects to be judged of the policy may be actual result values in the past, current values or prediction values in the future relative to use capacity of storages, the number of I / O operations of disk or fragmentation.

The invention discloses a method for achieving mobile phone user behavior portraits based on informationized labels and relates to the technical field of communication. Data association integration of different systems is achieved through client mobile phone numbers from the service level by means of data acquired by telecom operators, the informationized labels are pasted for users, and fragmented user data becomes comprehensible valuable data facilitating computer program processing. The informationized labels are pasted for the users, and the fragmented user data becomes the comprehensible valuable data facilitating computer program processing. Through label features of the user portraits, the pairing relation between market resources and user demands is integrated, and industry application aiming at user behavior data is achieved.

A sharded, permissioned, distributed ledger may reduce the amount of work and communication required by each participant, thus possibly avoiding scalability bottlenecks that may be inherent in previous distributed ledger implementations and possibly enabling the use of additional resources to translate to increased throughput. A sharded, permissioned, distributed ledger may be made up of multiple shards, each of which may also be a distributed ledger and which may operate in parallel. Participation within a sharded, permissioned, distributed ledger may be allowed only with permission of an authority. A sharded, permissioned, distributed ledger may include a plurality of nodes, each including a dispatcher configured to receive transaction requests from clients and to forward received requests to verifiers configured to append transactions to individual ones of the shards.

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.

The invention provides a video playing method, device and system, electronic equipment and a storage medium. The method is applied to a browser, and comprises the steps: obtaining a video address and a video key from a media server according to a video playing request; acquiring a data stream of a to-be-played video through the video address; decrypting the data stream frame by frame by using the video key to obtain to-be-played data; and playing the to-be-played data which is processed to be in the playable format on a webpage of a browser. According to the embodiment of the invention, the video data adopts a streaming frame-by-frame encryption and decryption mode, and compared with a fragmentation encryption mode, the mode of the invention has the advantages that file fragments can be effectively reduced, the playing time delay is reduced, and the playing effect is improved.

The invention discloses a method and device for data distribution of a shared-nothing distributed database, and relates to the technical field of communication. The problem that the performance of the database is reduced due to the fact that most data need to be migrated between shards after the database is expanded is solved. The method specifically comprises the steps of configurating first shard identifications for the shards contained in the database, storing the data to be stored in the corresponding shards according to the first shard identifications, configurating second shard identifications for newly-added shards according to the shard with the largest data size after the database is expanded, and migrating the partial data stored in the shard with the largest data size to the shards corresponding to the second shard identifications for storage. The method and device for the data distribution of the shared-nothing distributed database can be applied to management of the distributed database.