The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
An array grammar programming system
Communications of the ACM
Toward an understanding of data structures
Communications of the ACM
Dynamic multipaging in even less space
ACM SIGMOD Record
Hashing Schemes for Extendible Arrays
Journal of the ACM (JACM)
Sharing Extendible Arrays in a Distributed Environment
IICS '01 Proceedings of the International Workshop on Innovative Internet Computing Systems
Efficient Pairing Functions - And Why You Should Care
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Hashing schemes for extendible arrays (Extended Abstract)
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Managing storage for extendible arrays (Extended Abstract)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
An extendible multidimensional array system for MOLAP
Proceedings of the 2006 ACM symposium on Applied computing
History offset implementation scheme for large scale multidimensional data sets
Proceedings of the 2008 ACM symposium on Applied computing
IBM Journal of Research and Development
An incremental maintenance scheme of data cubes
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Implementing vertical splitting for large scale multidimensional datasets and its evaluations
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
EaCRS: an extendible array based compression scheme for high dimensional data
Proceedings of the Second Symposium on Information and Communication Technology
An extendible array based implementation of relational tables for multi dimensional databases
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Chunked extendible dense arrays for scientific data storage
Parallel Computing
| Hi-index | 0.00 |
Arrays are among the best understood and most widely used data structures. Yet even now, there are no satisfactory techniques for handling algorithms involving extendible arrays (where, e.g., rows and/or columns can be appended dynamically). In this paper, the problem of allocating storage for extendible arrays is examined in the light of the author's earlier work on data graphs and addressing schemes. A formal analog of the assertion that simplicity of array extension precludes simplicity of traversal (marching along rows/columns) is proved. Two strategies for constructing extendible realizations of arrays are formulated, and certain inherent limitations of such realizations are established.