You are viewing a plain text version of this content. The canonical link for it is here.
Posted to github@arrow.apache.org by "wiedld (via GitHub)" <gi...@apache.org> on 2023/08/22 22:49:23 UTC

[GitHub] [arrow-datafusion] wiedld commented on a diff in pull request #7379: feat(7181): cascading loser tree merges

wiedld commented on code in PR #7379:
URL: https://github.com/apache/arrow-datafusion/pull/7379#discussion_r1302264850


##########
datafusion/core/src/physical_plan/sorts/cursor.rs:
##########
@@ -99,6 +100,16 @@ pub trait Cursor: Ord {
 
     /// Advance the cursor, returning the previous row index
     fn advance(&mut self) -> usize;
+
+    /// Go to reference row, returning the previous row index
+    fn seek(&mut self, row: usize) -> usize;

Review Comment:
   Seek was added in anticipation of the TODO/planned optimizations.
   
   a.k.a. cycles of slicing and concating of normalized key rows, also matching the cascaded sort recommendations in Graefe 2006.



-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: github-unsubscribe@arrow.apache.org

For queries about this service, please contact Infrastructure at:
users@infra.apache.org