Physical Sciences and Mathematics Commons^™

Near Perfect Hash Table For Image Databases, Sanjiv K. Bhatia, Chaman Sabharwal

Computer Science Faculty Research & Creative Works

In image database systems, a perfect hash table can be used to enhance the efficiency and effectiveness of the image retrieval process. In our earlier work, we have proposed heuristic algorithms to compute the minimal perfect hash table from symbolic picture objects. The hash table thus computed cannot be modified easily, limiting its application to fixed databases like the ones on CD-ROMs. In this paper, we propose a new data structure to allow for insertion and deletion in the hash table. The new data structure, the near-perfect hash table, allows a limited number of collisions on some of the hash …