The Community for Technology Leaders
Green Image
Issue No. 08 - Aug. (1986 vol. 12)
ISSN: 0098-5589
pp: 801-810
David Hung-Chang Du , Department of Computer Science, University of Minnesota, Minneapolis, MN 55455
This paper introduces a hashing-based dynamic file structure for partial match retrieval using overflow bucket sharing. The sharing of overflow buckets is dynamic in the sense than an overflow bucket is shared by a varying number of primary buckets according to the local conditions of the file. Compared to previously published results, this file organization is space efficient and is time efficient for queries in which the number of specified attributes are small. These are exactly the types of queries which require substantial amount of retrieval times.
Organizations, Vectors, Indexes, Computer science, Educational institutions, Manganese, Large Hadron Collider, physical design, Database management, file organization, information storage and retrieval

D. H. Du, "Dynamic file structure for partial match retrieval based on overflow bucket sharing," in IEEE Transactions on Software Engineering, vol. 12, no. , pp. 801-810, 1986.
89 ms
(Ver 3.3 (11022016))