Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2005-12-13
2005-12-13
Coby, Frantz (Department: 2161)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000
Reexamination Certificate
active
06976025
ABSTRACT:
A methods for storing a searchable set of keywords includes concatenating the keywords to form a string, and defining one or more links between two or more characters in the string. A delimiting character separates the keywords in the string, and the links are pointers. Any inaccessible characters in the string are removed to improve the storage cost the method.
REFERENCES:
patent: 5745600 (1998-04-01), Chen et al.
patent: 6263333 (2001-07-01), Houchin et al.
patent: 2002/0156551 (2002-10-01), Tackett et al.
Larsson N. Jesper “Structure of String Matching and data compression”, Department of computer science Lund University, Copyright 1999.
Miguel A. Ruiz-Sanchex et al. “Survey and Taxonomy of IP address lookup algorithms”, IEEE Network Mar./Apr. 2001.
Panar Altin Yilmaz et al. “A Trie-based algorithm for IP lookup problem”, New Jersey Institute of Technology ,copyright 2000.
Luk Robert Wing Pong
Yip Wai Chung
Coby Frantz
Hong Kong Polytechnic University
Jackson & Walker, LLP
Nguyen Cindy
LandOfFree
Database and method for storing a searchable set of keywords does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Database and method for storing a searchable set of keywords, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Database and method for storing a searchable set of keywords will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3514740