Overview[]
Data granularity refers to the fineness with which data fields are sub-divided. Higher granularity has overheads for data input and storage. This manifests itself in a higher number of objects and methods in the object-oriented programming paradigm or more subroutine calls for procedural programming and parallel computing environments. It does however offer benefits in flexibility of data processing in treating each data field in isolation if required. A performance problem caused by excessive granularity may not reveal itself until scalability becomes an issue.
| This page uses Creative Commons Licensed content from Wikipedia (view authors). | 
|