| Dynamic multipaging in even less space |
| Full text |
Pdf
(359 KB)
|
| Source
|
ACM SIGMOD Record
archive
Volume 17 , Issue 4 (December 1988)
table of contents
Pages: 56 - 61
Year of Publication: 1988
ISSN:0163-5808
|
|
Authors
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 5, Citation Count: 1
|
|
|
ABSTRACT
We present an improvement to the directory structure of dynamic multipaging which reduces the overall storage requirement from The outstanding advantage of multipaging is that it provides multi-attribute access to a database file using directories of negligible size. The present improvement makes the directory size even more negligible and the addressing algorithm easier.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
1. R. Bayer & E. M. McCreight, 1972. Organization and maintenance of large ordered indices. Acta Informatica 1 3, 173-89.
|
| |
2
|
2. W. Litwin, 1980. Linear hashing: a new tool for file and table addressing. Proc. VLDB6, 212-23.
|
| |
3
|
3. T. H. Merrett, 1978. Multidimensional paging for efficient database querying. Proc. ICMOD '78, Internat. Conf. on Data Base Management Systems, FAST, Milano, Italy (29-30 June, 1978) 277-90.
|
| |
4
|
|
| |
5
|
5. T. H. Merrett & E. J. Otoo, 1982. Dynamic multipaging: a storage structure for large shared data banks in Peter Scheuermann ed. Improving Database Usability and Responsiveness, Academic Press, 237-55.
|
 |
6
|
|
| |
7
|
7. E. J. Otoo & T. H. Merrett, 1983. A storage scheme for extendible arrays. Computing 21. 1-9.
|
 |
8
|
|
| |
9
|
9. A.L. Rosenberg, 1975. Managing storage for extendible arrays. SLAM Journal of Comp. 4 5, 287-306.
|
 |
10
|
|
| |
11
|
11. A.L. Rosenberg & L.J. Stockmeyer, 1976b. Storage schemes for boundedly extendible arrays. Acta Informatica 7 3, 289-303.
|
|