Design overview

This chapter will provide you with a short introduction in to HDF5 and its unerlying concepts as well as h5cpp’s approach how to map these concepts onto C++ classes.

h5cpp namespaces

In order to use h5cpp you need to include the hdf5.hpp header file like this

#include <h5cpp/hdf5.hpp>

This will pull in everything you need. The entire library is organized in several namespaces with a top level namespace hdf5

Every namespace contains classes associated with a particular aspect of the library and HDF5.

namespace	description
hdf5::property	namespace with property list implementations.
hdf5::attribute	contains all classes related to attributes and attribute management.
hdf5::datatype	datatypes and related utility functions. The classes in this namespace should not be confused with commited datatypes which are indeed nodes.
hdf5::node	the most imporant namespace providing all functionality to deal with nodes.
hdf5::dataspace	dataspaces and related utilities
hdf5::error	error management and exceptions
hdf5::file	everything releated to files

The top level namespace contains also some more esoteric classes like hdf5::ObjectId or ObjectHandle which we can savely ignore for now.

The most important classes in the top-level namspace might be hdf5::Dimensions which is a type alias of the form

using Dimensions = std::vector<hsize_t>;

in order to get rid of the rather nasty

hsize_t *dims;

which is heavily used throughout the C-API and thus a rather potential source for memory leaks. Using std::vector serves the same purpose but is far less easier to use and avoids problems with memory leaks.

A high level view on HDF5

Nodes, links, and paths

An HDF5 tree can be considered a tree of objects connected by links.

From a very high level point of view we can assume that there are two kind of objects

1. container objects (Group) which can store links to other object

2. leafe like objects which cannot hold links to other objects (Datasets and committed Datatypes).

Technically, we can refer to all of these objects as nodes and thus consider an HDF5 tree as a collection of nodes connected by links. h5cpp maps this hierachy of node types rather straight forward onto C++ classes like this

Hierarchy of node types in h5cpp.

with hdf5::node::Node being the top level class. The other classes represent the following HDF5 objects:

h5cpp class	HDF5 type
hdf5::node::Dataset	an HDF5 dataset
hdf5::node::Group	an HDF5 group
hdf5::node::Datatype	an HDF5 committed datatype

Important

Do not confuse hdf5::node::Datatype with hdf5::datatype::Datatype. Thoug the former one is constructed from the latter one, the latter one cannot be accessed via a path. A committed datatype is a means to store complex datatype within a file.

Each node can be augumented with attributes which can store meta-data related to a node

As attributes are common to all node types the Manager interface providing access to them is already exposed on the Node class.

Attributes are accessd via an attribute manager associated with each node instance.

To understand why every instance of Node also stores an instance of hdf5::node::Link we need to have a closer look on links

There are actually three kinds of links connecting objects within a file

• hard links which are created when a new object is created in a file

• soft links which can be used liks symbolic links on a file system to provide alternative means of access to an object

• external links providing a means to reference objects from a different file.

This concept introduces some kind of ambiguity as can be seen from the figure above. There are basically three tracks which lead to the same Dataset instance. This is a known problem in the HDF5 library and h5cpp has taken a rather pragmatic approach how to solve it as will be shown later.

Furthermore it is important to note that Nodes in an HDF5 file do not have names. This is an unfortunate widespread misconception about HDF5. Nodes can be accessed via a list of named links starting at the root node (root group) of a file but the Nodes themeselfes have no idea about a name. Which would not even make sense if we take the ambiguity shown above into account. Which of the three link chains leading to the Dataset instance would be the correct name of the Dataset?

We have chosen a rather pragmatic approach to solve this naming problem in h5cpp. However, before we can discuss this we have to take a little detour and introduce some more classes.

The list of link names used to access a particular object is in general refered to as the path to an object. h5cpp thus has a class hdf5::Path which represents such a list of link names. The string representation of a path looks quite like a Unix filesystem path. It is the list of names separated by /. In the above example two possible paths to the Dataset would be

/sensors/temp
/plot/y

Like for a Unix filesystem path an HDF5 path can be either absolute (starting with a / and thus at the root node of a given file) or relative to a particular node (no / at the beginning).

To represent links h5cpp provides the hdf5::node::Link class

As shown in this UML diagram hdf5::node::Link stores a reference to the file where the link resides in and the path. In other words, the Link class is a complete roadmap to a particular node.

Now, as shown previously, every Node also stores a reference to an instance of Link. This is the link (in particular the path) used to access the node. We thus solved the name ambiguity of an object by defining its name as the link (and thus the path) used to access the object. With this we are now able to ask a node for its name (path) and expect the path used to access the node.

Node IDs

After having solved the naming problem there is still an issue we have to solve. In the figure above we have seen that there are many paths that could lead to the same object. Now, if we do a recursive traversal over all nodes in a file we would face the problem that we get a copy of the same node several times. One for each path which leads to this object. We thus introduced the concept of a unique ID which is associated with every node. This ID identifies an object uniquely even over file boundaries and remains constant once a node has been created within a particular file. This ID is represented by the hdf5::ObjectId class. However, it is for internal use only and you usually do not have to care about it.

