A multidimensional digital hashing scheme for files with composite keys

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A multidimensional digital hashing scheme for files with composite keys

Full text

Pdf (1.32 MB)

Source

International Conference on Management of Data archive
Proceedings of the 1985 ACM SIGMOD international conference on Management of data table of contents

Austin, Texas, United States

Pages: 214 - 229

Year of Publication: 1985

ISBN:0-89791-160-1

Also published in ...

Author

Ekow J. Otoo

School of Computer Science, Carleton University, Ottawa, Canada

Sponsor

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 17, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/318898.318918 What is a DOI?

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	Alfred V. Aho , Jeffrey D. Ullman, Optimal partial-match retrieval when fields are independently specified, ACM Transactions on Database Systems (TODS), v.4 n.2, p.168-179, June 1979 [doi>10.1145/320071.320074]
	2	Azad Bolour, Optimality Properties of Multiple-Key Hashing Functions, Journal of the ACM (JACM), v.26 n.2, p.196-210, April 1979 [doi>10.1145/322123.322126]
	3	Walter A. Burkhard, Interpolation-based index maintenance, Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems, March 21-23, 1983, Atlanta, Georgia [doi>10.1145/588058.588070]
	4	Ronald Fagin , Jurg Nievergelt , Nicholas Pippenger , H. Raymond Strong, Extendible hashing—a fast access method for dynamic files, ACM Transactions on Database Systems (TODS), v.4 n.3, p.315-344, Sept. 1979 [doi>10.1145/320083.320092]
	5	Peter Kjellberg , Torben U. Zahle, Cascade Hashing, Proceedings of the 10th International Conference on Very Large Data Bases, p.481-492, August 27-31, 1984
	6	Larson, P Lmear hashmg with partial expamuon Proc 6th Znt'l Conf on Very Lurge Datakes, Montrcal(l980), ~?4-232
	7	Per-Åke Larson, A Single-File Version of Linear Hashing with Partial Expansions, Proceedings of the 8th International Conference on Very Large Data Bases, p.300-309, September 08-10, 1982
	8	Larson, P Lmear hashing with hnear probing Technscal Report No CS-83-38, Uncveruaty of Waterloo, (Jan. 1 QW
	9	Lrtwm, W Linear hashing a new tool for files and table addressing Proc 6th Zntl Conf on Very Large Databases Montnal (Ott 1980), U16-22.9
	10	Merrett, T H and Otoo, E J Dynamic multlpaging a storage structure for large shared data banks Proc Int 1 Conf on Databases Impronng Uaababty and Responstveness P Scheunrmann cd, Academsc Press (198g), i?87-H6
	11	Mulhn, J K Tightly controlled hnear hashmg without separate overflow storage. Bat gl (1981), SQO-400.
	12	J. Nievergelt , Hans Hinterberger , Kenneth C. Sevcik, The Grid File: An Adaptable, Symmetric Multikey File Structure, ACM Transactions on Database Systems (TODS), v.9 n.1, p.38-71, March 1984 [doi>10.1145/348.318586]
	13	Ekow Joseph Otoo, Low level structures in the implementation of the relational algebra, 1984
	14	Otoo, E J and Merrett, T H Dynamic multlpagmg a storage structure for fast assoclatlve searching Technc- cal Report No SCS-TR-56, School of Computer Scsenc, Carleton Unaveraaty, (SubmItted to Act Injormatua)
	15	Ekow J. Otoo, A Mapping Function for the Directory of a Multidimensional Extendible Hashing, Proceedings of the 10th International Conference on Very Large Data Bases, p.493-506, August 27-31, 1984
	16	Otoo, E J A method for assoclatlve searching usmg mdex tries Technrcal Report, School of Computer Sctence, Carleton Unaversaty, Ottawa,
	17	Mohamed Ouksel , Peter Scheuermann, Storage mappings for multidimensional linear dynamic hashing, Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems, March 21-23, 1983, Atlanta, Georgia [doi>10.1145/588058.588071]
	18	Rive&, R L Partial-match retrieval algonthms. SIAM J of Comput 5, 1 (1976), 1940
	19	Rosenberg, A L Managing storage for extendible arrays SIAM J Comput 4, 3 (Sept 1975), #?87-306
	20	James B. Rothnie, Jr. , Tomas Lozano, Attribute based file organization in a paged memory environment, Communications of the ACM, v.17 n.2, p.63-69, Feb. 1974 [doi>10.1145/360827.360831]
	21	Michel Scholl, New file organization based on dynamic hashing, ACM Transactions on Database Systems (TODS), v.6 n.1, p.194-211, March 1981 [doi>10.1145/319540.319564]
	22	Tammmen, M The EXCELL method for effiiclent geometrlc access to data Acta Polytechntca Scandtnavwa, Mathematwe and Computer Sctence Senes No 84, Helsanhs, (1981)