[TEZ-2606] Cache-friendly data structure for sorting

• Type: Sub-task
• Status: Resolved
• Priority: Major
• Resolution: Done
• Target Version/s: 0.8.0-alpha
• Assignee: Tsuyoshi Ozawa
• Reporter: Tsuyoshi Ozawa
• Created: 08/Jul/15 15:19
• Updated: 15/Jul/15 06:01
• Resolved: 15/Jul/15 06:01

Description

Alphasort[1] mentions prefix key sort is effective way. I'd like to suggest to change a layout of ring buffer to include prefix of key in meta data. This can improve the cache hit rate when sorting.

[1] Alphasort: http://dl.acm.org/citation.cfm?id=615237