duckdb 0.9.3-dev0.0 → 0.9.3-dev14.0

package/src/duckdb/src/execution/window_segment_tree.cpp

@@ -3,7 +3,11 @@
 #include "duckdb/common/algorithm.hpp"
 #include "duckdb/common/helper.hpp"
 #include "duckdb/common/vector_operations/vector_operations.hpp"
+#include "duckdb/execution/merge_sort_tree.hpp"
+#include "duckdb/planner/expression/bound_constant_expression.hpp"
+#include "duckdb/execution/window_executor.hpp"
 
+#include <numeric>
 #include <utility>
 
 namespace duckdb {
@@ -14,9 +18,10 @@ namespace duckdb {
 WindowAggregatorState::WindowAggregatorState() : allocator(Allocator::DefaultAllocator()) {
 }
 
-WindowAggregator::WindowAggregator(AggregateObject aggr, const LogicalType &result_type_p, idx_t partition_count_p)
+WindowAggregator::WindowAggregator(AggregateObject aggr, const LogicalType &result_type_p,
+                                   const WindowExcludeMode exclude_mode_p, idx_t partition_count_p)
     : aggr(std::move(aggr)), result_type(result_type_p), partition_count(partition_count_p),
-      state_size(aggr.function.state_size()), filter_pos(0) {
+      state_size(aggr.function.state_size()), filter_pos(0), exclude_mode(exclude_mode_p) {
 }
 
 WindowAggregator::~WindowAggregator() {
@@ -43,15 +48,16 @@ void WindowAggregator::Sink(DataChunk &payload_chunk, SelectionVector *filter_se
 	}
 }
 
-void WindowAggregator::Finalize() {
+void WindowAggregator::Finalize(const FrameStats &stats) {
 }
 
 //===--------------------------------------------------------------------===//
 // WindowConstantAggregate
 //===--------------------------------------------------------------------===//
 WindowConstantAggregator::WindowConstantAggregator(AggregateObject aggr, const LogicalType &result_type,
-                                                   const ValidityMask &partition_mask, const idx_t count)
-    : WindowAggregator(std::move(aggr), result_type, count), partition(0), row(0), state(state_size),
+                                                   const ValidityMask &partition_mask,
+                                                   const WindowExcludeMode exclude_mode_p, const idx_t count)
+    : WindowAggregator(std::move(aggr), result_type, exclude_mode_p, count), partition(0), row(0), state(state_size),
       statep(Value::POINTER(CastPointerToValue(state.data()))),
       statef(Value::POINTER(CastPointerToValue(state.data()))) {
 
@@ -180,7 +186,7 @@ void WindowConstantAggregator::Sink(DataChunk &payload_chunk, SelectionVector *f
 	}
 }
 
-void WindowConstantAggregator::Finalize() {
+void WindowConstantAggregator::Finalize(const FrameStats &stats) {
 	AggegateFinal(*results, partition++);
 }
 
@@ -203,8 +209,9 @@ unique_ptr<WindowAggregatorState> WindowConstantAggregator::GetLocalState() cons
 	return make_uniq<WindowConstantAggregatorState>();
 }
 
-void WindowConstantAggregator::Evaluate(WindowAggregatorState &lstate, const idx_t *begins, const idx_t *ends,
-                                        Vector &target, idx_t count) const {
+void WindowConstantAggregator::Evaluate(WindowAggregatorState &lstate, const DataChunk &bounds, Vector &target,
+                                        idx_t count, idx_t row_idx) const {
+	auto begins = FlatVector::GetData<const idx_t>(bounds.data[WINDOW_BEGIN]);
 	//	Chunk up the constants and copy them one at a time
 	auto &lcstate = lstate.Cast<WindowConstantAggregatorState>();
 	idx_t matched = 0;
@@ -234,8 +241,9 @@ void WindowConstantAggregator::Evaluate(WindowAggregatorState &lstate, const idx
 //===--------------------------------------------------------------------===//
 // WindowCustomAggregator
 //===--------------------------------------------------------------------===//
-WindowCustomAggregator::WindowCustomAggregator(AggregateObject aggr, const LogicalType &result_type, idx_t count)
-    : WindowAggregator(std::move(aggr), result_type, count) {
+WindowCustomAggregator::WindowCustomAggregator(AggregateObject aggr, const LogicalType &result_type,
+                                               const WindowExcludeMode exclude_mode_p, idx_t count)
+    : WindowAggregator(std::move(aggr), result_type, exclude_mode_p, count) {
 }
 
 WindowCustomAggregator::~WindowCustomAggregator() {
@@ -243,27 +251,45 @@ WindowCustomAggregator::~WindowCustomAggregator() {
 
 class WindowCustomAggregatorState : public WindowAggregatorState {
 public:
-	explicit WindowCustomAggregatorState(const AggregateObject &aggr, DataChunk &inputs);
+	WindowCustomAggregatorState(const AggregateObject &aggr, const WindowExcludeMode exclude_mode);
 	~WindowCustomAggregatorState() override;
 
 public:
 	//! The aggregate function
 	const AggregateObject &aggr;
-	//! The aggregate function
-	DataChunk &inputs;
 	//! Data pointer that contains a single state, shared by all the custom evaluators
 	vector<data_t> state;
 	//! Reused result state container for the window functions
 	Vector statef;
 	//! The frame boundaries, used for the window functions
-	FrameBounds frame;
+	SubFrames frames;
 };
 
-WindowCustomAggregatorState::WindowCustomAggregatorState(const AggregateObject &aggr, DataChunk &inputs)
-    : aggr(aggr), inputs(inputs), state(aggr.function.state_size()),
-      statef(Value::POINTER(CastPointerToValue(state.data()))), frame(0, 0) {
+static void InitSubFrames(SubFrames &frames, const WindowExcludeMode exclude_mode) {
+	idx_t nframes = 0;
+	switch (exclude_mode) {
+	case WindowExcludeMode::NO_OTHER:
+		nframes = 1;
+		break;
+	case WindowExcludeMode::TIES:
+		nframes = 3;
+		break;
+	case WindowExcludeMode::CURRENT_ROW:
+	case WindowExcludeMode::GROUP:
+		nframes = 2;
+		break;
+	}
+	frames.resize(nframes, {0, 0});
+}
+
+WindowCustomAggregatorState::WindowCustomAggregatorState(const AggregateObject &aggr,
+                                                         const WindowExcludeMode exclude_mode)
+    : aggr(aggr), state(aggr.function.state_size()), statef(Value::POINTER(CastPointerToValue(state.data()))),
+      frames(3, {0, 0}) {
 	// if we have a frame-by-frame method, share the single state
 	aggr.function.initialize(state.data());
+
+	InitSubFrames(frames, exclude_mode);
 }
 
 WindowCustomAggregatorState::~WindowCustomAggregatorState() {
@@ -273,45 +299,314 @@ WindowCustomAggregatorState::~WindowCustomAggregatorState() {
 	}
 }
 
+void WindowCustomAggregator::Finalize(const FrameStats &stats) {
+	WindowAggregator::Finalize(stats);
+	partition_input =
+	    make_uniq<WindowPartitionInput>(inputs.data.data(), inputs.ColumnCount(), inputs.size(), filter_mask, stats);
+
+	if (aggr.function.window_init) {
+		gstate = GetLocalState();
+		auto &gcstate = gstate->Cast<WindowCustomAggregatorState>();
+
+		AggregateInputData aggr_input_data(aggr.GetFunctionData(), gcstate.allocator);
+		aggr.function.window_init(aggr_input_data, *partition_input, gcstate.state.data());
+	}
+}
+
 unique_ptr<WindowAggregatorState> WindowCustomAggregator::GetLocalState() const {
-	return make_uniq<WindowCustomAggregatorState>(aggr, const_cast<DataChunk &>(inputs));
+	return make_uniq<WindowCustomAggregatorState>(aggr, exclude_mode);
 }
 
-void WindowCustomAggregator::Evaluate(WindowAggregatorState &lstate, const idx_t *begins, const idx_t *ends,
-                                      Vector &result, idx_t count) const {
-	//	TODO: window should take a const Vector*
-	auto &lcstate = lstate.Cast<WindowCustomAggregatorState>();
-	auto &frame = lcstate.frame;
-	auto params = lcstate.inputs.data.data();
-	auto &rmask = FlatVector::Validity(result);
-	for (idx_t i = 0; i < count; ++i) {
-		const auto begin = begins[i];
-		const auto end = ends[i];
-		if (begin >= end) {
-			rmask.SetInvalid(i);
-			continue;
+template <typename OP>
+static void EvaluateSubFrames(const DataChunk &bounds, const WindowExcludeMode exclude_mode, idx_t count, idx_t row_idx,
+                              SubFrames &frames, OP operation) {
+	auto begins = FlatVector::GetData<const idx_t>(bounds.data[WINDOW_BEGIN]);
+	auto ends = FlatVector::GetData<const idx_t>(bounds.data[WINDOW_END]);
+	auto peer_begin = FlatVector::GetData<const idx_t>(bounds.data[PEER_BEGIN]);
+	auto peer_end = FlatVector::GetData<const idx_t>(bounds.data[PEER_END]);
+
+	for (idx_t i = 0, cur_row = row_idx; i < count; ++i, ++cur_row) {
+		idx_t nframes = 0;
+		if (exclude_mode == WindowExcludeMode::NO_OTHER) {
+			auto begin = begins[i];
+			auto end = ends[i];
+			frames[nframes++] = FrameBounds(begin, end);
+		} else {
+			//	The frame_exclusion option allows rows around the current row to be excluded from the frame,
+			//	even if they would be included according to the frame start and frame end options.
+			//	EXCLUDE CURRENT ROW excludes the current row from the frame.
+			//	EXCLUDE GROUP excludes the current row and its ordering peers from the frame.
+			//	EXCLUDE TIES excludes any peers of the current row from the frame, but not the current row itself.
+			//	EXCLUDE NO OTHERS simply specifies explicitly the default behavior
+			//	of not excluding the current row or its peers.
+			//	https://www.postgresql.org/docs/current/sql-expressions.html#SYNTAX-WINDOW-FUNCTIONS
+			//
+			//	For the sake of the client, we make some guarantees about the subframes:
+			//	* They are in order left-to-right
+			//	* They do not intersect
+			//	* start <= end
+			//	* The number is always the same
+			//
+			//	Since we always have peer_begin <= cur_row < cur_row + 1 <= peer_end
+			//	this is not too hard to arrange, but it may be that some subframes are contiguous,
+			//	and some are empty.
+
+			//	WindowExcludePart::LEFT
+			auto begin = begins[i];
+			auto end = (exclude_mode == WindowExcludeMode::CURRENT_ROW) ? cur_row : peer_begin[i];
+			end = MaxValue(begin, end);
+			frames[nframes++] = FrameBounds(begin, end);
+
+			// with EXCLUDE TIES, in addition to the frame part right of the peer group's end,
+			// we also need to consider the current row
+			if (exclude_mode == WindowExcludeMode::TIES) {
+				frames[nframes++] = FrameBounds(cur_row, cur_row + 1);
+			}
+
+			//	WindowExcludePart::RIGHT
+			end = ends[i];
+			begin = (exclude_mode == WindowExcludeMode::CURRENT_ROW) ? (cur_row + 1) : peer_end[i];
+			begin = MinValue(begin, end);
+			frames[nframes++] = FrameBounds(begin, end);
 		}
 
-		// Frame boundaries
-		auto prev = frame;
-		frame = FrameBounds(begin, end);
+		operation(i);
+	}
+}
 
+void WindowCustomAggregator::Evaluate(WindowAggregatorState &lstate, const DataChunk &bounds, Vector &result,
+                                      idx_t count, idx_t row_idx) const {
+	auto &lcstate = lstate.Cast<WindowCustomAggregatorState>();
+	auto &frames = lcstate.frames;
+	const_data_ptr_t gstate_p = nullptr;
+	if (gstate) {
+		auto &gcstate = gstate->Cast<WindowCustomAggregatorState>();
+		gstate_p = gcstate.state.data();
+	}
+
+	EvaluateSubFrames(bounds, exclude_mode, count, row_idx, frames, [&](idx_t i) {
 		// Extract the range
 		AggregateInputData aggr_input_data(aggr.GetFunctionData(), lstate.allocator);
-		aggr.function.window(params, filter_mask, aggr_input_data, inputs.ColumnCount(), lcstate.state.data(), frame,
-		                     prev, result, i, 0);
+		aggr.function.window(aggr_input_data, *partition_input, gstate_p, lcstate.state.data(), frames, result, i);
+	});
+}
+
+//===--------------------------------------------------------------------===//
+// WindowNaiveAggregator
+//===--------------------------------------------------------------------===//
+WindowNaiveAggregator::WindowNaiveAggregator(AggregateObject aggr, const LogicalType &result_type,
+                                             const WindowExcludeMode exclude_mode_p, idx_t partition_count)
+    : WindowAggregator(std::move(aggr), result_type, exclude_mode_p, partition_count) {
+}
+
+WindowNaiveAggregator::~WindowNaiveAggregator() {
+}
+
+class WindowNaiveState : public WindowAggregatorState {
+public:
+	struct HashRow {
+		explicit HashRow(WindowNaiveState &state) : state(state) {
+		}
+
+		size_t operator()(const idx_t &i) const {
+			return state.Hash(i);
+		}
+
+		WindowNaiveState &state;
+	};
+
+	struct EqualRow {
+		explicit EqualRow(WindowNaiveState &state) : state(state) {
+		}
+
+		bool operator()(const idx_t &lhs, const idx_t &rhs) const {
+			return state.KeyEqual(lhs, rhs);
+		}
+
+		WindowNaiveState &state;
+	};
+
+	using RowSet = std::unordered_set<idx_t, HashRow, EqualRow>;
+
+	explicit WindowNaiveState(const WindowNaiveAggregator &gstate);
+
+	void Evaluate(const DataChunk &bounds, Vector &result, idx_t count, idx_t row_idx);
+
+protected:
+	//! Flush the accumulated intermediate states into the result states
+	void FlushStates();
+
+	//! Hashes a value for the hash table
+	size_t Hash(idx_t rid);
+	//! Compares two values for the hash table
+	bool KeyEqual(const idx_t &lhs, const idx_t &rhs);
+
+	//! The global state
+	const WindowNaiveAggregator &gstate;
+	//! Data pointer that contains a vector of states, used for row aggregation
+	vector<data_t> state;
+	//! Reused result state container for the aggregate
+	Vector statef;
+	//! A vector of pointers to "state", used for buffering intermediate aggregates
+	Vector statep;
+	//! Input data chunk, used for leaf segment aggregation
+	DataChunk leaves;
+	//! The rows beging updated.
+	SelectionVector update_sel;
+	//! Count of buffered values
+	idx_t flush_count;
+	//! The frame boundaries, used for EXCLUDE
+	SubFrames frames;
+	//! The optional hash table used for DISTINCT
+	Vector hashes;
+	HashRow hash_row;
+	EqualRow equal_row;
+	RowSet row_set;
+};
+
+WindowNaiveState::WindowNaiveState(const WindowNaiveAggregator &gstate)
+    : gstate(gstate), state(gstate.state_size * STANDARD_VECTOR_SIZE), statef(LogicalType::POINTER),
+      statep((LogicalType::POINTER)), flush_count(0), hashes(LogicalType::HASH), hash_row(*this), equal_row(*this),
+      row_set(STANDARD_VECTOR_SIZE, hash_row, equal_row) {
+	InitSubFrames(frames, gstate.exclude_mode);
+
+	auto &inputs = const_cast<DataChunk &>(gstate.GetInputs());
+	if (inputs.ColumnCount() > 0) {
+		leaves.Initialize(Allocator::DefaultAllocator(), inputs.GetTypes());
+	}
+
+	update_sel.Initialize();
+
+	//	Build the finalise vector that just points to the result states
+	data_ptr_t state_ptr = state.data();
+	D_ASSERT(statef.GetVectorType() == VectorType::FLAT_VECTOR);
+	statef.SetVectorType(VectorType::CONSTANT_VECTOR);
+	statef.Flatten(STANDARD_VECTOR_SIZE);
+	auto fdata = FlatVector::GetData<data_ptr_t>(statef);
+	for (idx_t i = 0; i < STANDARD_VECTOR_SIZE; ++i) {
+		fdata[i] = state_ptr;
+		state_ptr += gstate.state_size;
 	}
 }
 
+void WindowNaiveState::FlushStates() {
+	if (!flush_count) {
+		return;
+	}
+
+	auto &inputs = const_cast<DataChunk &>(gstate.GetInputs());
+	leaves.Reference(inputs);
+	leaves.Slice(update_sel, flush_count);
+
+	auto &aggr = gstate.aggr;
+	AggregateInputData aggr_input_data(aggr.GetFunctionData(), allocator);
+	aggr.function.update(leaves.data.data(), aggr_input_data, leaves.ColumnCount(), statep, flush_count);
+
+	flush_count = 0;
+}
+
+size_t WindowNaiveState::Hash(idx_t rid) {
+	auto &inputs = const_cast<DataChunk &>(gstate.GetInputs());
+	leaves.Reference(inputs);
+
+	sel_t s = rid;
+	SelectionVector sel(&s);
+	leaves.Slice(sel, 1);
+	leaves.Hash(hashes);
+
+	return *FlatVector::GetData<hash_t>(hashes);
+}
+
+bool WindowNaiveState::KeyEqual(const idx_t &lhs, const idx_t &rhs) {
+	auto &inputs = const_cast<DataChunk &>(gstate.GetInputs());
+
+	sel_t l = lhs;
+	SelectionVector lsel(&l);
+
+	sel_t r = rhs;
+	SelectionVector rsel(&r);
+
+	sel_t f = 0;
+	SelectionVector fsel(&f);
+
+	for (auto &input : inputs.data) {
+		Vector left(input, lsel, 1);
+		Vector right(input, rsel, 1);
+		if (!VectorOperations::NotDistinctFrom(left, right, nullptr, 1, nullptr, &fsel)) {
+			return false;
+		}
+	}
+
+	return true;
+}
+
+void WindowNaiveState::Evaluate(const DataChunk &bounds, Vector &result, idx_t count, idx_t row_idx) {
+	auto &aggr = gstate.aggr;
+	auto &filter_mask = gstate.GetFilterMask();
+
+	auto fdata = FlatVector::GetData<data_ptr_t>(statef);
+	auto pdata = FlatVector::GetData<data_ptr_t>(statep);
+
+	EvaluateSubFrames(bounds, gstate.exclude_mode, count, row_idx, frames, [&](idx_t rid) {
+		auto agg_state = fdata[rid];
+		aggr.function.initialize(agg_state);
+
+		//	Just update the aggregate with the unfiltered input rows
+		row_set.clear();
+		for (const auto &frame : frames) {
+			for (auto f = frame.start; f < frame.end; ++f) {
+				if (!filter_mask.RowIsValid(f)) {
+					continue;
+				}
+
+				//	Filter out duplicates
+				if (aggr.IsDistinct() && !row_set.insert(f).second) {
+					continue;
+				}
+
+				pdata[flush_count] = agg_state;
+				update_sel[flush_count++] = f;
+				if (flush_count >= STANDARD_VECTOR_SIZE) {
+					FlushStates();
+				}
+			}
+		}
+	});
+
+	//	Flush the final states
+	FlushStates();
+
+	//	Finalise the result aggregates and write to the result
+	AggregateInputData aggr_input_data(aggr.GetFunctionData(), allocator);
+	aggr.function.finalize(statef, aggr_input_data, result, count, 0);
+
+	//	Destruct the result aggregates
+	if (aggr.function.destructor) {
+		aggr.function.destructor(statef, aggr_input_data, count);
+	}
+}
+
+unique_ptr<WindowAggregatorState> WindowNaiveAggregator::GetLocalState() const {
+	return make_uniq<WindowNaiveState>(*this);
+}
+
+void WindowNaiveAggregator::Evaluate(WindowAggregatorState &lstate, const DataChunk &bounds, Vector &result,
+                                     idx_t count, idx_t row_idx) const {
+	auto &ldstate = lstate.Cast<WindowNaiveState>();
+	ldstate.Evaluate(bounds, result, count, row_idx);
+}
+
 //===--------------------------------------------------------------------===//
 // WindowSegmentTree
 //===--------------------------------------------------------------------===//
-WindowSegmentTree::WindowSegmentTree(AggregateObject aggr, const LogicalType &result_type, idx_t count,
-                                     WindowAggregationMode mode_p)
-    : WindowAggregator(std::move(aggr), result_type, count), internal_nodes(0), mode(mode_p) {
+WindowSegmentTree::WindowSegmentTree(AggregateObject aggr, const LogicalType &result_type, WindowAggregationMode mode_p,
+                                     const WindowExcludeMode exclude_mode_p, idx_t count)
+    : WindowAggregator(std::move(aggr), result_type, exclude_mode_p, count), internal_nodes(0), mode(mode_p) {
 }
 
-void WindowSegmentTree::Finalize() {
+void WindowSegmentTree::Finalize(const FrameStats &stats) {
+	WindowAggregator::Finalize(stats);
+
 	gstate = GetLocalState();
 	if (inputs.ColumnCount() > 0) {
 		if (aggr.function.combine && UseCombineAPI()) {
@@ -342,27 +637,56 @@ WindowSegmentTree::~WindowSegmentTree() {
 	}
 }
 
-class WindowSegmentTreeState : public WindowAggregatorState {
+class WindowSegmentTreePart {
 public:
-	WindowSegmentTreeState(const AggregateObject &aggr, DataChunk &inputs, const ValidityMask &filter_mask);
-	~WindowSegmentTreeState() override;
+	//! Right side nodes need to be cached and processed in reverse order
+	using RightEntry = std::pair<idx_t, idx_t>;
+
+	enum FramePart : uint8_t { FULL = 0, LEFT = 1, RIGHT = 2 };
+
+	WindowSegmentTreePart(ArenaAllocator &allocator, const AggregateObject &aggr, DataChunk &inputs,
+	                      const ValidityMask &filter_mask);
+	~WindowSegmentTreePart();
+
+	unique_ptr<WindowSegmentTreePart> Copy() const {
+		return make_uniq<WindowSegmentTreePart>(allocator, aggr, inputs, filter_mask);
+	}
 
 	void FlushStates(bool combining);
 	void ExtractFrame(idx_t begin, idx_t end, data_ptr_t current_state);
 	void WindowSegmentValue(const WindowSegmentTree &tree, idx_t l_idx, idx_t begin, idx_t end,
 	                        data_ptr_t current_state);
+	//! Writes result and calls destructors
 	void Finalize(Vector &result, idx_t count);
 
+	void Combine(WindowSegmentTreePart &other, idx_t count);
+
+	void Evaluate(const WindowSegmentTree &tree, const idx_t *begins, const idx_t *ends, Vector &result, idx_t count,
+	              idx_t row_idx, FramePart frame_part);
+
+protected:
+	//! Initialises the accumulation state vector (statef)
+	void Initialize(idx_t count);
+	//! Accumulate upper tree levels
+	void EvaluateUpperLevels(const WindowSegmentTree &tree, const idx_t *begins, const idx_t *ends, idx_t count,
+	                         idx_t row_idx, FramePart frame_part);
+	void EvaluateLeaves(const WindowSegmentTree &tree, const idx_t *begins, const idx_t *ends, idx_t count,
+	                    idx_t row_idx, FramePart frame_part, FramePart leaf_part);
+
 public:
+	//! Allocator for aggregates
+	ArenaAllocator &allocator;
 	//! The aggregate function
 	const AggregateObject &aggr;
-	//! The aggregate function
+	//! Order insensitive aggregate (we can optimise internal combines)
+	const bool order_insensitive;
+	//! The partition arguments
 	DataChunk &inputs;
 	//! The filtered rows in inputs
 	const ValidityMask &filter_mask;
 	//! The size of a single aggregate state
 	const idx_t state_size;
-	//! Data pointer that contains a single state, used for intermediate window segment aggregation
+	//! Data pointer that contains a vector of states, used for intermediate window segment aggregation
 	vector<data_t> state;
 	//! Input data chunk, used for leaf segment aggregation
 	DataChunk leaves;
@@ -376,13 +700,34 @@ public:
 	Vector statef;
 	//! Count of buffered values
 	idx_t flush_count;
+	//! Cache of right side tree ranges for ordered aggregates
+	vector<RightEntry> right_stack;
 };
 
-WindowSegmentTreeState::WindowSegmentTreeState(const AggregateObject &aggr, DataChunk &inputs,
-                                               const ValidityMask &filter_mask)
-    : aggr(aggr), inputs(inputs), filter_mask(filter_mask), state_size(aggr.function.state_size()),
-      state(state_size * STANDARD_VECTOR_SIZE), statep(LogicalType::POINTER), statel(LogicalType::POINTER),
-      statef(LogicalType::POINTER), flush_count(0) {
+class WindowSegmentTreeState : public WindowAggregatorState {
+public:
+	WindowSegmentTreeState(const AggregateObject &aggr, DataChunk &inputs, const ValidityMask &filter_mask)
+	    : aggr(aggr), inputs(inputs), filter_mask(filter_mask), part(allocator, aggr, inputs, filter_mask) {
+	}
+
+	//! The aggregate function
+	const AggregateObject &aggr;
+	//! The aggregate function
+	DataChunk &inputs;
+	//! The filtered rows in inputs
+	const ValidityMask &filter_mask;
+	//! The left (default) segment tree part
+	WindowSegmentTreePart part;
+	//! The right segment tree part (for EXCLUDE)
+	unique_ptr<WindowSegmentTreePart> right_part;
+};
+
+WindowSegmentTreePart::WindowSegmentTreePart(ArenaAllocator &allocator, const AggregateObject &aggr, DataChunk &inputs,
+                                             const ValidityMask &filter_mask)
+    : allocator(allocator), aggr(aggr),
+      order_insensitive(aggr.function.order_dependent == AggregateOrderDependent::NOT_ORDER_DEPENDENT), inputs(inputs),
+      filter_mask(filter_mask), state_size(aggr.function.state_size()), state(state_size * STANDARD_VECTOR_SIZE),
+      statep(LogicalType::POINTER), statel(LogicalType::POINTER), statef(LogicalType::POINTER), flush_count(0) {
 	if (inputs.ColumnCount() > 0) {
 		leaves.Initialize(Allocator::DefaultAllocator(), inputs.GetTypes());
 		filter_sel.Initialize();
@@ -400,14 +745,14 @@ WindowSegmentTreeState::WindowSegmentTreeState(const AggregateObject &aggr, Data
 	}
 }
 
-WindowSegmentTreeState::~WindowSegmentTreeState() {
+WindowSegmentTreePart::~WindowSegmentTreePart() {
 }
 
 unique_ptr<WindowAggregatorState> WindowSegmentTree::GetLocalState() const {
 	return make_uniq<WindowSegmentTreeState>(aggr, const_cast<DataChunk &>(inputs), filter_mask);
 }
 
-void WindowSegmentTreeState::FlushStates(bool combining) {
+void WindowSegmentTreePart::FlushStates(bool combining) {
 	if (!flush_count) {
 		return;
 	}
@@ -425,7 +770,12 @@ void WindowSegmentTreeState::FlushStates(bool combining) {
 	flush_count = 0;
 }
 
-void WindowSegmentTreeState::ExtractFrame(idx_t begin, idx_t end, data_ptr_t state_ptr) {
+void WindowSegmentTreePart::Combine(WindowSegmentTreePart &other, idx_t count) {
+	AggregateInputData aggr_input_data(aggr.GetFunctionData(), allocator);
+	aggr.function.combine(other.statef, statef, aggr_input_data, count);
+}
+
+void WindowSegmentTreePart::ExtractFrame(idx_t begin, idx_t end, data_ptr_t state_ptr) {
 	const auto count = end - begin;
 
 	//	If we are not filtering,
@@ -453,8 +803,8 @@ void WindowSegmentTreeState::ExtractFrame(idx_t begin, idx_t end, data_ptr_t sta
 	}
 }
 
-void WindowSegmentTreeState::WindowSegmentValue(const WindowSegmentTree &tree, idx_t l_idx, idx_t begin, idx_t end,
-                                                data_ptr_t state_ptr) {
+void WindowSegmentTreePart::WindowSegmentValue(const WindowSegmentTree &tree, idx_t l_idx, idx_t begin, idx_t end,
+                                               data_ptr_t state_ptr) {
 	D_ASSERT(begin <= end);
 	if (begin == end || inputs.ColumnCount() == 0) {
 		return;
@@ -479,8 +829,8 @@ void WindowSegmentTreeState::WindowSegmentValue(const WindowSegmentTree &tree, i
 		}
 	}
 }
-void WindowSegmentTreeState::Finalize(Vector &result, idx_t count) {
-	//	Finalise the result aggregates
+void WindowSegmentTreePart::Finalize(Vector &result, idx_t count) {
+	//	Finalise the result aggregates and write to result if write_result is set
 	AggregateInputData aggr_input_data(aggr.GetFunctionData(), allocator);
 	aggr.function.finalize(statef, aggr_input_data, result, count, 0);
 
@@ -494,7 +844,7 @@ void WindowSegmentTree::ConstructTree() {
 	D_ASSERT(inputs.ColumnCount() > 0);
 
 	//	Use a temporary scan state to build the tree
-	auto &gtstate = gstate->Cast<WindowSegmentTreeState>();
+	auto &gtstate = gstate->Cast<WindowSegmentTreeState>().part;
 
 	// compute space required to store internal nodes of segment tree
 	internal_nodes = 0;
@@ -533,51 +883,110 @@ void WindowSegmentTree::ConstructTree() {
 	}
 }
 
-void WindowSegmentTree::Evaluate(WindowAggregatorState &lstate, const idx_t *begins, const idx_t *ends, Vector &result,
-                                 idx_t count) const {
+void WindowSegmentTree::Evaluate(WindowAggregatorState &lstate, const DataChunk &bounds, Vector &result, idx_t count,
+                                 idx_t row_idx) const {
+
 	auto &ltstate = lstate.Cast<WindowSegmentTreeState>();
-	const auto cant_combine = (!aggr.function.combine || !UseCombineAPI());
-	auto fdata = FlatVector::GetData<data_ptr_t>(ltstate.statef);
+	auto window_begin = FlatVector::GetData<const idx_t>(bounds.data[WINDOW_BEGIN]);
+	auto window_end = FlatVector::GetData<const idx_t>(bounds.data[WINDOW_END]);
+	auto peer_begin = FlatVector::GetData<const idx_t>(bounds.data[PEER_BEGIN]);
+	auto peer_end = FlatVector::GetData<const idx_t>(bounds.data[PEER_END]);
+
+	auto &part = ltstate.part;
+	if (exclude_mode != WindowExcludeMode::NO_OTHER) {
+		// 1. evaluate the tree left of the excluded part
+		part.Evaluate(*this, window_begin, peer_begin, result, count, row_idx, WindowSegmentTreePart::LEFT);
+
+		// 2. set up a second state for the right of the excluded part
+		if (!ltstate.right_part) {
+			ltstate.right_part = part.Copy();
+		}
+		auto &right_part = *ltstate.right_part;
+
+		// 3. evaluate the tree right of the excluded part
+		right_part.Evaluate(*this, peer_end, window_end, result, count, row_idx, WindowSegmentTreePart::RIGHT);
+
+		// 4. combine the buffer state into the Segment Tree State
+		part.Combine(right_part, count);
+	} else {
+		part.Evaluate(*this, window_begin, window_end, result, count, row_idx, WindowSegmentTreePart::FULL);
+	}
+
+	part.Finalize(result, count);
+}
+
+void WindowSegmentTreePart::Evaluate(const WindowSegmentTree &tree, const idx_t *begins, const idx_t *ends,
+                                     Vector &result, idx_t count, idx_t row_idx, FramePart frame_part) {
+	D_ASSERT(aggr.function.combine && tree.UseCombineAPI());
+
+	Initialize(count);
+
+	if (order_insensitive) {
+		//	First pass: aggregate the segment tree nodes with sharing
+		EvaluateUpperLevels(tree, begins, ends, count, row_idx, frame_part);
+
+		//	Second pass: aggregate the ragged leaves
+		EvaluateLeaves(tree, begins, ends, count, row_idx, frame_part, FramePart::FULL);
+	} else {
+		//	Evaluate leaves in order
+		EvaluateLeaves(tree, begins, ends, count, row_idx, frame_part, FramePart::LEFT);
+		EvaluateUpperLevels(tree, begins, ends, count, row_idx, frame_part);
+		EvaluateLeaves(tree, begins, ends, count, row_idx, frame_part, FramePart::RIGHT);
+	}
+}
+
+void WindowSegmentTreePart::Initialize(idx_t count) {
+	auto fdata = FlatVector::GetData<data_ptr_t>(statef);
+	for (idx_t rid = 0; rid < count; ++rid) {
+		auto state_ptr = fdata[rid];
+		aggr.function.initialize(state_ptr);
+	}
+}
+
+void WindowSegmentTreePart::EvaluateUpperLevels(const WindowSegmentTree &tree, const idx_t *begins, const idx_t *ends,
+                                                idx_t count, idx_t row_idx, FramePart frame_part) {
+	auto fdata = FlatVector::GetData<data_ptr_t>(statef);
+
+	const auto exclude_mode = tree.exclude_mode;
+	const bool begin_on_curr_row = frame_part == FramePart::RIGHT && exclude_mode == WindowExcludeMode::CURRENT_ROW;
+	const bool end_on_curr_row = frame_part == FramePart::LEFT && exclude_mode == WindowExcludeMode::CURRENT_ROW;
+
+	const auto max_level = tree.levels_flat_start.size() + 1;
+	right_stack.resize(max_level, {0, 0});
 
-	//	First pass: aggregate the segment tree nodes
 	//	Share adjacent identical states
 	//  We do this first because we want to share only tree aggregations
 	idx_t prev_begin = 1;
 	idx_t prev_end = 0;
-	auto ldata = FlatVector::GetData<data_ptr_t>(ltstate.statel);
-	auto pdata = FlatVector::GetData<data_ptr_t>(ltstate.statep);
+	auto ldata = FlatVector::GetData<data_ptr_t>(statel);
+	auto pdata = FlatVector::GetData<data_ptr_t>(statep);
 	data_ptr_t prev_state = nullptr;
-	for (idx_t rid = 0; rid < count; ++rid) {
+	for (idx_t rid = 0, cur_row = row_idx; rid < count; ++rid, ++cur_row) {
 		auto state_ptr = fdata[rid];
-		aggr.function.initialize(state_ptr);
-
-		if (cant_combine) {
-			// Make sure we initialise all states
-			continue;
-		}
 
-		auto begin = begins[rid];
-		auto end = ends[rid];
+		auto begin = begin_on_curr_row ? cur_row + 1 : begins[rid];
+		auto end = end_on_curr_row ? cur_row : ends[rid];
 		if (begin >= end) {
 			continue;
 		}
 
 		//	Skip level 0
 		idx_t l_idx = 0;
-		for (; l_idx < levels_flat_start.size() + 1; l_idx++) {
-			idx_t parent_begin = begin / TREE_FANOUT;
-			idx_t parent_end = end / TREE_FANOUT;
+		idx_t right_max = 0;
+		for (; l_idx < max_level; l_idx++) {
+			idx_t parent_begin = begin / tree.TREE_FANOUT;
+			idx_t parent_end = end / tree.TREE_FANOUT;
 			if (prev_state && l_idx == 1 && begin == prev_begin && end == prev_end) {
 				//	Just combine the previous top level result
-				ldata[ltstate.flush_count] = prev_state;
-				pdata[ltstate.flush_count] = state_ptr;
-				if (++ltstate.flush_count >= STANDARD_VECTOR_SIZE) {
-					ltstate.FlushStates(true);
+				ldata[flush_count] = prev_state;
+				pdata[flush_count] = state_ptr;
+				if (++flush_count >= STANDARD_VECTOR_SIZE) {
+					FlushStates(true);
 				}
 				break;
 			}
 
-			if (l_idx == 1) {
+			if (order_insensitive && l_idx == 1) {
 				prev_state = state_ptr;
 				prev_begin = begin;
 				prev_end = end;
@@ -585,72 +994,507 @@ void WindowSegmentTree::Evaluate(WindowAggregatorState &lstate, const idx_t *beg
 
 			if (parent_begin == parent_end) {
 				if (l_idx) {
-					ltstate.WindowSegmentValue(*this, l_idx, begin, end, state_ptr);
+					WindowSegmentValue(tree, l_idx, begin, end, state_ptr);
 				}
 				break;
 			}
-			idx_t group_begin = parent_begin * TREE_FANOUT;
+			idx_t group_begin = parent_begin * tree.TREE_FANOUT;
 			if (begin != group_begin) {
 				if (l_idx) {
-					ltstate.WindowSegmentValue(*this, l_idx, begin, group_begin + TREE_FANOUT, state_ptr);
+					WindowSegmentValue(tree, l_idx, begin, group_begin + tree.TREE_FANOUT, state_ptr);
 				}
 				parent_begin++;
 			}
-			idx_t group_end = parent_end * TREE_FANOUT;
+			idx_t group_end = parent_end * tree.TREE_FANOUT;
 			if (end != group_end) {
 				if (l_idx) {
-					ltstate.WindowSegmentValue(*this, l_idx, group_end, end, state_ptr);
+					if (order_insensitive) {
+						WindowSegmentValue(tree, l_idx, group_end, end, state_ptr);
+					} else {
+						right_stack[l_idx] = {group_end, end};
+						right_max = l_idx;
+					}
 				}
 			}
 			begin = parent_begin;
 			end = parent_end;
 		}
+
+		// Flush the right side values from left to right for order_sensitive aggregates
+		// As we go up the tree, the right side ranges move left,
+		// so we just cache them in a fixed size, preallocated array.
+		// Then we can just reverse scan the array and append the cached ranges.
+		for (l_idx = right_max; l_idx > 0; --l_idx) {
+			auto &right_entry = right_stack[l_idx];
+			const auto group_end = right_entry.first;
+			const auto end = right_entry.second;
+			if (end) {
+				WindowSegmentValue(tree, l_idx, group_end, end, state_ptr);
+				right_entry = {0, 0};
+			}
+		}
 	}
-	ltstate.FlushStates(true);
+	FlushStates(true);
+}
 
-	//	Second pass: aggregate the ragged leaves
-	//	(or everything if we can't combine)
-	for (idx_t rid = 0; rid < count; ++rid) {
+void WindowSegmentTreePart::EvaluateLeaves(const WindowSegmentTree &tree, const idx_t *begins, const idx_t *ends,
+                                           idx_t count, idx_t row_idx, FramePart frame_part, FramePart leaf_part) {
+
+	auto fdata = FlatVector::GetData<data_ptr_t>(statef);
+
+	// For order-sensitive aggregates, we have to process the ragged leaves in two pieces.
+	// The left side have to be added before the main tree followed by the ragged right sides.
+	// The current row is the leftmost value of the right hand side.
+	const bool compute_left = leaf_part != FramePart::RIGHT;
+	const bool compute_right = leaf_part != FramePart::LEFT;
+	const auto exclude_mode = tree.exclude_mode;
+	const bool begin_on_curr_row = frame_part == FramePart::RIGHT && exclude_mode == WindowExcludeMode::CURRENT_ROW;
+	const bool end_on_curr_row = frame_part == FramePart::LEFT && exclude_mode == WindowExcludeMode::CURRENT_ROW;
+	// with EXCLUDE TIES, in addition to the frame part right of the peer group's end, we also need to consider the
+	// current row
+	const bool add_curr_row = compute_left && frame_part == FramePart::RIGHT && exclude_mode == WindowExcludeMode::TIES;
+
+	for (idx_t rid = 0, cur_row = row_idx; rid < count; ++rid, ++cur_row) {
 		auto state_ptr = fdata[rid];
 
-		const auto begin = begins[rid];
-		const auto end = ends[rid];
+		const auto begin = begin_on_curr_row ? cur_row + 1 : begins[rid];
+		const auto end = end_on_curr_row ? cur_row : ends[rid];
+		if (add_curr_row) {
+			WindowSegmentValue(tree, 0, cur_row, cur_row + 1, state_ptr);
+		}
 		if (begin >= end) {
 			continue;
 		}
 
-		// Aggregate everything at once if we can't combine states
-		idx_t parent_begin = begin / TREE_FANOUT;
-		idx_t parent_end = end / TREE_FANOUT;
-		if (parent_begin == parent_end || cant_combine) {
-			ltstate.WindowSegmentValue(*this, 0, begin, end, state_ptr);
+		idx_t parent_begin = begin / tree.TREE_FANOUT;
+		idx_t parent_end = end / tree.TREE_FANOUT;
+		if (parent_begin == parent_end) {
+			if (compute_left) {
+				WindowSegmentValue(tree, 0, begin, end, state_ptr);
+			}
 			continue;
 		}
 
-		idx_t group_begin = parent_begin * TREE_FANOUT;
-		if (begin != group_begin) {
-			ltstate.WindowSegmentValue(*this, 0, begin, group_begin + TREE_FANOUT, state_ptr);
-			parent_begin++;
+		idx_t group_begin = parent_begin * tree.TREE_FANOUT;
+		if (begin != group_begin && compute_left) {
+			WindowSegmentValue(tree, 0, begin, group_begin + tree.TREE_FANOUT, state_ptr);
 		}
-		idx_t group_end = parent_end * TREE_FANOUT;
-		if (end != group_end) {
-			ltstate.WindowSegmentValue(*this, 0, group_end, end, state_ptr);
+		idx_t group_end = parent_end * tree.TREE_FANOUT;
+		if (end != group_end && compute_right) {
+			WindowSegmentValue(tree, 0, group_end, end, state_ptr);
 		}
 	}
-	ltstate.FlushStates(false);
+	FlushStates(false);
+}
 
-	ltstate.Finalize(result, count);
+//===--------------------------------------------------------------------===//
+// WindowDistinctAggregator
+//===--------------------------------------------------------------------===//
+WindowDistinctAggregator::WindowDistinctAggregator(AggregateObject aggr, const LogicalType &result_type,
+                                                   const WindowExcludeMode exclude_mode_p, idx_t count,
+                                                   ClientContext &context)
+    : WindowAggregator(std::move(aggr), result_type, exclude_mode_p, count), context(context),
+      allocator(Allocator::DefaultAllocator()) {
+
+	payload_types.emplace_back(LogicalType::UBIGINT);
+	payload_chunk.Initialize(Allocator::DefaultAllocator(), payload_types);
+}
 
-	//	Set the validity mask on  the invalid rows
-	auto &rmask = FlatVector::Validity(result);
-	for (idx_t rid = 0; rid < count; ++rid) {
-		const auto begin = begins[rid];
-		const auto end = ends[rid];
+WindowDistinctAggregator::~WindowDistinctAggregator() {
+	if (!aggr.function.destructor) {
+		// nothing to destroy
+		return;
+	}
+	AggregateInputData aggr_input_data(aggr.GetFunctionData(), allocator);
+	// call the destructor for all the intermediate states
+	data_ptr_t address_data[STANDARD_VECTOR_SIZE];
+	Vector addresses(LogicalType::POINTER, data_ptr_cast(address_data));
+	idx_t count = 0;
+	for (idx_t i = 0; i < internal_nodes; i++) {
+		address_data[count++] = data_ptr_t(levels_flat_native.get() + i * state_size);
+		if (count == STANDARD_VECTOR_SIZE) {
+			aggr.function.destructor(addresses, aggr_input_data, count);
+			count = 0;
+		}
+	}
+	if (count > 0) {
+		aggr.function.destructor(addresses, aggr_input_data, count);
+	}
+}
 
-		if (begin >= end) {
-			rmask.SetInvalid(rid);
+void WindowDistinctAggregator::Sink(DataChunk &arg_chunk, SelectionVector *filter_sel, idx_t filtered) {
+	WindowAggregator::Sink(arg_chunk, filter_sel, filtered);
+
+	//	We sort the arguments and use the partition index as a tie-breaker.
+	//	TODO: Use a hash table?
+	if (!global_sort) {
+		//	1:	functionComputePrevIdcs(𝑖𝑛)
+		//	2:		sorted ← []
+		vector<LogicalType> sort_types;
+		for (const auto &col : arg_chunk.data) {
+			sort_types.emplace_back(col.GetType());
+		}
+
+		for (const auto &type : payload_types) {
+			sort_types.emplace_back(type);
+		}
+
+		vector<BoundOrderByNode> orders;
+		for (const auto &type : sort_types) {
+			auto expr = make_uniq<BoundConstantExpression>(Value(type));
+			orders.emplace_back(BoundOrderByNode(OrderType::ASCENDING, OrderByNullType::NULLS_FIRST, std::move(expr)));
+		}
+
+		RowLayout payload_layout;
+		payload_layout.Initialize(payload_types);
+
+		global_sort = make_uniq<GlobalSortState>(BufferManager::GetBufferManager(context), orders, payload_layout);
+		local_sort.Initialize(*global_sort, global_sort->buffer_manager);
+
+		sort_chunk.Initialize(Allocator::DefaultAllocator(), sort_types);
+		sort_chunk.data.back().Reference(payload_chunk.data[0]);
+		payload_pos = 0;
+		memory_per_thread = PhysicalOperator::GetMaxThreadMemory(context);
+	}
+
+	//	3: 	for i ← 0 to in.size do
+	//	4: 		sorted[i] ← (in[i], i)
+	const auto count = arg_chunk.size();
+	auto payload_data = FlatVector::GetData<idx_t>(payload_chunk.data[0]);
+	std::iota(payload_data, payload_data + count, payload_pos);
+	payload_pos += count;
+
+	for (column_t c = 0; c < arg_chunk.ColumnCount(); ++c) {
+		sort_chunk.data[c].Reference(arg_chunk.data[c]);
+	}
+	sort_chunk.SetCardinality(arg_chunk);
+	payload_chunk.SetCardinality(sort_chunk);
+
+	//	Apply FILTER clause, if any
+	if (filter_sel) {
+		sort_chunk.Slice(*filter_sel, filtered);
+		payload_chunk.Slice(*filter_sel, filtered);
+	}
+
+	local_sort.SinkChunk(sort_chunk, payload_chunk);
+
+	if (local_sort.SizeInBytes() > memory_per_thread) {
+		local_sort.Sort(*global_sort, true);
+	}
+}
+
+class WindowDistinctAggregator::DistinctSortTree : public MergeSortTree<idx_t, idx_t> {
+public:
+	// prev_idx, input_idx
+	using ZippedTuple = std::tuple<idx_t, idx_t>;
+	using ZippedElements = vector<ZippedTuple>;
+
+	DistinctSortTree(ZippedElements &&prev_idcs, WindowDistinctAggregator &wda);
+};
+
+void WindowDistinctAggregator::Finalize(const FrameStats &stats) {
+	//	5: Sort sorted lexicographically increasing
+	global_sort->AddLocalState(local_sort);
+	global_sort->PrepareMergePhase();
+	while (global_sort->sorted_blocks.size() > 1) {
+		global_sort->InitializeMergeRound();
+		MergeSorter merge_sorter(*global_sort, global_sort->buffer_manager);
+		merge_sorter.PerformInMergeRound();
+		global_sort->CompleteMergeRound(true);
+	}
+
+	DataChunk scan_chunk;
+	scan_chunk.Initialize(Allocator::DefaultAllocator(), payload_types);
+
+	auto scanner = make_uniq<PayloadScanner>(*global_sort);
+	const auto in_size = scanner->Remaining();
+	scanner->Scan(scan_chunk);
+	idx_t scan_idx = 0;
+
+	//	6:	prevIdcs ← []
+	//	7:	prevIdcs[0] ← “-”
+	const auto count = inputs.size();
+	using ZippedTuple = DistinctSortTree::ZippedTuple;
+	DistinctSortTree::ZippedElements prev_idcs;
+	prev_idcs.resize(count);
+
+	//	To handle FILTER clauses we make the missing elements
+	//	point to themselves so they won't be counted.
+	if (in_size < count) {
+		for (idx_t i = 0; i < count; ++i) {
+			prev_idcs[i] = ZippedTuple(i + 1, i);
+		}
+	}
+
+	auto *input_idx = FlatVector::GetData<idx_t>(scan_chunk.data[0]);
+	auto i = input_idx[scan_idx++];
+	prev_idcs[i] = ZippedTuple(0, i);
+
+	SBIterator curr(*global_sort, ExpressionType::COMPARE_LESSTHAN);
+	SBIterator prev(*global_sort, ExpressionType::COMPARE_LESSTHAN);
+	auto prefix_layout = global_sort->sort_layout.GetPrefixComparisonLayout(sort_chunk.ColumnCount() - 1);
+
+	//	8:	for i ← 1 to in.size do
+	for (++curr; curr.GetIndex() < in_size; ++curr, ++prev) {
+		//	Scan second one chunk at a time
+		//	Note the scan is one behind the iterators
+		if (scan_idx >= scan_chunk.size()) {
+			scan_chunk.Reset();
+			scanner->Scan(scan_chunk);
+			scan_idx = 0;
+			input_idx = FlatVector::GetData<idx_t>(scan_chunk.data[0]);
+		}
+		auto second = i;
+		i = input_idx[scan_idx++];
+
+		int lt = 0;
+		if (prefix_layout.all_constant) {
+			lt = FastMemcmp(prev.entry_ptr, curr.entry_ptr, prefix_layout.comparison_size);
+		} else {
+			lt = Comparators::CompareTuple(prev.scan, curr.scan, prev.entry_ptr, curr.entry_ptr, prefix_layout,
+			                               prev.external);
+		}
+
+		//	9:	if sorted[i].first == sorted[i-1].first then
+		//	10:		prevIdcs[i] ← sorted[i-1].second
+		//	11:	else
+		//	12:		prevIdcs[i] ← “-”
+		if (!lt) {
+			prev_idcs[i] = ZippedTuple(second + 1, i);
+		} else {
+			prev_idcs[i] = ZippedTuple(0, i);
+		}
+	}
+	//	13:	return prevIdcs
+
+	merge_sort_tree = make_uniq<DistinctSortTree>(std::move(prev_idcs), *this);
+}
+
+WindowDistinctAggregator::DistinctSortTree::DistinctSortTree(ZippedElements &&prev_idcs,
+                                                             WindowDistinctAggregator &wda) {
+	auto &inputs = wda.inputs;
+	auto &aggr = wda.aggr;
+	auto &allocator = wda.allocator;
+	const auto state_size = wda.state_size;
+	auto &internal_nodes = wda.internal_nodes;
+	auto &levels_flat_native = wda.levels_flat_native;
+	auto &levels_flat_start = wda.levels_flat_start;
+
+	//! Input data chunk, used for leaf segment aggregation
+	DataChunk leaves;
+	leaves.Initialize(Allocator::DefaultAllocator(), inputs.GetTypes());
+	SelectionVector sel;
+	sel.Initialize();
+
+	AggregateInputData aggr_input_data(aggr.GetFunctionData(), allocator);
+
+	//! The states to update
+	Vector update_v(LogicalType::POINTER);
+	auto updates = FlatVector::GetData<data_ptr_t>(update_v);
+	idx_t nupdate = 0;
+
+	Vector source_v(LogicalType::POINTER);
+	auto sources = FlatVector::GetData<data_ptr_t>(source_v);
+	Vector target_v(LogicalType::POINTER);
+	auto targets = FlatVector::GetData<data_ptr_t>(target_v);
+	idx_t ncombine = 0;
+
+	// compute space required to store aggregation states of merge sort tree
+	// this is one aggregate state per entry per level
+	MergeSortTree<ZippedTuple> zipped_tree(std::move(prev_idcs));
+	internal_nodes = 0;
+	for (idx_t level_nr = 0; level_nr < zipped_tree.tree.size(); ++level_nr) {
+		internal_nodes += zipped_tree.tree[level_nr].first.size();
+	}
+	levels_flat_native = make_unsafe_uniq_array<data_t>(internal_nodes * state_size);
+	levels_flat_start.push_back(0);
+	idx_t levels_flat_offset = 0;
+
+	//	Walk the distinct value tree building the intermediate aggregates
+	tree.reserve(zipped_tree.tree.size());
+	idx_t level_width = 1;
+	for (idx_t level_nr = 0; level_nr < zipped_tree.tree.size(); ++level_nr) {
+		auto &zipped_level = zipped_tree.tree[level_nr].first;
+		vector<ElementType> level;
+		level.reserve(zipped_level.size());
+
+		for (idx_t i = 0; i < zipped_level.size(); i += level_width) {
+			//	Reset the combine state
+			data_ptr_t prev_state = nullptr;
+			auto next_limit = MinValue<idx_t>(zipped_level.size(), i + level_width);
+			for (auto j = i; j < next_limit; ++j) {
+				//	Initialise the next aggregate
+				auto curr_state = levels_flat_native.get() + (levels_flat_offset++ * state_size);
+				aggr.function.initialize(curr_state);
+
+				//	Update this state (if it matches)
+				const auto prev_idx = std::get<0>(zipped_level[j]);
+				level.emplace_back(prev_idx);
+				if (prev_idx < i + 1) {
+					updates[nupdate] = curr_state;
+					//	input_idx
+					sel[nupdate] = std::get<1>(zipped_level[j]);
+					++nupdate;
+				}
+
+				//	Merge the previous state (if any)
+				if (prev_state) {
+					sources[ncombine] = prev_state;
+					targets[ncombine] = curr_state;
+					++ncombine;
+				}
+				prev_state = curr_state;
+
+				//	Flush the states if one is maxed out.
+				if (MaxValue<idx_t>(ncombine, nupdate) >= STANDARD_VECTOR_SIZE) {
+					//	Push the updates first so they propagate
+					leaves.Reference(inputs);
+					leaves.Slice(sel, nupdate);
+					aggr.function.update(leaves.data.data(), aggr_input_data, leaves.ColumnCount(), update_v, nupdate);
+					nupdate = 0;
+
+					//	Combine the states sequentially
+					aggr.function.combine(source_v, target_v, aggr_input_data, ncombine);
+					ncombine = 0;
+				}
+			}
 		}
+
+		tree.emplace_back(std::move(level), std::move(zipped_tree.tree[level_nr].second));
+
+		levels_flat_start.push_back(levels_flat_offset);
+		level_width *= FANOUT;
+	}
+
+	//	Flush any remaining states
+	if (ncombine || nupdate) {
+		//	Push  the updates
+		leaves.Reference(inputs);
+		leaves.Slice(sel, nupdate);
+		aggr.function.update(leaves.data.data(), aggr_input_data, leaves.ColumnCount(), update_v, nupdate);
+		nupdate = 0;
+
+		//	Combine the states sequentially
+		aggr.function.combine(source_v, target_v, aggr_input_data, ncombine);
+		ncombine = 0;
+	}
+}
+
+class WindowDistinctState : public WindowAggregatorState {
+public:
+	WindowDistinctState(const AggregateObject &aggr, DataChunk &inputs, const WindowDistinctAggregator &tree);
+
+	void Evaluate(const DataChunk &bounds, Vector &result, idx_t count, idx_t row_idx);
+
+protected:
+	//! Flush the accumulated intermediate states into the result states
+	void FlushStates();
+
+	//! The aggregate function
+	const AggregateObject &aggr;
+	//! The aggregate function
+	DataChunk &inputs;
+	//! The merge sort tree data
+	const WindowDistinctAggregator &tree;
+	//! The size of a single aggregate state
+	const idx_t state_size;
+	//! Data pointer that contains a vector of states, used for row aggregation
+	vector<data_t> state;
+	//! Reused result state container for the window functions
+	Vector statef;
+	//! A vector of pointers to "state", used for buffering intermediate aggregates
+	Vector statep;
+	//! Reused state pointers for combining tree elements
+	Vector statel;
+	//! Count of buffered values
+	idx_t flush_count;
+	//! The frame boundaries, used for the window functions
+	SubFrames frames;
+};
+
+WindowDistinctState::WindowDistinctState(const AggregateObject &aggr, DataChunk &inputs,
+                                         const WindowDistinctAggregator &tree)
+    : aggr(aggr), inputs(inputs), tree(tree), state_size(aggr.function.state_size()),
+      state((state_size * STANDARD_VECTOR_SIZE)), statef(LogicalType::POINTER), statep(LogicalType::POINTER),
+      statel(LogicalType::POINTER), flush_count(0) {
+	InitSubFrames(frames, tree.exclude_mode);
+
+	//	Build the finalise vector that just points to the result states
+	data_ptr_t state_ptr = state.data();
+	D_ASSERT(statef.GetVectorType() == VectorType::FLAT_VECTOR);
+	statef.SetVectorType(VectorType::CONSTANT_VECTOR);
+	statef.Flatten(STANDARD_VECTOR_SIZE);
+	auto fdata = FlatVector::GetData<data_ptr_t>(statef);
+	for (idx_t i = 0; i < STANDARD_VECTOR_SIZE; ++i) {
+		fdata[i] = state_ptr;
+		state_ptr += state_size;
+	}
+}
+
+void WindowDistinctState::FlushStates() {
+	if (!flush_count) {
+		return;
 	}
+
+	AggregateInputData aggr_input_data(aggr.GetFunctionData(), allocator);
+	statel.Verify(flush_count);
+	aggr.function.combine(statel, statep, aggr_input_data, flush_count);
+
+	flush_count = 0;
+}
+
+void WindowDistinctState::Evaluate(const DataChunk &bounds, Vector &result, idx_t count, idx_t row_idx) {
+	auto fdata = FlatVector::GetData<data_ptr_t>(statef);
+	auto ldata = FlatVector::GetData<data_ptr_t>(statel);
+	auto pdata = FlatVector::GetData<data_ptr_t>(statep);
+
+	const auto &merge_sort_tree = *tree.merge_sort_tree;
+	const auto running_aggs = tree.levels_flat_native.get();
+
+	EvaluateSubFrames(bounds, tree.exclude_mode, count, row_idx, frames, [&](idx_t rid) {
+		auto agg_state = fdata[rid];
+		aggr.function.initialize(agg_state);
+
+		//	TODO: Extend AggregateLowerBound to handle subframes, just like SelectNth.
+		const auto lower = frames[0].start;
+		const auto upper = frames[0].end;
+		merge_sort_tree.AggregateLowerBound(lower, upper, lower + 1,
+		                                    [&](idx_t level, const idx_t run_begin, const idx_t run_pos) {
+			                                    if (run_pos != run_begin) {
+				                                    //	Find the source aggregate
+				                                    // Buffer a merge of the indicated state into the current state
+				                                    const auto agg_idx = tree.levels_flat_start[level] + run_pos - 1;
+				                                    const auto running_agg = running_aggs + agg_idx * state_size;
+				                                    pdata[flush_count] = agg_state;
+				                                    ldata[flush_count++] = running_agg;
+				                                    if (flush_count >= STANDARD_VECTOR_SIZE) {
+					                                    FlushStates();
+				                                    }
+			                                    }
+		                                    });
+	});
+
+	//	Flush the final states
+	FlushStates();
+
+	//	Finalise the result aggregates and write to the result
+	AggregateInputData aggr_input_data(aggr.GetFunctionData(), allocator);
+	aggr.function.finalize(statef, aggr_input_data, result, count, 0);
+
+	//	Destruct the result aggregates
+	if (aggr.function.destructor) {
+		aggr.function.destructor(statef, aggr_input_data, count);
+	}
+}
+
+unique_ptr<WindowAggregatorState> WindowDistinctAggregator::GetLocalState() const {
+	return make_uniq<WindowDistinctState>(aggr, const_cast<DataChunk &>(inputs), *this);
+}
+
+void WindowDistinctAggregator::Evaluate(WindowAggregatorState &lstate, const DataChunk &bounds, Vector &result,
+                                        idx_t count, idx_t row_idx) const {
+	auto &ldstate = lstate.Cast<WindowDistinctState>();
+	ldstate.Evaluate(bounds, result, count, row_idx);
 }
 
 } // namespace duckdb