In this paper trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages one-by-one for membership in a given set of messages. Two new hash-coding methods are examined and compared with a particular conventional hash-coding method. The computational factors considered are the size of the hash area (space), the time required to identify a message as a nonmember of the given set (reject time), and an allowable error frequency.
The new methods are intended to reduce the amount of space required to contain the hash-coded information from that associated with conventional methods. The reduction in space is accomplished by exploiting the possibility that a small fraction of errors of commission may be tolerable in some applications, in particular, applications in which a large amount of data is involved and a core resident hash area is consequently not feasible using conventional methods.
In such applications, it is envisaged that overall performance could be improved by using a smaller core resident hash area in conjunction with the new methods and, when necessary, by using some secondary and perhaps time-consuming test to “catch” the small fraction of errors associated with the new methods. An example is discussed which illustrates possible areas of application for the new methods.
Analysis of the paradigm problem demonstrates that allowing a small number of test messages to be falsely identified as members of the given set will permit a much smaller hash area to be used without increasing reject time.
T h i s p a p e r p r e s e n t s a t h e o r e t i c a l a n a l y s i s of c e r t a i n t e c h n i q u e s for o r g a n i z i n g l a r g e a m o u n t s of s t o r e d data to f a c i l i t a t e fast r e t r i e v a l of des i r e d i n f o r m a t i o n . The w e l l -k n o w n a c c e s s m e t h o d involving the use of an inverted file to provide multi-keyword access to records is analyzed and shown to significantly reduce retrieval time at the cost of increased file maintenance time. It is shown that further improvements in retrieval time can result from exploiting several techniques for compacting the inverted file, including the use of a bit-pattern representation of the inverted file records. In addition, a direct keyword access method is introduced which avoids the use of a large disk resident concordance/index for locating disk resident information by maintaining a relatively small core resident table.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.