Reorganization of collisions in a hash bucket of a hash table to

Details Reorganization of collisions in a hash bucket of a hash table to Reorganization of collisions in a hash bucket of a hash table to

1999-03-15

2000-04-18

Alam, Hosain T.

Data processing: database and file management or data structures

Database design

Data structure types

707100, 711119, G06F 1730

Patent

active

06052698&

ABSTRACT:
An improved hashing system is provided that takes advantage of the caching architecture of many of today's processors to improve performance. Some of today's most advanced processors, like PENTIUM processor, have a two level caching scheme utilizing a primary cache and a secondary cache, where data contained in the primary cache is accessible 50-150 times faster than data in main memory. The improved hashing system ensures that collision occur so that the buckets contain many entries, and at runtime, the entries in the buckets are reordered to increase the number of times that the primary cache of the processor is used and to reduce the number of times that main memory is used, thereby improving the performance of the hashing system.

REFERENCES:
patent: 4638426 (1987-01-01), Chang et al.
patent: 5197002 (1993-03-01), Spencer
patent: 5339398 (1994-08-01), Shah et al.
patent: 5493660 (1996-02-01), DeLano et al.
patent: 5600816 (1997-02-01), Oldfield et al.
patent: 5778430 (1998-07-01), Ish et al.
Stubbs et al., Data Structures with Abstract Data Types and Pascal, Brooks/Cole Publishing Company, California, 1985, pp. 310-336.
Panneerselvam et al., "Reconfigurable Systolic Architectures for Hashing," PARBASE, 1990, p. 543.
Anderson and Shanley, Pentium Processor System Architecture, Second Edition, Addison-Wesley, Massachuetts,1995 pp. 35-60.
Knuth, Donald E., The Art of Computer Programming, "Sorting and Searching," Addison-Wesley, Massachusetts, 1973, pp. 393-405 and 506-549.
Teuhola, Jakka, "Effective Clustering of Objects Stored by Linear Hashing," CIKM '95, Maryland, 1995, pp. 274-280.
Williams, J.G., "Storage Utilization in a Memory Hierarchy when Storage Assignment is Performed by a Hashing Algorithm," Communications of the ACM, Mar. 1971, USA, vol. 14, No. 3, pp. 172-175.
"Minimizing Locking to Access Global Shared Data," IBM Technical Disclosure Bulletin, vol. 38, No. 2, Feb. 1995, pp. 619-622.

Affiliated with

Also associated with

Rating

Reorganization of collisions in a hash bucket of a hash table to does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Reorganization of collisions in a hash bucket of a hash table to, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reorganization of collisions in a hash bucket of a hash table to will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2345004