2424 results about "Block (data storage)" patented technology

A redundant array of independent disk (RAID) memory storage system comprising data storage blocks arranged in a first plurality of data rows and a second plurality of data columns, wherein parity data is stored in additionally defined parity blocks, and wherein numbers of data blocks in respective columns are different, to accommodate the additional diagonal parity data block that the geometry of the system requires. The system is suitable for an SSD array in which sequential disk readout is not required.

The application discloses a data storage and query method and device based on a block chain. The method comprises the following steps: after receiving a service request sent by a user, a block chain node can resolve each data category and service data corresponding to each data category from the service request, and stores the resolved service data in a database corresponding to the block chain node according to a corresponding relation of the data category and the service data. By resolving the service data, the service data can be stored to the database corresponding to the block chain node according to the corresponding relation between the data category and the service data; therefore, the user can realize the query based on the corresponding relation in the database when querying the service data, a problem existent in the query based on the query in the existing block chain is avoided, the flexibility of the data query in the block chain is increased, and the data query efficiency is effectively improved.

A file system maintains a series of read-only snapshot copies of a production file system. A read-write snapshot copy is created based on a selected read-only snapshot copy by maintaining a set of save volume blocks of new data of the read-write snapshot copy. A block of new data is written to the read-write snapshot copy by allocating a save volume block and writing to the save volume block. A specified block is read from the read-write snapshot copy by checking whether there is a respective save volume block allocated to the specified block, and if so, reading from the respective save volume block, and if not, reading from the read-only snapshot copy upon which the read-write snapshot copy is based. The read-write snapshot copy can be refreshed with a specified read-only snapshot copy. The production file can be restored with a specified read-write snapshot copy.

A method of redundancy coding of user data received from a host apparatus and storage of said coded data on a magnetic tape data storage medium comprises inputting a byte stream of user data into a buffer and assembling a plurality of data sets in the buffer; for each data set assembling a data set into a two-dimensional data array and (1103) applying a second redundancy coding algorithm (C2 parity) to the two-dimensional data set in a second dimension; applying (1105) a first redundancy coding (C1 parity) algorithm to the second redundancy coded data array in a first dimension to form a two-dimensional data frame having second and first redundancy coding in respective second and first dimensions, the two-dimensional data frame comprising a plurality of rows, each row comprising a first codeword and a plurality of columns, each column comprising a second codeword; partitioning the two-dimensional data frame into a plurality of logical track blocks (1106) each comprising a plurality of first codewords; and recording (1110) each logical track block to a corresponding respective physical track on the magnetic tape data storage medium. Redundancy coding of a data frame is distributed across a plurality of other data frames along the tape, and redundancy bytes of each data frame are distributed across a plurality of data tracks. Redundancy coding may be distributed diagonally across a width of the tape. Data obliterated due to damage to individual physical recorded tracks or sections of tracks on the tape may be recovered from redundant coding data distributed across other adjacent parallel physical tracks on the tape.

The invention provides a method for deleting repeated data by using double-fingerprint hash check. The method comprises the following steps of: dividing an object to be backed up into data blocks to be backed up with equal lengths; judging whether the weak fingerprint of one of the data blocks to be backed up is the same as the weak fingerprint of any data block in a server; if the weak fingerprint of one of the data blocks to be backed up is different from the weak fingerprint of any data block in the server, backing up the data block; if the weak fingerprint of one of the data blocks to be backed up is the same as the weak fingerprint of any data block in the server, judging whether the strong fingerprint of the data block is the same as the strong fingerprint of any data block in the server; if the strong fingerprint of the data block is different from the strong fingerprint of any data block in the server, backing up the data block; and performing the operation on all data blocks to be backed up. In the method for deleting the repeated data, a hash function with low calculation amount is adopted at the first time to perform weak check on every data block and a has function with high calculation amount is adopted then to perform strong check, so the problem that all the data are checked by the hash function with the high calculation amount is avoided, the fingerprint calculation amount during checking is reduced greatly, the series performance is enhanced, and the appreciable transmission performance is provided for data backup based on mass data storage.

The invention relates to the field of a Flash memory, particularly a data storage structure of a Flash memory. A storage unit on each page comprises a data storage space for storing data and a spare space, wherein the spare space is defined into the following parts: a file name recording area, a page name recording area, a page storage state recording area, a page state recording area, a block erase counter recording area and a data check code recording area. The data manipulation mode of the data storage structure of a Flash memory specifically comprises a system initialization step and a data manipulation step, wherein the data manipulation step comprises storage space allocation and release operation, anti-power-down protection operation, abrasion balancing operation, bad block processing and data check operation. The invention optimizes the data storage structure of a Flash memory and the data manipulation control mode thereof, balances the Flash memory in the read-write operation, carries out anti-powder-down processing and designs an ECC (Error Correction Code) processing mechanism, thereby avoiding the defects of the existing Flash.

