Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2005-01-04
2005-01-04
Kindred, Alford W. (Department: 2172)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000, C707S793000, C370S401000
Reexamination Certificate
active
06839703
ABSTRACT:
A retrieval key to be used for the retrieval of a table is divided into a plurality of divided retrieval keys consisted of a plurality of bit strings. Each divided retrieval key is provided with a corresponding retrieval table. Further, the size of the table to be retrieved by one divided retrieval key is made to be smaller than the size of a table to be retrieved one time by a whole retrieval key. First, the first retrieval table is retrieved by the divided retrieval key (A bits). If the result is obtained, the result is outputted unchanged. If the pointer to the second retrieval table is obtained, the second retrieval table is retrieved by the other divided retrieval key (B bits). In this way, a retrieval process continues using the divided retrieval keys.
REFERENCES:
patent: 4918646 (1990-04-01), Hirose
patent: 5129074 (1992-07-01), Kikuchi et al.
patent: 6011795 (2000-01-01), Varghese et al.
patent: 6515998 (2003-02-01), Yamashita et al.
patent: 9-107377 (1997-04-01), None
patent: 10-177582 (1998-06-01), None
patent: 10-222535 (1998-08-01), None
patent: 11-088427 (1999-03-01), None
patent: 11-103318 (1999-04-01), None
patent: 11-261647 (1999-09-01), None
patent: 11-284658 (1999-10-01), None
patent: 2000-22736 (2000-01-01), None
patent: 9913619 (1999-03-01), None
Pankaj Gupta et al., “Routing Lookups in Hardware at Memory Access Speeds”, INFOCOM '98, Mar. 1998, pp. 1240-1247.
V. Srinivasan et al., “Fast Address Lookups Using Controlled Prefix Expansion”, ACM Transactions on Computer Systems, vol. 17, No. 1, Feb. 1999, pp. 1-40.
M. Zitterbart et al., “Efficient Routing Table Lookup for IPv6”, IEEE Workshop HPCS 1997, Jun. 23, 1997, pp. 1-9.
Geng-Sheng Kuo et al., “A New Architectural Concept of Hierarchical Routing Scheme for IPv6 in Future High-Speed Large Global Internet”, ITS '98 Proceedings, Aug. 1998, pp. 638-643.
“Tiny Tera/High Performance Switching.” http://klamath.stanford.edu/tiny-tera/abstract/index.htm.
“Tiny Tera/Papers.” http://klamath.stanford.edu/tiny-tera/papers/index.htm.
“Tiny Tera/People.” http://klamath.stanford.edu/tiny-tera/people/index.htm.
“Tiny Tera/Talks.” http://klamath.stanford.edu/tiny-tera/talks/index.htm.
“Tiny Tera/Java Animations” http://klamath.stanford.edu/tiny-tera/demos/index.htm.
Ken K.—Y. Chang, et al, “A 2 Gb/s Asymmetric Serial Link for High Bandwidth Packet Switches.”Computer System Laboratory. Stanford University.
Nick McKeown, et al, “The Tiny Tera: A Packet Switch Core.” Department of Electrical Engineering and Computer Science. Stanford University.
Kun-Yung Ken Chang, et al, “A 2Gb/s/pin CMOS Asymmetric Serial Link.” Computer System Laboratory. Stanford University.
Nick McKeown, et al, “A Quantitative Comparison of Scheduling Algorithms for Input-Queued Switches”.
Balaji Prabhakar, et al, “Multicast Scheduling For Input-Queued Switches.”
Nick McKeown, et al. “High Performance Switching” Last Modified: Nov. 30, 1995.
Yoichi Hariguchi, “Review of Recent Route Search Technology, Route Search via Revised Binary Trees/B-Trees” from the article “NETWORK TECHNOLOGY, 11” inUnix Magazine. Oct. 1998.
Yoichi Hariguchi, “Review of Recent Route Search Technology(2), Route Search via Two-way Lookup Tables” from the article “NETWORK TECHNOLOGY, 12” inUnix Magazine. Nov. 1998.
Stefanos Sidiropoulos, et al, “Current Integrating Receivers for High Speed System Interconnects.” Center for Integrated Systems, Stanford University.
“Tiny Tera/People.” http://klamath.stanford.edu/tiny-tera/talks/index.htm.
“Tiny Tera/Java Animation” http://klamath.stanford.edu/tiny-tera/demos/index.htm.
Ehichioya Fred
Fujitsu Limited
Kindred Alford W.
Staas & Halsey , LLP
LandOfFree
Information apparatus, table retrieval apparatus, table... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Information apparatus, table retrieval apparatus, table..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Information apparatus, table retrieval apparatus, table... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3419678