feat: Add ability to explain groupNode and it's attribute(s).

query/graphql/mapper/mapper.go

@@ -780,18 +780,22 @@ func toGroupBy(source *parserTypes.GroupBy, mapping *core.DocumentMapping) *Grou
 		return nil
 	}
 
-	indexes := make([]int, len(source.Fields))
+	fields := make([]Field, len(source.Fields))
 	for i, fieldName := range source.Fields {
 		// If there are multiple properties of the same name we can just take the first as
 		// we have no other reasonable way of identifying which property they mean if multiple
 		// consumer specified requestables are available.  Aggregate dependencies should not
 		// impact this as they are added after selects.
 		key := mapping.FirstIndexOfName(fieldName)
-		indexes[i] = key
+
+		fields[i] = Field{
+			Index: key,
+			Name:  fieldName,
+		}
 	}
 
 	return &GroupBy{
-		FieldIndexes: indexes,
+		Fields: fields,
 	}
 }
 

query/graphql/mapper/targetable.go

@@ -84,7 +84,7 @@ type Limit struct {
 // GroupBy represents a grouping instruction on a query.
 type GroupBy struct {
 	// The indexes of fields by which documents should be grouped. Ordered.
-	FieldIndexes []int
+	Fields []Field
 }
 
 type SortDirection string

query/graphql/planner/arbitrary_join.go

@@ -15,6 +15,7 @@ import (
 	"strings"
 
 	"github.com/sourcenetwork/defradb/core"
+	"github.com/sourcenetwork/defradb/query/graphql/mapper"
 )
 
 // A data-source that may yield child items, parent items, or both depending on configuration
@@ -111,7 +112,7 @@ func (n *dataSource) Source() planNode {
 }
 
 func (source *dataSource) mergeParent(
-	keyIndexes []int,
+	keyFields []mapper.Field,
 	destination *orderedMap,
 	childIndexes []int,
 ) (bool, error) {
@@ -132,15 +133,15 @@ func (source *dataSource) mergeParent(
 	}
 
 	value := source.parentSource.Value()
-	key := generateKey(value, keyIndexes)
+	key := generateKey(value, keyFields)
 
 	destination.mergeParent(key, childIndexes, value)
 
 	return true, nil
 }
 
 func (source *dataSource) appendChild(
-	keyIndexes []int,
+	keyFields []mapper.Field,
 	valuesByKey *orderedMap,
 	mapping *core.DocumentMapping,
 ) (bool, error) {
@@ -165,14 +166,18 @@ func (source *dataSource) appendChild(
 	// the same order - we need to treat it as a new item, regenerating the key and potentially caching
 	// it without yet receiving the parent-level details
 	value := source.childSource.Value()
-	key := generateKey(value, keyIndexes)
+	key := generateKey(value, keyFields)
 
 	valuesByKey.appendChild(key, source.childIndex, value, mapping)
 
 	return true, nil
 }
 
-func join(sources []*dataSource, keyIndexes []int, mapping *core.DocumentMapping) (*orderedMap, error) {
+func join(
+	sources []*dataSource,
+	keyFields []mapper.Field,
+	mapping *core.DocumentMapping,
+) (*orderedMap, error) {
 	result := orderedMap{
 		values:       []core.Doc{},
 		indexesByKey: map[string]int{},
@@ -190,14 +195,14 @@ func join(sources []*dataSource, keyIndexes []int, mapping *core.DocumentMapping
 
 		for hasNextParent || hasNextChild {
 			if hasNextParent {
-				hasNextParent, err = source.mergeParent(keyIndexes, &result, childIndexes)
+				hasNextParent, err = source.mergeParent(keyFields, &result, childIndexes)
 				if err != nil {
 					return nil, err
 				}
 			}
 
 			if hasNextChild {
-				hasNextChild, err = source.appendChild(keyIndexes, &result, mapping)
+				hasNextChild, err = source.appendChild(keyFields, &result, mapping)
 				if err != nil {
 					return nil, err
 				}
@@ -208,11 +213,11 @@ func join(sources []*dataSource, keyIndexes []int, mapping *core.DocumentMapping
 	return &result, nil
 }
 
-func generateKey(doc core.Doc, keyIndexes []int) string {
+func generateKey(doc core.Doc, keyFields []mapper.Field) string {
 	keyBuilder := strings.Builder{}
-	for _, keyField := range keyIndexes {
-		keyBuilder.WriteString(fmt.Sprint(keyField))
-		keyBuilder.WriteString(fmt.Sprintf("_%v_", doc.Fields[keyField]))
+	for _, keyField := range keyFields {
+		keyBuilder.WriteString(fmt.Sprint(keyField.Index))
+		keyBuilder.WriteString(fmt.Sprintf("_%v_", doc.Fields[keyField.Index]))
 	}
 	return keyBuilder.String()
 }

query/graphql/planner/explain.go

@@ -27,6 +27,7 @@ var (
 	_ explainablePlanNode = (*createNode)(nil)
 	_ explainablePlanNode = (*dagScanNode)(nil)
 	_ explainablePlanNode = (*deleteNode)(nil)
+	_ explainablePlanNode = (*groupNode)(nil)
 	_ explainablePlanNode = (*hardLimitNode)(nil)
 	_ explainablePlanNode = (*orderNode)(nil)
 	_ explainablePlanNode = (*renderLimitNode)(nil)

query/graphql/planner/group.go

@@ -11,6 +11,8 @@
 package planner
 
 import (
+	"fmt"
+
 	"github.com/sourcenetwork/defradb/core"
 	"github.com/sourcenetwork/defradb/query/graphql/mapper"
 
@@ -29,7 +31,7 @@ type groupNode struct {
 
 	// The fields to group by - this must be an ordered collection and
 	// will include any parent group-by fields (if any)
-	groupByFieldIndexes []int
+	groupByFields []mapper.Field
 
 	// The data sources that this node will draw data from.
 	dataSources []*dataSource
@@ -61,17 +63,17 @@ func (p *Planner) GroupBy(n *mapper.GroupBy, parsed *mapper.Select, childSelects
 		if childSelect.GroupBy != nil {
 			// group by fields have to be propagated downwards to ensure correct sub-grouping, otherwise child
 			// groups will only group on the fields they explicitly reference
-			childSelect.GroupBy.FieldIndexes = append(childSelect.GroupBy.FieldIndexes, n.FieldIndexes...)
+			childSelect.GroupBy.Fields = append(childSelect.GroupBy.Fields, n.Fields...)
 		}
 		dataSources = append(dataSources, newDataSource(childSelect.Index))
 	}
 
 	groupNodeObj := groupNode{
-		p:                   p,
-		childSelects:        childSelects,
-		groupByFieldIndexes: n.FieldIndexes,
-		dataSources:         dataSources,
-		docMapper:           docMapper{&parsed.DocumentMapping},
+		p:             p,
+		childSelects:  childSelects,
+		groupByFields: n.Fields,
+		dataSources:   dataSources,
+		docMapper:     docMapper{&parsed.DocumentMapping},
 	}
 	return &groupNodeObj, nil
 }
@@ -127,7 +129,7 @@ func (n *groupNode) Source() planNode { return n.dataSources[0].Source() }
 
 func (n *groupNode) Next() (bool, error) {
 	if n.values == nil {
-		values, err := join(n.dataSources, n.groupByFieldIndexes, n.documentMapping)
+		values, err := join(n.dataSources, n.groupByFields, n.documentMapping)
 		if err != nil {
 			return false, err
 		}
@@ -169,3 +171,110 @@ func (n *groupNode) Next() (bool, error) {
 
 	return false, nil
 }
+
+// Explain method returns a map containing all attributes of this node that
+// are to be explained, subscribes / opts-in this node to be an explainablePlanNode.
+func (n *groupNode) Explain() (map[string]interface{}, error) {
+	explainerMap := map[string]interface{}{}
+
+	// Get the parent level groupBy attribute(s).
+	groupByFields := []string{}
+	for _, field := range n.groupByFields {
+		groupByFields = append(
+			groupByFields,
+			field.Name,
+		)
+	}
+	explainerMap["groupByFields"] = groupByFields
+
+	// Get the inner group (child) selection attribute(s).
+	if len(n.childSelects) == 0 {
+		explainerMap["childSelects"] = nil
+	} else {
+		childSelects := make([]map[string]interface{}, 0, len(n.childSelects))
+		for _, child := range n.childSelects {
+			if child == nil {
+				continue
+			}
+
+			childExplainGraph := map[string]interface{}{}
+
+			childExplainGraph[collectionNameLabel] = child.CollectionName
+
+			c := child.Targetable
+
+			// Get targetable attribute(s) of this child.
+
+			if c.DocKeys.HasValue {
+				childExplainGraph["docKeys"] = c.DocKeys.Value
+			} else {
+				childExplainGraph["docKeys"] = nil
+			}
+
+			if c.Filter == nil || c.Filter.ExternalConditions == nil {
+				childExplainGraph[filterLabel] = nil
+			} else {
+				childExplainGraph[filterLabel] = c.Filter.ExternalConditions
+			}
+
+			if c.Limit != nil {
+				childExplainGraph[limitLabel] = map[string]interface{}{
+					limitLabel:  c.Limit.Limit,
+					offsetLabel: c.Limit.Offset,
+				}
+			} else {
+				childExplainGraph[limitLabel] = nil
+			}
+
+			if c.OrderBy != nil {
+				innerOrderings := []map[string]interface{}{}
+				for _, condition := range c.OrderBy.Conditions {
+					orderFieldNames := []string{}
+
+					for _, orderFieldIndex := range condition.FieldIndexes {
+						// Try to find the name of this index.
+						fieldName, found := n.documentMapping.TryToFindNameFromIndex(orderFieldIndex)
+						if !found {
+							return nil, fmt.Errorf(
+								"No order field name (for grouping) was found for index =%d",
+								orderFieldIndex,
+							)
+						}
+
+						orderFieldNames = append(orderFieldNames, fieldName)
+					}
+					// Put it all together for this order element.
+					innerOrderings = append(innerOrderings,
+						map[string]interface{}{
+							"fields":    orderFieldNames,
+							"direction": string(condition.Direction),
+						},
+					)
+				}
+
+				childExplainGraph["orderBy"] = innerOrderings
+			} else {
+				childExplainGraph["orderBy"] = nil
+			}
+
+			if c.GroupBy != nil {
+				innerGroupByFields := []string{}
+				for _, fieldOfChildGroupBy := range c.GroupBy.Fields {
+					innerGroupByFields = append(
+						innerGroupByFields,
+						fieldOfChildGroupBy.Name,
+					)
+				}
+				childExplainGraph["groupBy"] = innerGroupByFields
+			} else {
+				childExplainGraph["groupBy"] = nil
+			}
+
+			childSelects = append(childSelects, childExplainGraph)
+		}
+
+		explainerMap["childSelects"] = childSelects
+	}
+
+	return explainerMap, nil
+}