Uploaded image for project: 'Phoenix'
  1. Phoenix
  2. PHOENIX-2126 Improving performance of merge sort by multi-threaded and minheap implementation
  3. PHOENIX-2377

Use a priority queue in MergeSortResultIterator

    XMLWordPrintableJSON

Details

    • Sub-task
    • Status: Resolved
    • Minor
    • Resolution: Fixed
    • None
    • 4.7.0
    • None

    Description

      Optimized the implementation of merging 'n'-sorted iterators(having 'm' tuples) by using "min heap" which optimizes the time complexity from
      O(n2m) to O(nmLogn) (as heapify takes (Logn) time).

      Attachments

        1. PHOENIX-2377_v1.patch
          13 kB
          Ankit Singhal
        2. PHOENIX-2377_v2.patch
          13 kB
          Ankit Singhal
        3. PHOENIX-2377_v3.patch
          19 kB
          Ankit Singhal

        Activity

          People

            ankit.singhal Ankit Singhal
            ankit.singhal Ankit Singhal
            Votes:
            0 Vote for this issue
            Watchers:
            5 Start watching this issue

            Dates

              Created:
              Updated:
              Resolved: