diff --git a/go/store/prolly/map.go b/go/store/prolly/map.go
index f2f0634600..a0f323d174 100644
--- a/go/store/prolly/map.go
+++ b/go/store/prolly/map.go
@@ -59,18 +59,32 @@ func NewMap(node tree.Node, ns tree.NodeStore, keyDesc, valDesc val.TupleDesc) M
 
 // NewMapFromTuples creates a prolly tree Map from slice of sorted Tuples.
 func NewMapFromTuples(ctx context.Context, ns tree.NodeStore, keyDesc, valDesc val.TupleDesc, tups ...val.Tuple) (Map, error) {
+	if len(tups)%2 != 0 {
+		return Map{}, fmt.Errorf("tuples must be key-value pairs")
+	}
+
+	return NewMapFromProvider(ctx, ns, keyDesc, valDesc, &sliceIter{tuples: tups})
+}
+
+type TupleProvider MapIter
+
+func NewMapFromProvider(ctx context.Context, ns tree.NodeStore, keyDesc, valDesc val.TupleDesc, iter TupleProvider) (Map, error) {
 	serializer := message.ProllyMapSerializer{Pool: ns.Pool()}
 	ch, err := tree.NewEmptyChunker(ctx, ns, serializer)
 	if err != nil {
 		return Map{}, err
 	}
 
-	if len(tups)%2 != 0 {
-		return Map{}, fmt.Errorf("tuples must be key-value pairs")
-	}
-
-	for i := 0; i < len(tups); i += 2 {
-		if err = ch.AddPair(ctx, tree.Item(tups[i]), tree.Item(tups[i+1])); err != nil {
+	var k, v val.Tuple
+	for {
+		k, v, err = iter.Next(ctx)
+		if err == io.EOF {
+			break
+		}
+		if err != nil {
+			return Map{}, err
+		}
+		if err = ch.AddPair(ctx, tree.Item(k), tree.Item(v)); err != nil {
 			return Map{}, err
 		}
 	}
diff --git a/go/store/prolly/range_iter.go b/go/store/prolly/range_iter.go
index 4c60d1985b..94bef5eae2 100644
--- a/go/store/prolly/range_iter.go
+++ b/go/store/prolly/range_iter.go
@@ -208,3 +208,17 @@ func (f filteredIter) Next(ctx context.Context) (k, v val.Tuple, err error) {
 		return
 	}
 }
+
+type sliceIter struct {
+	tuples []val.Tuple
+}
+
+func (s *sliceIter) Next(context.Context) (k, v val.Tuple, err error) {
+	if len(s.tuples) < 2 {
+		err = io.EOF
+	} else {
+		k, v = s.tuples[0], s.tuples[1]
+		s.tuples = s.tuples[2:]
+	}
+	return
+}