WIP: add utils for building and printing the tree

Author: douglasmdev

internal/db/db.go

@@ -244,6 +244,15 @@ func readQueryResults(queryRows *sql.Rows, statementResultCh chan StatementResul
 }
 
 func readQueryResultSet(queryRows *sql.Rows, statementResultCh chan StatementResult, query string) (shouldContinue bool) {
+	if strings.Contains(query, "EXPLAIN") {
+		root, err := BuildQueryPlanTree(queryRows)
+		if err != nil {
+			println("Failed to build tree")
+			fmt.Printf("Error: %v \n", err)
+		} else {
+			PrintQueryPlanTree(root, "")
+		}
+	}
 	columnNames, err := getColumnNames(queryRows)
 	if err != nil {
 		statementResultCh <- *newStatementResultWithError(err)

internal/db/explainTreeBuilder.go

@@ -0,0 +1,58 @@
+package db
+
+import (
+	"database/sql"
+	"fmt"
+)
+
+type QueryPlanNode struct {
+	ID       int
+	ParentID int
+	NotUsed  int
+	Detail   string
+	Children []*QueryPlanNode
+}
+
+func BuildQueryPlanTree(rows *sql.Rows) (*QueryPlanNode, error) {
+	var nodes []*QueryPlanNode
+	nodeMap := make(map[int]*QueryPlanNode)
+
+	for rows.Next() {
+		var id, parentID, notUsed int
+		var detail string
+
+		err := rows.Scan(&id, &parentID, &notUsed, &detail)
+		if err != nil {
+			return nil, err
+		}
+
+		node := &QueryPlanNode{
+			ID:       id,
+			ParentID: parentID,
+			NotUsed:  notUsed,
+			Detail:   detail,
+		}
+
+		nodes = append(nodes, node)
+		nodeMap[id] = node
+	}
+
+	root := &QueryPlanNode{}
+	for _, node := range nodes {
+		if node.ParentID == 0 {
+			root = node
+		} else {
+			parent := nodeMap[node.ParentID]
+			parent.Children = append(parent.Children, node)
+		}
+	}
+
+	return root, nil
+}
+
+func PrintQueryPlanTree(node *QueryPlanNode, indent string) {
+	fmt.Printf("%s%s\n", indent, node.Detail)
+	for _, child := range node.Children {
+		PrintQueryPlanTree(child, indent+"  ")
+	}
+}