Impala
Impalaistheopensource,nativeanalyticdatabaseforApacheHadoop.
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
Public Attributes | List of all members
impala::HashTable::Bucket Struct Reference
Collaboration diagram for impala::HashTable::Bucket:

Public Attributes

bool filled
 Whether this bucket contains a vaild entry, or it is empty. More...
 
bool matched
 
bool hasDuplicates
 
uint32_t hash
 
union {
   HtData   htdata
 
   DuplicateNode *   duplicates
 
} bucketData
 Either the data for this bucket or the linked list of duplicates. More...
 

Detailed Description

Definition at line 303 of file hash-table.h.

Member Data Documentation

union { ... } impala::HashTable::Bucket::bucketData

Either the data for this bucket or the linked list of duplicates.

Referenced by impala::HashTable::AppendNextNode(), impala::HashTable::DebugString(), impala::HashTable::Find(), impala::HashTable::Iterator::GetRow(), impala::HashTable::GetRow(), impala::HashTable::Iterator::GetTuple(), impala::HashTable::InsertDuplicateNode(), impala::HashTable::InsertInternal(), and impala::HashTable::NextFilledBucket().

DuplicateNode* impala::HashTable::Bucket::duplicates

Definition at line 324 of file hash-table.h.

Referenced by impala::HashTable::AppendNextNode(), impala::HashTable::DebugString(), impala::HashTable::Find(), impala::HashTable::GetRow(), impala::HashTable::InsertDuplicateNode(), and impala::HashTable::NextFilledBucket().

bool impala::HashTable::Bucket::filled

Whether this bucket contains a vaild entry, or it is empty.

Definition at line 305 of file hash-table.h.

Referenced by impala::HashTable::InsertDuplicateNode(), impala::HashTable::PrepareBucketForInsert(), and impala::HashTable::Probe().

bool impala::HashTable::Bucket::hasDuplicates

Used in case of duplicates. If true, then the bucketData union should be used as 'duplicates'.

Definition at line 315 of file hash-table.h.

Referenced by impala::HashTable::Iterator::GetRow(), impala::HashTable::GetRow(), impala::HashTable::Iterator::GetTuple(), impala::HashTable::InsertDuplicateNode(), impala::HashTable::Iterator::IsMatched(), impala::HashTable::Iterator::NextUnmatched(), impala::HashTable::PrepareBucketForInsert(), and impala::HashTable::Iterator::SetMatched().

uint32_t impala::HashTable::Bucket::hash

Cache of the hash for data. TODO: Do we even have to cache the hash value?

Definition at line 319 of file hash-table.h.

Referenced by impala::HashTable::PrepareBucketForInsert(), impala::HashTable::Probe(), and impala::HashTable::ResizeBuckets().

HtData impala::HashTable::Bucket::htdata

Definition at line 323 of file hash-table.h.

Referenced by impala::HashTable::DebugString(), impala::HashTable::Iterator::GetRow(), impala::HashTable::GetRow(), impala::HashTable::Iterator::GetTuple(), impala::HashTable::InsertDuplicateNode(), and impala::HashTable::InsertInternal().

bool impala::HashTable::Bucket::matched

Used for full outer and right {outer, anti, semi} joins. Indicates whether the row in the bucket has been matched. From an abstraction point of view, this is an awkward place to store this information but it is efficient. This space is otherwise unused.

Definition at line 311 of file hash-table.h.

Referenced by impala::HashTable::InsertDuplicateNode(), impala::HashTable::Iterator::IsMatched(), impala::HashTable::Iterator::NextUnmatched(), impala::HashTable::PrepareBucketForInsert(), and impala::HashTable::Iterator::SetMatched().

The documentation for this struct was generated from the following file: