Database and method for storing a searchable set of keywords
作者： Robert Wing Pong Luk , Wai Chung Yip
DOI:
关键词:
摘要: A methods for storing a searchable set of keywords includes concatenating the to form string, and defining one or more links between two characters in string. delimiting character separates are pointers. Any inaccessible string removed improve storage cost method.
lens.org 参考文章(5)
Dan S. Bloomberg, Francine R. Chen, Lynn D. Wilcox, Word spotting in bitmap images using text line bounding boxes and hidden Markov models ,(1994)
Walter A. Tackett, Scott S. Benson, Methods for automatically focusing the attention of a virtual robot interacting with users ,(2001)
Alice Maria Houchin, Douglas Andrew Wood, Method for searching non-tokenized text and tokenized text for matches against a keyword data structure ,(1998)
M.A. Ruiz-Sanchez, E.W. Biersack, W. Dabbous, Survey and taxonomy of IP address lookup algorithms IEEE Network. ,vol. 15, pp. 8- 23 ,(2001) , 10.1109/65.912716
P.A. Yilmaz, A. Belenkiy, N. Uzun, N. Gogate, M. Toy, A trie-based algorithm for IP lookup problem global communications conference. ,vol. 1, pp. 593- 598 ,(2000) , 10.1109/GLOCOM.2000.892085