US2018129605A1PendingUtilityA1

Information processing device and data structure

Assignee: TOSHIBA KKPriority: Mar 13, 2014Filed: Jan 3, 2018Published: May 10, 2018
Est. expiryMar 13, 2034(~7.6 yrs left)· nominal 20-yr term from priority
G06F 2212/154G06F 2212/305G06F 12/0813
54
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

An information processing device of an embodiment has an input unit, a storage unit, a read control unit, and a write control unit. A read request and a write request are input to the input unit. The storage unit stores management information. When the read request is input, the read control unit reads read data including the management information from the storage unit, references the management information, and outputs only non-zero data included in a predetermined range of a block row. The write control unit writes only non-zero data to the storage unit and updates the management information immediately before a start position of the continuous non-zero data started from a largest position in the continuous non-zero data started from a position smaller than the predetermined range, a last management information stored in the predetermined range, and the last management information in the predetermined range.

Claims

exact text as granted — not AI-modified
What is claimed is: 
     
         1 . A data structure of a block row provided with at least one or more blocks consisting of one or more elements,
 the data structure being provided with a management region which is a first region at a top of the data structure, separately from the block row which is a data region,   the data structure storing, in the management region which is the first region, a first management information representing a number of continuous non-zero data from a row head of the block row and a distance to next non-zero data, and   the data structure storing, at a corresponding positon in a layout of the block row, non-zero data having one or more non-zero elements in one block in the data region, and in a second region of zero data having all the elements in one block being zero and arranged immediately before the non-zero data, second management information representing a number of continuous non-zero data and a distance to next non-zero data.   
     
     
         2 . The data structure according to  claim 1 , wherein
 the second management information is stored in the second region of the zero data immediately before the continuous non-zero data.   
     
     
         3 . The data structure according to  claim 1 , wherein
 a plurality of pieces of the second management information are stored in the second region of the zero data immediately before the continuous non -zero data.   
     
     
         4 . The data structure according to  claim 1 , wherein
 the management region which is the first region is a storage region corresponding to one block.   
     
     
         5 . The data structure according to  claim 1 , wherein
 the second management information has a size that is same as a size of data stored in the block.   
     
     
         6 . The data structure according to  claim 1 , wherein
 the distance to the next non-zero data of the first management information represents a storage position of the second management information.   
     
     
         7 . The data structure according to  claim 3 , wherein
 when a plurality of pieces of the second management information exist, the distance to the next non-zero data of the first management information represents a storage position of any one of the plurality of pieces of the second management information.   
     
     
         8 . The data structure according to  claim 1 , wherein
 the first management information and the second management information have a same format.

Join the waitlist — get patent alerts

Track US2018129605A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.