The invention discloses a data storage system, a circulating method and a tracing method of distributed commodities based on a block chain and relates to the field of data tracing. The system is deployed by adopting a league chain mode and comprises multiple super-nodes and multiple common nodes. The data storage system, the circulating method and the tracing method of the distributed commoditiesbased on the block chain solve the problem of non-transparent transaction data in current commodity production and circulation chains, reduce trust friction between enterprises and trust friction between enterprises and supervision departments by utilizing the characteristic that the block chain cannot be tampered, solves the problem of big storage pressure of a centralized tracing platform as thedetail information of the production and circulation links are stored in databases of each enterprise node dispersedly and guarantees the data to be not tampered arbitrarily by the enterprises through the Hash codes, solves the problem of tracing data incompleteness and responsibility positioning difficulty of a supply chain as all the information in the whole life cycle is recorded by regardingthe tracing codes as core and combining with means such as box code association and mobile payment, the responsible party can be positioned rapidly when a quality problem occurs and a recall notice can be sent to related enterprises and related consumers.

The invention relates to a method for deleting duplicated data in a file system in real time, and belongs to the technical field of computer data storage. In a file system establishment stage, a file metadata table, a data block index and a file constitution table are set in an embedded database; and in a file system operation stage, operating commands initiated to the file system by applications are received and responded through a file system driver, and include establishing a new file, writing data to an existing file, reading data from the existing file and deleting the existing data. The method simultaneously supports fixed-length and variable-length file blocking methods, and can delete the duplicated data in the file system in real time, save storage space and improve the utilization efficiency of storage equipment; and the process of deleting the duplicated data is completely transparent to the applications and a user, the file operation of various conventional applications is seamlessly compatible, and almost all negative effects on the user experience are avoided.

The invention discloses a data trading system based on a block chain and an implementation method thereof. The invention comprises a data collector, a background application management module, a blockchain data storage module based on a federation chain, a block chain data transaction module based on a public chain, and a user display terminal. The data collector interacts with the background application management system, The block chain storage module stores the data obtained by the collector in a distributed manner, and the block chain data transaction module stores the information and transaction information exchanged between the data collector and the background application management system in a decentralized manner and controls the transaction flow, and the user operates the user display terminal. The invention can encourage data providers to participate in data flow and reduce data acquisition barriers, protect the rights and interests of data providers and make full use of data value. It solves the contradiction between the high efficiency of data transaction and the high cost of current block chain. Data pricing strategies are implemented in a more concise, efficient, and executable manner.

The invention discloses an electronic data storage method based on a block chain intelligent contract, which comprises the steps of raw data uploading, slicing, storing, issuing, data structure defining, anchoring, writing, calling, returning and comparing and verifying. The method utilizes an intelligent contract and a block chain technology, and has features of decentralization, open transparency, unalterable properties, easy traceability and data trustworthiness. By slicing and storing the electronic data in a distributed way, the method solves the problems of serious centralization and long and complex data of an existing electronic data storage method, improves the security of the user data, records the electronic data stored in each customer certificate in the block, traces each electronic data, facilitates the user to supervise the data security, and the like.

The invention relates to a method for the protection and recovery of continuous data stored in a time-stamp diary, which pertains to a computer data storage and backup method and aims at reducing the time of processing a write operation and a recovery operation and increasing processing parallelism. The method comprises the steps that: (1) a storage area is divided into a source data area and a continuous data protection area; a Hush mapping table is initialized; (2) a user command is judged, and the write operation is carried out sequentially; the recovery operation is carried out as the step (4); (3) the write operation is processed; by adopting a production line strategy, a copy operation and a new write operation are carried out in parallel; a source data record is inserted into the Hush mapping table; the step (2) is carried out; (4) the recovery operation is processed, and the source subdata block record needing copying is searched in the Hush mapping table; corresponding source subdata block record is written into the source data area by adopting the production line strategy; then the step (2) is carried out. The proposal of time-stamp diary storage is adopted in the invention; the production line strategy is adopted when the write operation and the recovery operation are processed; therefore, write operation processing time and target recovery time are shorter.

A data storage device includes a write cache, a non-volatile memory, and a controller coupled to the write cache and to the non-volatile memory. The controller is configured to, responsive to receiving a command to flush particular data from the write cache, attempt to fill a write block of data using the particular data and pending data obtained after receipt of the command.

