Boots – shoes – and leggings
Patent
1992-09-29
1996-02-06
Harvey, Jack B.
Boots, shoes, and leggings
395427, 395600, 364DIG1, G06F 1206, G06F 1214
Patent
active
054902584
ABSTRACT:
To provide for fast access times with very large key fields, an associative memory utilizes a location addressable memory and look up tables to generate from a key an address in memory storing an associated record. The look up tables, stored in a memory, are constructed with the aid of arithmetic data compression methods to create a near perfect hashing of the keys. For encoding into the look up table, keys are divided into a string of symbols. Each symbol is assigned an index value, such that a sum of index values for symbols of a particular key is a unique value that is used as an address to the memory storing the record associated with that key.
REFERENCES:
patent: 3979733 (1976-09-01), Fraser
patent: 3987251 (1976-10-01), Texier et al.
patent: 3988544 (1976-10-01), Texier et al.
patent: 4168401 (1979-09-01), Molleron et al.
patent: 4494230 (1985-01-01), Turner
patent: 4547877 (1985-10-01), Lehman et al.
patent: 4603416 (1986-07-01), Servel et al.
patent: 4661951 (1987-04-01), Segarra
patent: 4742511 (1988-05-01), Johnson
patent: 4843622 (1989-06-01), Yotsutani et al.
patent: 4866431 (1989-09-01), Andros et al.
patent: 4875208 (1989-10-01), Furuhashi et al.
patent: 4887265 (1989-12-01), Felix
patent: 4912756 (1990-03-01), Hop
patent: 4922503 (1990-05-01), Leone
patent: 4953162 (1990-08-01), Lyons et al.
patent: 5095480 (1992-03-01), Fenner
patent: 5164943 (1992-11-01), Waggoner
Addressing Problems in Multi-network Systems--C. A. Sunshine, IEEE Proc. INFOCOM, pp. 12-18, 1982.
A. K. Shortest Path Algorithm for Adaptive Routing in Communications Networks--D. M. Topkis, IEEE Transactions on Communications, vol. 36, No. 7 Jul. 1988, pp. 855-859.
A Multiplication--Free Multialphabet Arithmetic Code--J. Rissanen & K. M. Mohiuddin, IEEE Transactions on Communications, vol. 37, No. 2 Feb. '89 pp. 93-98.
An Adaptive Dependency Source Model for Data Compression--D. M. Abrahamson, Communications of the ACM, vol. 32, No. 1, Jan.-89 pp. 77-83.
Analysis of Dynamic Hashing with Deferred Splitting--E. Veklerov, ACM Transactions on Database Systems, vol. 10, #1, Mar. 85 pp. 90-96.
Analysis of Uniform Hasing--Pea-Ake Larson, Journal of the Association for Computing Machinery, vol. 30, #4, Oct. 83 pp. 805-819.
Arithmetic Coding For Data Compression--I. H. Wihen, R. H. Neal & J. G. Ueasy, Communications of the ACM, vol. 30, No. 6, Jun. 1987, pp. 520-537.
A Trade-Off between Space & Efficiency For Routing Tables--D. Peleg & E4. Upfal, Journal of the Association For Computing Machinery, No. 8 Jul. 89 pp. 510-530 vol. 36.
Bounded Index Expovential Hashing.sub.[D. B. Lomet, ACM Transactions on Database Systems, vol. 8, No. 1, pp. 136-165, Mar. 1983.
C.sup.3 I Information Systems Internetwork Study--T. C. Bartee, O. P. Buveman, J. M. McQuillan & S. T. Walker, Institute For Defense Analysis, Apr. 1984.
Data Compression--D. A. Lelewar & D. S. Hirschberg, ACM Computing Surveys, vol. 19., No. 3, Sep. 1987, pp. 261-296.
Design & Analysis of Dynamic Huffman Codes--J. S. Vitter, Journal of the Association For Computing Machinery, vol. 34, No. 4, Oct. 1987 pp. 825-845.
Dynamic Hasing Schemes,-R. J. Enbody & H. C. Du, ACM Computing Surveys, vol. 20, No. 2, Jun. 1988, pp. 85-113.
Dynamic Hash Table-Per-Ake Larson, Communications of the ACM, vol. 31, No. 4, Apr. 1988, pp. 446-457.
Fast Hashing of Variable-Length Text Strings--P. K. Pearson, Communications of the ACM, vol. 33, No. 6, Jun. 1990, pp. 677-680.
File Organizaiton: "Implementaiton of a Method Guaranteeing Retrieval in One Access"-Per-Ake Larson & A. Kajla COM of The ACM vol. 27, No. 7 Jul. 84 p. 670.
Hashing For Dynamic & Static Internal Tables--T. G. Lewis & C. R. Cook, IEEE Computer, Oct. 1988, pp. 45-56.
Hashing in Practice, Analysis of Flashing & Universal Hasing--M. V. Ramakrishna, Proceedings ACM SIGMOD, Jun. 1988, pp. 191-199.
Hierarchical Routing For Large Networks--L. Kleinrock & F. Kamoun, Computer Networks, vol. 1, Jan. 1977, pp. 155-174.
Implications of Fragmentation & Dynamic Routing For Internet Datagram Authenticaiton--G. Tsudik, Computer Science Dept. USC, Inter-Network, Addressing & Routing--J. F. Shoch, IEEE Proc. of COMPCON, 1978, pp. 72-79
Lan Interoperability Study of Protocols Needed For Distributed Command & Control--W. C. Elden, A. C. Miller, S. L. Morgan, Def. Tech. Infor. Contr.
Linear Hashing with Overflow-Handling by Linear Probing--Per Ake Larson, ACM Transactions on Database Systems, vol. 10, No.1, Mar. 1985.
Minimol & Almost Minimol Perfect Hash Function Search With Application to Natural Language Lexicon Design, vol. 9, No. 1, pp. 215-230.
Multicast Routing In Internetworks & Extended LANs--S. E. Deering ACM Sigcomm, 1988, pp. 55-70.
New File Organizations Based on Dynamic Hashing--M. School, ACM Transactions on Database Systems, vol. 6, No. 1, Mar. 1981, pp. 194-211.
Partial-Match Retrieval Using Hashing & Descriptors--K. Ramamohavarao Lloyd & Thom, ACM Transactions on Database Systems, vol. 8, No. 4, Dec. 83, pp. 552-576.
Reciprocal Hashing: A Method For Generating Minimol Perfect Hasing Functions--G. Jaeschke, Communicaitons of the ACM, vol. 24, No. 12 Dec. 81 pp. 829-833.
Routing With Packet Duplication & Elimination In Computer Networks, Orda & R. Rom, IEEE Transactions on Communications, Jul. 1988 vol. 36, No. 7, pp. 860-866.
Should Tables Be Sorted? by Chi Chih Yao, Journal of the Assoc. For Computing Machinery, vol. 28, No. 3, Jul. 1981, pp. 615-628.
Some Distributions that Allow Perfect Packing--W. T. Rhee;-Journal of the Assoc. For Computing Machinery, vol. 35, No. 3, Jul. 1988 pp. 564-578.
Storing a Table O (1) Worst Case Access Time, by Fredman, Komolos & Szemenedi, Journal of the Association for Computing Machinery vol. 31, No. 1 Jul. 84, pp. 518-544.
The Landmark Hierarchy: A New Hierarchy For Routing in Very Large Networks, P. E. Tsuchiya, ACM, Aug. 1988, pp. 35-.
Working-Set Coprocessor--M. Milenkovic, Dept. of Computer Science & Eng. SMU, Mar. 1989.
Harvey Jack B.
Hubbard Marc A.
O'Neil Michael A.
Whitfield Michael A.
LandOfFree
Associative memory for very large key spaces does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Associative memory for very large key spaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Associative memory for very large key spaces will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2181454