Abstract
Abstract In this paper, a new multi‐attribute file, called haphazard file, is introduced. We derive two formulas for the average number of buckets to be examined over all possible partial match queries for multi‐attribute files based upon multi‐key hashing functions and haphazard files respectively. Theoretical results show that the performance of multi‐attribute files based upon multiple key hashing functions is always superior to that of haphazard files.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