The invention relates to a disk array data reconstruction method which pertains to a computer data storage method and solves the problem that the existing disk array data reconstruction method takes too much time and affects the reading and writing performances and reliability of a storage system. A disk array of the invention is provided with a main control module, reading and writing processing modules and a reconstruction module and comprises the steps of initialization, diary pot diagram update, reconstruction based on diaries and finishing. The method instructs data reconstruction process by the real-time monitoring of disk space using status of the disk array; when space that is not accessed is reconstructed, the only requirement is to write 0 in all corresponding data blocks newly added into a disk, thus greatly reducing physical disk visiting time brought by reconstruction, increasing reconstruction speed and reducing the response time of user access; the reconstruction method does not change the reconstruction procedure or the distribution manner of disk array data, can conveniently optimize various traditional disk array data reconstruction methods and is applicable to the construction of storage systems with high performance, high usability and high reliability.

A data storage system that is based on a unique configuration of hardware and collection of open source software. In a preferred networked implementation, the system includes a plurality of data storage servers arranged in a cluster and each being accessible via a network switch to an external network. Each data storage server includes a communications bus, disk drives, network adaptor, and control software. The control software consists essentially of only open source software, including the EXT3 node file system, GNU Privacy Guard (GPG) security, domain name system (DNS) IP addressing, an enterprise volume management system (EVMS), heartbeat monitoring, NFS and CIFS network protocols, data replication block device (DRBD) data mirroring, a distributed lock manager (DLM), a general file system (GFS) and Andrew file system (AFS), AND open single system image (SSI) software.

The invention discloses a business data storage and acquisition method and a related device. The method comprises: obtaining set business data by a block chain application service platform, performingmulti-level encryption on the set service data to obtain a target hash value, and performing uplink storage on the target hash value according to the category to which the set service data belongs. According to the technical scheme provided by the invention, after multi-level encryption is carried out on the set service data, uplink storage is carried out according to the category to which the set service data belongs, so that the safety of the service data and the orderliness of data storage are improved.

The invention discloses a house renting platform and network fingerprint electronic door lock system comprising a cloud end system, a data storage system, a block chain storage system, a tenant clientend, a landlord client end, and an electronic lock; the house renting platform and network fingerprint electronic door lock system can effectively check the landlord and tenant ID information, and uses the tenant fingerprint as the key; the system is easy to use, can record the tenant renting process, and can form a tenant credit file.

A method and device for managing multiple snapshots of data storage device is provided. A method of backing up multiple snapshots includes determining whether to perform a copy on write (COW) operation when a write or update operation is performed on a data block of the storage medium, backing up original data of the data block of recording the original data in a snapshot storage location when it is determined to perform the COW operation, and recording snapshot mapping information of recording a time and a physical address (PA) in which the original data is recorded in the snapshot storage location in a linked list (LL) corresponding to a logical address (LA) of the data block.

Write operations less than full block size (short block writes) are internally accumulated while being written to disk in a temporary cache location. Once written to the cache location, the disk drive signals the host that the write operation has completed. Accumulation of short block writes in the drive is transparent to the host and does not present an exposure of data loss. The accumulation of a significant number of short block write operations in the queue make it possible to perform read/modify/write operations with a greater efficiency. In operation, the drive preferably cycles between operation in the cache location and the larger data block area to achieve efficient use of the cache and efficient selection of data access operations. In one embodiment, a portion of the disk surface is formatted at a smaller block size for use by legacy software.

A method and apparatus for enhanced data storage in peer-to-peer (P2P) networks. Users subscribe to a P2P storage network that allows each user to store files on the storage network by swapping blocks of the user's files with blocks from storage of a peer, or peers, on the network. A user desiring to utilize the storage network for a certain data block must take back an equal, or substantially equal, storage block from another peer on the network thereby insuring no net change, or minimal net change, in total storage across the P2P storage network. In addition, the diffusion of data blocks throughout the storage network is employed whereby individual peers swap data blocks on a random basis thereby further enhancing the security of the swapped blocks from direct attacks.

A matrix data access method is disclosed that includes following steps: the data storage space containing the presetting high-dimensional matrix is processed by dimensionality reduction to convert into two-dimensional matrix data storage space, and the two-dimensional matrix data storage space is divided into the separated two-dimensional matrix data storage subspace; the storage type of data in the high-dimensional matrix data storage subspace: the high-dimensional matrix is reduced to low-dimensional matrix, the storage type in every two-dimensional matrix data storage subspace: from left to right, from upper to lower, stored according to the modulus; the two-dimensional sub matrix data storage space is mapped to several physical memories in the data storage model, the data in data block of the two-dimensional sub matrix data storage space is read from the corresponding address of every memory in the several memories according to the matching requirements. The invention also provides a matrix data storage device. The invention is high storage effect and can satisfy the requirements for storing the various types of data.