Uploaded image for project: 'HPCC'
  1. HPCC
  2. HPCC-12913

Implement a spilling variety of TABLE,FEW (Hash aggregate)

    XMLWordPrintable

Details

    • New Feature
    • Status: Accepted
    • Major
    • Resolution: Unresolved
    • None
    • 8.0.0
    • Thor
    • Minor

    Description

      Currently TABLE, FEW implemented using a hash aggregate, is bound by the amount of memory.

      As with Hash Dedup, which automatically spills to disk and dedups in phases if it exceeds memory, Hash Aggregate should do the same, aggregate merging in phases.

      Attachments

        Issue Links

          Activity

            People

              jakesmith Jake Smith
              jakesmith Jake Smith
              Votes:
              0 Vote for this issue
              Watchers:
              3 Start watching this issue

              Dates

                Created:
                Updated: