This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dynamic file structure for partial match retrieval based on overflow bucket sharing
Aug. 1986 (vol. 12 no. 8)
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.
Index Terms:
Organizations,Vectors,Indexes,Computer science,Educational institutions,Manganese,Large Hadron Collider,physical design,Database management,file organization,information storage and retrieval
Citation:
David Hung-Chang Du, "Dynamic file structure for partial match retrieval based on overflow bucket sharing," IEEE Transactions on Software Engineering, vol. 12, no. 8, pp. 801-810, Aug. 1986, doi:10.1109/TSE.1986.6312983
Usage of this product signifies your acceptance of the Terms of Use.