Attention

If you are familiar with HDF5s C-API do not confuse the unique ID introduced by h5cpp with the hid_t used in the C-API to reference an instance of an object. The latter one is rather a handler than an unqiue ID. IDs in h5cpp identify nodes uniquely even over file boundaries at least within the context of a program. While the value of hid_t can change after closing and re-opening the same object *h5cpp*s unique ID remains always the same.

Important

What you should take from this section are

• an HDF5 file constists of Nodes which are

  • Groups

  • Datasets

  • commited Datatypes

• which are connected via Links from which there are three kinds

  • hard links

  • soft links

  • and external links

• nodes can be augumented with Attributes which can be used to store additional metadata about a Node.

• Nodes do not have names, Links have.

• Paths are lists of link names referencing a node within a file

• every Node is associated with a unique ID which remains unique even over file boundaries

Data IO

Until now we have only considered structural aspects of an HDF5 file. The second and most probably most important topic is data IO. To understand how data IO works in HDF5 we first have to introduce a bit terminology.

From a rather high level point of view the smallest unit of information which can be accessed by HDF5 is a data element. Such a data element can be everything ranging from a single integer number up to complex types consisting of nested C-structs or C++ classes. A data element is stored in memory and/or on disk as a set of bits. In order to interpret these bits correctly and reassemble the stored data element we need some information about it. This information is provided in HDF5 by a datatype.

Data elements have some logical organization. For instance we can store these elements in a 2 dimensional array.

data elements of 3 numbers (could be a 3D vector) are stored in a 2 dimensional array with 5 elements along the first and 3 elements along the second dimensions.

The logical layout of data elements is described by a dataspace. Currently there are only two dataspaces available in HDF5

• a scalar space which can store only a single element

• and a simple space which is a regular n-dimensional array (as the one above).

Dataspaces and datatypes are the fundamental building blocks of all objects that can store data within an HDF5 file

• attributes

• and datasets

For the construction of either of them you have to provide a datatype and a dataspace. As a matter of fact, attributes and datasets are quite similar, though a dataset is a node type and can be accessed via a path. In addition, datasets are far more flexible than attributes as we will see soon.

We need to introduce the term storage as a rather abstract region of space where we can store data and which is contiguous and linear addressable. Technically such a storage can be implemented either

• in memory (as a contiguous region of memory)

• or on disk

where in the latter case it is not important for us how exactly the data is stored on disk (as a single block of data within a file or scattered over several blocks within a file).

We never have to care about the DiskStorage this is done by the HDF5 library. However, in some cases we need to care about the MemoryStorage. As far as it concerns this chapter we can consider both to satisfiy the above constraints.

We will have a look now how data transfer roughly works by using the above example. For the dataset under consideration we have

• a datatype comprising 3 double valus (3x8Bytes) and thus a total size of 24 Bytes

• and a dataspace of shape (3,5) where the last index varies fastest.

The MemoryStorage of such a dataset would look like this

Every data element occupies 24Byte. The numbers on the very left denote the memory offset in byte for the very left byte in the block. In the above figure the elements are represented in a 3x5 matrix to preserve space but in memory they would be aligend simply one after the other. It is the dataspace which associates the linear region of memory with a particular shape. By default C-style ordering, last index variest fastest, is used. As a matter of fact it is the job of the dataspace to map the multidimensional index of a particular element onto a linear address in the storage area.

Todo

add a figure here!

When data is written to disk, the content of the MemoryStorage is transfered to the DiskStorage. It is important to note that the dataspace of the latter one must not be equal to that of the memory storage. They must only have equal size (number of data elements). In addition, the data elements in memory must be convertable to those associated with the file storage. The same is true for the other direction when reading data from the disk.

Todo

add a figure here!

Selections and partial IO

One of the nice features of HDF5 is that we do not have to read or write the entire data from or to the disk. This is paticularly usefull if the total amount of data available in a dataset would not fit in the memory of the computer which wants to access the data. We can distinguish between

• point selections where individual data elements can be picked in an arbitrary pattern

• and hyperslab selections which are regular multidimensional slices. Hyperslabs roughly compare to what you can do with array indices and slices on numpy arrays in Python.

With a point selection we could for instance read the elements (0,2), (1,3) and (2,0) and store them in a either a new memory storage of size 3 (which would be 72Bytes in total) or in a more sophisticated setup we could map them on points (0),(5) and (11) in a 1D array in memory.

Todo

add a figure here

Important

The following concepts are important and thus should be kept in mind for further reading

• a Datatype describes a single data element (no matter how complex it might be)

• a Dataspace describes how data elemets are layed out in memory

• all data is store in Dataspaces and Attributes (the interfaces are quite simliar but attributes have some limitations)

• Selections make it possible to read only a particular part of a Dataset