No date buffering is performed during ncvarget and
ncvarput operations.
Hyperslabs too large too hold in core memory will suffer substantial
performance penalties because of this.
Since coordinate variables are assumed to be monotonic, the search for
bracketing the user-specified limits should employ a quicker algorithm,
like bisection, than the two-sided incremental search currently
implemented.
C_format, FORTRAN_format, signedness,
scale_format and add_offset attributes are ignored by
ncks when printing variables to screen.
In the late 1990s it was discovered that some random access operations
on large files on certain architectures (e.g., UNICOS) were
much slower with NCO than with similar operations performed
using languages that bypass the netCDF interface (e.g., Yorick).
This may be a penalty of unnecessary byte-swapping in the netCDF
interface.
It is unclear whether such problems exist in present day (2007)
netCDF/NCO environments.