VectorMap is a generic mapping between integer ID and variable length array of elements as data elements. To achieve storage and runtime efficiency it places all the data in a single balanced tree. See multistream balanced tree for problems and solutions.

Conceptually VectorMap is very close to file systems without directories. It was designed to support very large data values efficiently. But unlike file systems, VectorMap provides insertion/deletion to/in data value in O(log N) time. To the best of the author's knowledge no file system provides such features.