Electrical computers and digital processing systems: memory – Storage accessing and control – Hierarchical memories
Reexamination Certificate
2006-05-02
2006-05-02
Padmanabhan, Mano (Department: 2188)
Electrical computers and digital processing systems: memory
Storage accessing and control
Hierarchical memories
Reexamination Certificate
active
07039764
ABSTRACT:
A method and a search engine are described. A unique key is received. A hash is searched for a match to the unique key. Concurrently with searching the hash, a cache is searched for the match to the unique key. And information regarding the unique key is obtained.
REFERENCES:
patent: 5043885 (1991-08-01), Robinson
patent: 5359720 (1994-10-01), Tamura et al.
patent: 5414704 (1995-05-01), Spinney
patent: 5530834 (1996-06-01), Colloff et al.
patent: 5566324 (1996-10-01), Kass
patent: 5829051 (1998-10-01), Steely et al.
patent: 5893120 (1999-04-01), Nemes
patent: 5914938 (1999-06-01), Brady et al.
patent: 6012126 (2000-01-01), Aggarwal et al.
patent: 6052698 (2000-04-01), Bennett et al.
patent: 6081530 (2000-06-01), Wiher et al.
patent: 6115705 (2000-09-01), Larson
patent: 6658533 (2003-12-01), Bogin et al.
patent: 6683887 (2004-01-01), Huang et al.
patent: 6735670 (2004-05-01), Bronstein et al.
patent: 6772224 (2004-08-01), Kung et al.
patent: 6781981 (2004-08-01), Kimbrough
patent: 2002/0152361 (2002-10-01), Dean et al.
patent: 2004/0186862 (2004-09-01), Garthwaite
Jouppi, “Improving Direct-Mapped Cache Performance by the Addition of Small Fully-Associated Cache and Prefetch Buffers”, Computer Architecture, 1990. Proceedings. 17th Annual International Symposium on , May 28-31, 1990 pp.:364-373.
Xu et al., “A novel cache architecture to support layer-four packet classification at memory access speeds”, INFOCOM 2000. IEEE ,vol.: 3 , Mar. 26-30, 2000 pp.:1445-1454 vol. 3.
Takenaka et al., “Adaptive load balancing content address hashing routing for reverse proxy servers”, Communications, 2004 IEEE International Conference on ,vol.: 3 , Jun. 20-24, 2004 □□pp.:1522-1526 vol. 3.
Pagh, “Hash and Displace: Efficient Evalutation of Minimal Perfect Hash Functions”, 1999, pp. 1-10.
Czech et al., “An Optimal Algorithm for Generating Minimal Perfect Hash Functions” 1992, Information Processing Letters, 43(5):257-264.
Cormack et al., “Practical Perfect Hashing”, 1985 The COmputer Journal, vol. 28 No 1, pp. 54-58.
Horowitz et al, “Fundamentals of Data Structures in C”, 1993, Computers Science Press, p. 406-409.
Graham et al., “Pseudochaining in Hash Tables”, 1978, Communications of the ACM 21(7), p. 554-557.
Brent, “Reducing the Retrieval Time of Scatter Storage Techniques”, 1973, Communications of the ACM 16(2), p. 105-109.
Fox et al., “Order Preserving Minimal Perfect Hash Functions and Information Retrieval”, 1991, ACM Transactions on Information Systems 9(3), p. 279-301.
Munro et al., “Techniques for collision resolution in hash tables with open addressing”, 1986, Proceedings of 1986 ACM Fall joint computer conference, p. 601-610.
Cormack, et al. “Practical Perfect Hashing” The Computer Journal, vol. 28, No. 1, 1985, pp. 54-58.
Pagh, “Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions”, BRICS Report Series, 1999 pp. 1-10, Department of Computer Science, University of Aarhus, Denmark.
Shetty Suhas
Vu De
Baker Paul
Nokia Corporation
Padmanabhan Mano
Squire Sanders & Dempsey L.L.P.
LandOfFree
Near-perfect, fixed-time searching algorithm using hashing,... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Near-perfect, fixed-time searching algorithm using hashing,..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Near-perfect, fixed-time searching algorithm using hashing,... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3563516