作者: Kam Choi , Eugene O'Neill , Francisco Valentin Aquino , Tin Lam , Gareth Edward Allwright
DOI:
关键词: Information retrieval 、 Trie 、 Content-addressable memory 、 Computer science 、 Search engine 、 Hash array mapped trie 、 Jump search 、 Classifier (UML)
摘要: A method performs a lookup on search key word, employing trie database including multiple blocks that include pointers to other blocks. Each is accessible by means of segment the key. selected section word applied content addressable memory. In event an absence match with entry in memory, performed whole word. partial performed, commencing first after has been matched