Cited By
View all- Rosenberg A(1977)On storing concatenable arraysJournal of Computer and System Sciences10.1016/S0022-0000(77)80010-X14:2(157-174)Online publication date: Apr-1977
The use of hashing schemes for storing extendible arrays is investigated. It is shown that extendible hashing schemes whose worst-case access behavior is close to optimal must utilize storage inefficiently; conversely hashing schemes that utilize ...
Efficient storage utilization by schemes which allocate storage for extendible arrays is studied. A minimax lower bound on efficiency of storage use by such schemes is derived; and a scheme which achieves this bound is exhibited. When arrays are ...
The high costs of extendibility in array realizations can be reduced dramatically by placing a bound on how big the arrays of interest will grow. Whereas extendible array realizations require order of p · log p storage locations to store two-...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in