Abstract

AbstractIn this paper, a new letter‐oriented perfect hashing scheme based on Ziegler's row displacement method is presented. A unique n‐tuple from a given set of static letter‐oriented key words can be extracted by a heuristic algorithm. Then the extracted distinct n‐tuples are associated with a 0/1 sparse matrix. Using a sparse matrix compression technique, a perfect hashing function on the key words is then constructed.

Full Text
Paper version not known

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 call

Disclaimer: 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.