Pre-Grant Publication Number: 20090119247
Filing Date: June 23, 2008
Inventors: Srikanth Bellamkonda, Benoit Dageville
Assignee(s): ORACLE INTERNATIONAL CORPORATION
Current U.S. Classification: 707, 707/002000, 707/E17005
View Prior Art for Claim 00005
The method of Claim 4, wherein a pair of corresponding partitions includes a right table partition that corresponds to a left table partition, the steps further including:determining which one of said pair of corresponding partitions is to be loaded into memory as a hashed in-memory partition, the other of said pair of corresponding partitions being a scan partition;generating a second hash table that indexes said hashed in-memory partition by the respective join column of said join condition;for each scan partition row from said scan partition,(1) probing said second hash table to find any row in the hashed in-memory partition to inner join with said each scan partition row,(2) for any particular row found in the hashed in-memory partition that should be inner joined with said each scan partition row, generating an inner join row and marking said particular row in the hashed in-memory partition as being inner joined,(3) determining whether said each scan partition row was inner joined with any row in said hashed in-memory partition, and(4) if said each scan partition row was not inner joined with any row in said hashed in-memory partition, generating a left or right outer join row for said each scan partition row;for each row in said hashed in-memory partition that is not marked as being inner joined, generating a left or right outer join row. Title VLDB'98, Proceedings of 24rd International Conference on Very Large Data Bases, August 24-27, 1998,
ISBN 1-55860-566-5
Description
Some general coverage on hash join including hash full outer join, that mentions some specific techniques relevant to application's claims.
