Tire search engines and ternary CAM used as pre-classifier

作者: Kam Choi , Eugene O'Neill , Francisco Valentin Aquino , Tin Lam , Gareth Edward Allwright

DOI:

关键词: Information retrievalTrieContent-addressable memoryComputer scienceSearch engineHash array mapped trieJump searchClassifier (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

参考文章(9)
Jan van Lunteren, Clark D. Jeffries, Everett A. Corl, Brooks Johnston, Plyush C. Patel, Reduction of ternary rules with common priority and actions ,(2006)
Fabrice Jean Verplanken, Jean Louis Calvignac, Hybrid search memory for network processor and computer systems ,(2002)
Rina Panigrahy, Samar Sharma, Suran Saminda De Silva, Methods and apparatus for longest common prefix based caching ,(2002)
Marco C. Heddes, Colin Beaton Verrilli, Piyush Chunilal Patel, Clark Debs Jeffries, Jean Louis Calvignac, Everett Arthur Corl, Mark Anthony Rinaldi, Anthony Matteo Gallo, System and method and computer program for filtering using tree structure ,(1999)
Jose P. Pereira, Database query processor ,(2005)
Pankaj Gupta, Srinivasan Venkatachary, Anand Rangarajan, Architecture for network search engines with fixed latency, high capacity, and high throughput ,(2004)