Applies a prefix trie index, or trie hashing, to the problem of providing fast search times, fast load times, and fast update properties in a bibliographic or full-text retrieval system with inverted files. Statistics are given for a test database consisting of an online catalog at the University of Western Ontario. (Author/LRW)