When Oracle performs a hash-join it first creates a hashmap. This hash map is placed in the PGA. Now, Oracle uses linked lists to manage the buffer cache. Traditional hashing uses an array for the hash, then a linked list for the collisions. How does Oracle manage this?
Please see the official ORACLE-L FAQ:
http://www.orafaq.com
To unsubscribe send email to: oracle-l-request_at_freelists.org
put 'unsubscribe' in the subject line.
--
Archives are at
http://www.freelists.org/archives/oracle-l/
FAQ is at
http://www.freelists.org/help/fom-serve/cache/1.html
Received on Thu Feb 12 2004 - 22:12:22 CST
