Data Block

In computing (specifically data transmission and data storage), a block, sometimes called a physical record, is a sequence of bytes or bits, usually containing some whole number of records, having a fixed length; a ''block size''. Data thus structured are said to be ''blocked''. The process of putting data into blocks is called ''blocking'', while ''deblocking'' is the process of extracting data from blocks. Blocked data is normally stored in a data buffer, and read or written a whole block at a time. Blocking reduces the overhead and speeds up the handling of the data stream. For some devices, such as magnetic tape and CKD disk devices, blocking reduces the amount of external storage required for the data. Blocking is almost universally employed when storing data to 9-track magnetic tape, NAND flash memory, and rotating media such as floppy disks, hard disks, and optical discs.

Most file systems are based on a block device, which is a level of abstraction for the hardware responsible for storing and retrieving specified blocks of data, though the block size in file systems may be a multiple of the physical block size. This leads to space inefficiency due to internal fragmentation, since file lengths are often not integer multiples of block size, and thus the last block of a file may remain partially empty. This will create slack space. Some newer file systems, such as Btrfs and FreeBSD UFS2, attempt to solve this through techniques called block suballocation and tail merging. Other file systems such as ZFS support variable block sizes.

Block storage is normally abstracted by a file system or database management system (DBMS) for use by applications and end users. The physical or logical volumes accessed via ''block I/O'' may be devices internal to a server, directly attached via SCSI or Fibre Channel, or distant devices accessed via a storage area network (SAN) using a protocol such as iSCSI, or AoE. DBMSes often use their own block I/O for improved performance and recoverability as compared to layering the DBMS on top of a file system.

On Linux the default block size for most file systems is 4096 bytes. The command part of GNU Core Utilities can be used to check the block size.

In Rust a block can be read with the method.

const BLOCK_SIZE: usize = 4096;

if let Ok(mut file) = File::open("example.bin")

In Python a block can be read with the method.

BLOCK_SIZE = 4096

with open("example.bin", "rb") as file:
block = file.read(BLOCK_SIZE)

In C# a block can be read with the class.

const int BLOCK_SIZE = 4096;

using FileStream stream = File.Open("example.bin", FileMode.Open);
var block = new byte LOCK_SIZE
await stream.ReadAsync(block, 0, BLOCK_SIZE);

References

{{reflist, refs=
{{cite news , author= , title=Available hard drive space, block sizes, and size terminology , newspaper=CNET , date=2009-05-05 , url=http://www.cnet.com/news/available-hard-drive-space-block-sizes-and-size-terminology/ , access-date=2014-04-29
{{cite web , author-last=Chang , author-first=S. K. , title=Physical Structures , work=Captain SK , url=http://people.cs.pitt.edu/~chang/156/08struct.html , access-date=2014-04-29
{{cite news , author-first=Rachel , author-last=Balik , title=Bruning Questions: ZFS Record Size , newspaper=Joyent , date=2013-03-29 , url=https://www.joyent.com/blog/bruning-questions-zfs-record-size/ , access-date=2013-03-29
{{cite news , author-first=Roch , author-last=Bourbonnais , title=Tuning ZFS recordsize , date=2006-06-07 , newspaper=Oracle , url=https://blogs.oracle.com/roch/tuning-zfs-recordsize
{{citation , title=Planning a Computer System – Project Stretch , author-first1=Gerrit Anne , author-last1=Blaauw , author-link1=Gerrit Anne Blaauw , author-first2=Frederick Phillips , author-last2=Brooks, Jr. , author-link2=Frederick Phillips Brooks, Jr. , author-first3=Werner , author-last3=Buchholz , author-link3=Werner Buchholz , editor-first=Werner , editor-last=Buchholz , editor-link=Werner Buchholz , publisher= McGraw-Hill Book Company, Inc. / The Maple Press Company, York, PA. , lccn=61-10466 , date=1962 , chapter=4: Natural Data Units , pages=39–40 , chapter-url=http://archive.computerhistory.org/resources/text/IBM/Stretch/pdfs/Buchholz_102636426.pdf , access-date=2017-04-03 , url-status=live , archive-url=https://web.archive.org/web/20170403014651/http://archive.computerhistory.org/resources/text/IBM/Stretch/pdfs/Buchholz_102636426.pdf , archive-date=2017-04-03 , quote= ��Terms used here to describe the structure imposed by the machine design, in addition to ''bit'', are listed below.
''Byte'' denotes a group of bits used to encode a character, or the number of bits transmitted in parallel to and from input-output units. A term other than '' character'' is used here because a given character may be represented in different applications by more than one code, and different codes may use different numbers of bits (i.e., different byte sizes). In input-output transmission the grouping of bits may be completely arbitrary and have no relation to actual characters. (The term is coined from ''bite'', but respelled to avoid accidental mutation to ''bit''.)
A ''word'' consists of the number of data bits transmitted in parallel from or to memory in one memory cycle. Word size is thus defined as a structural property of the memory. (The term '' catena'' was coined for this purpose by the designers of the Bull {{ill, Bull Gamma 60{{!GAMMA 60, fr, Gamma 60 computer.)
''Block'' refers to the number of words transmitted to or from an input-output unit in response to a single input-output instruction. Block size is a structural property of an input-output unit; it may have been fixed by the design or left to be varied by the program. ��}

Articles with example C Sharp code
Articles with example Python (programming language) code
Articles with example Rust code
Computer data storage
Data transmission