Using time stamps for storing and addressing extendible arrays (Q1072711)

This paper presents a method for storing rectangular arrays (or their n-dimensional equivalent), which allows arbitrary extensibility of arrays (i.e. extensibility for each dimension independently of the other dimensions) at comparatively low costs (as to both the amount of auxiliary information and the time complexity of algorithms). Thereafter this method will be generalized by adding the operations of inserting and deleting hyper-planes and adding new dimensions.