package engine import ( "context" "encoding/json" "fmt" "math" "regexp" "strconv" "strings" "time" "github.com/seaweedfs/seaweedfs/weed/filer" "github.com/seaweedfs/seaweedfs/weed/mq/schema" "github.com/seaweedfs/seaweedfs/weed/pb/filer_pb" "github.com/seaweedfs/seaweedfs/weed/pb/schema_pb" "github.com/seaweedfs/seaweedfs/weed/query/sqltypes" "github.com/seaweedfs/seaweedfs/weed/util" util_http "github.com/seaweedfs/seaweedfs/weed/util/http" "github.com/xwb1989/sqlparser" "google.golang.org/protobuf/proto" ) // SQLEngine provides SQL query execution capabilities for SeaweedFS // Assumptions: // 1. MQ namespaces map directly to SQL databases // 2. MQ topics map directly to SQL tables // 3. Schema evolution is handled transparently with backward compatibility // 4. Queries run against Parquet-stored MQ messages type SQLEngine struct { catalog *SchemaCatalog } // QueryResult represents the result of a SQL query execution type QueryResult struct { Columns []string `json:"columns"` Rows [][]sqltypes.Value `json:"rows"` Error error `json:"error,omitempty"` } // NewSQLEngine creates a new SQL execution engine // Uses master address for service discovery and initialization func NewSQLEngine(masterAddress string) *SQLEngine { // Initialize global HTTP client if not already done // This is needed for reading partition data from the filer if util_http.GetGlobalHttpClient() == nil { util_http.InitGlobalHttpClient() } return &SQLEngine{ catalog: NewSchemaCatalog(masterAddress), } } // GetCatalog returns the schema catalog for external access func (e *SQLEngine) GetCatalog() *SchemaCatalog { return e.catalog } // ExecuteSQL parses and executes a SQL statement // Assumptions: // 1. All SQL statements are MySQL-compatible via xwb1989/sqlparser // 2. DDL operations (CREATE/ALTER/DROP) modify underlying MQ topics // 3. DML operations (SELECT) query Parquet files directly // 4. Error handling follows MySQL conventions func (e *SQLEngine) ExecuteSQL(ctx context.Context, sql string) (*QueryResult, error) { // Handle DESCRIBE/DESC as a special case since it's not parsed as a standard statement sqlUpper := strings.ToUpper(strings.TrimSpace(sql)) if strings.HasPrefix(sqlUpper, "DESCRIBE") || strings.HasPrefix(sqlUpper, "DESC") { return e.handleDescribeCommand(ctx, sql) } // Parse the SQL statement stmt, err := sqlparser.Parse(sql) if err != nil { return &QueryResult{ Error: fmt.Errorf("SQL parse error: %v", err), }, err } // Route to appropriate handler based on statement type switch stmt := stmt.(type) { case *sqlparser.Show: return e.executeShowStatementWithDescribe(ctx, stmt) case *sqlparser.DDL: return e.executeDDLStatement(ctx, stmt) case *sqlparser.Select: return e.executeSelectStatement(ctx, stmt) default: err := fmt.Errorf("unsupported SQL statement type: %T", stmt) return &QueryResult{Error: err}, err } } // executeDDLStatement handles CREATE, ALTER, DROP operations // Assumption: These operations modify the underlying MQ topic structure func (e *SQLEngine) executeDDLStatement(ctx context.Context, stmt *sqlparser.DDL) (*QueryResult, error) { switch stmt.Action { case sqlparser.CreateStr: return e.createTable(ctx, stmt) case sqlparser.AlterStr: return e.alterTable(ctx, stmt) case sqlparser.DropStr: return e.dropTable(ctx, stmt) default: err := fmt.Errorf("unsupported DDL action: %s", stmt.Action) return &QueryResult{Error: err}, err } } // executeSelectStatement handles SELECT queries // Assumptions: // 1. Queries run against Parquet files in MQ topics // 2. Predicate pushdown is used for efficiency // 3. Cross-topic joins are supported via partition-aware execution func (e *SQLEngine) executeSelectStatement(ctx context.Context, stmt *sqlparser.Select) (*QueryResult, error) { // Parse FROM clause to get table (topic) information if len(stmt.From) != 1 { err := fmt.Errorf("SELECT supports single table queries only") return &QueryResult{Error: err}, err } // Extract table reference var database, tableName string switch table := stmt.From[0].(type) { case *sqlparser.AliasedTableExpr: switch tableExpr := table.Expr.(type) { case sqlparser.TableName: tableName = tableExpr.Name.String() if tableExpr.Qualifier.String() != "" { database = tableExpr.Qualifier.String() } default: err := fmt.Errorf("unsupported table expression: %T", tableExpr) return &QueryResult{Error: err}, err } default: err := fmt.Errorf("unsupported FROM clause: %T", table) return &QueryResult{Error: err}, err } // Use current database context if not specified if database == "" { database = e.catalog.GetCurrentDatabase() if database == "" { database = "default" } } // Auto-discover and register topic if not already in catalog if _, err := e.catalog.GetTableInfo(database, tableName); err != nil { // Topic not in catalog, try to discover and register it if regErr := e.discoverAndRegisterTopic(ctx, database, tableName); regErr != nil { fmt.Printf("Warning: Failed to discover topic %s.%s: %v\n", database, tableName, regErr) } } // Create HybridMessageScanner for the topic (reads both live logs + Parquet files) // RESOLVED TODO: Get real filerClient from broker connection var filerClient filer_pb.FilerClient if e.catalog.brokerClient != nil { var filerClientErr error filerClient, filerClientErr = e.catalog.brokerClient.GetFilerClient() if filerClientErr != nil { // Log warning but continue with sample data fallback fmt.Printf("Warning: Failed to get filer client: %v, using sample data\n", filerClientErr) } } hybridScanner, err := NewHybridMessageScanner(filerClient, database, tableName) if err != nil { // Fallback to sample data if topic doesn't exist or filer unavailable return e.executeSelectWithSampleData(ctx, stmt, database, tableName) } // Parse SELECT columns and detect aggregation functions var columns []string var aggregations []AggregationSpec selectAll := false hasAggregations := false for _, selectExpr := range stmt.SelectExprs { switch expr := selectExpr.(type) { case *sqlparser.StarExpr: selectAll = true case *sqlparser.AliasedExpr: switch col := expr.Expr.(type) { case *sqlparser.ColName: columns = append(columns, col.Name.String()) case *sqlparser.FuncExpr: // Handle aggregation functions aggSpec, err := e.parseAggregationFunction(col, expr) if err != nil { return &QueryResult{Error: err}, err } aggregations = append(aggregations, *aggSpec) hasAggregations = true default: err := fmt.Errorf("unsupported SELECT expression: %T", col) return &QueryResult{Error: err}, err } default: err := fmt.Errorf("unsupported SELECT expression: %T", expr) return &QueryResult{Error: err}, err } } // If we have aggregations, use aggregation query path if hasAggregations { return e.executeAggregationQuery(ctx, hybridScanner, aggregations, stmt) } // Parse WHERE clause for predicate pushdown var predicate func(*schema_pb.RecordValue) bool if stmt.Where != nil { predicate, err = e.buildPredicate(stmt.Where.Expr) if err != nil { return &QueryResult{Error: err}, err } } // Parse LIMIT clause limit := 0 if stmt.Limit != nil && stmt.Limit.Rowcount != nil { switch limitExpr := stmt.Limit.Rowcount.(type) { case *sqlparser.SQLVal: if limitExpr.Type == sqlparser.IntVal { var parseErr error limit64, parseErr := strconv.ParseInt(string(limitExpr.Val), 10, 64) if parseErr != nil { return &QueryResult{Error: parseErr}, parseErr } if limit64 > math.MaxInt32 || limit64 < 0 { return &QueryResult{Error: fmt.Errorf("LIMIT value %d is out of valid range", limit64)}, fmt.Errorf("LIMIT value %d is out of valid range", limit64) } limit = int(limit64) } } } // Build hybrid scan options // RESOLVED TODO: Extract from WHERE clause time filters startTimeNs, stopTimeNs := int64(0), int64(0) if stmt.Where != nil { startTimeNs, stopTimeNs = e.extractTimeFilters(stmt.Where.Expr) } hybridScanOptions := HybridScanOptions{ StartTimeNs: startTimeNs, // Extracted from WHERE clause time comparisons StopTimeNs: stopTimeNs, // Extracted from WHERE clause time comparisons Limit: limit, Predicate: predicate, } if !selectAll { hybridScanOptions.Columns = columns } // Execute the hybrid scan (live logs + Parquet files) results, err := hybridScanner.Scan(ctx, hybridScanOptions) if err != nil { return &QueryResult{Error: err}, err } // Convert to SQL result format if selectAll { columns = nil // Let converter determine all columns } return hybridScanner.ConvertToSQLResult(results, columns), nil } // executeSelectWithSampleData provides enhanced sample data that simulates both live and archived messages func (e *SQLEngine) executeSelectWithSampleData(ctx context.Context, stmt *sqlparser.Select, database, tableName string) (*QueryResult, error) { // Create a sample HybridMessageScanner to simulate both data sources now := time.Now().UnixNano() var sampleResults []HybridScanResult switch tableName { case "user_events": sampleResults = []HybridScanResult{ // Live log data (recent) { Values: map[string]*schema_pb.Value{ "user_id": {Kind: &schema_pb.Value_Int32Value{Int32Value: 1003}}, "event_type": {Kind: &schema_pb.Value_StringValue{StringValue: "live_login"}}, "data": {Kind: &schema_pb.Value_StringValue{StringValue: `{"ip": "10.0.0.1", "live": true}`}}, }, Timestamp: now - 300000000000, // 5 minutes ago Key: []byte("live-1003"), Source: "live_log", }, { Values: map[string]*schema_pb.Value{ "user_id": {Kind: &schema_pb.Value_Int32Value{Int32Value: 1004}}, "event_type": {Kind: &schema_pb.Value_StringValue{StringValue: "live_click"}}, "data": {Kind: &schema_pb.Value_StringValue{StringValue: `{"button": "submit", "live": true}`}}, }, Timestamp: now - 120000000000, // 2 minutes ago Key: []byte("live-1004"), Source: "live_log", }, // Archived Parquet data (older) { Values: map[string]*schema_pb.Value{ "user_id": {Kind: &schema_pb.Value_Int32Value{Int32Value: 1001}}, "event_type": {Kind: &schema_pb.Value_StringValue{StringValue: "archived_login"}}, "data": {Kind: &schema_pb.Value_StringValue{StringValue: `{"ip": "192.168.1.1", "archived": true}`}}, }, Timestamp: now - 3600000000000, // 1 hour ago Key: []byte("archived-1001"), Source: "parquet_archive", }, { Values: map[string]*schema_pb.Value{ "user_id": {Kind: &schema_pb.Value_Int32Value{Int32Value: 1002}}, "event_type": {Kind: &schema_pb.Value_StringValue{StringValue: "archived_logout"}}, "data": {Kind: &schema_pb.Value_StringValue{StringValue: `{"duration": 1800, "archived": true}`}}, }, Timestamp: now - 1800000000000, // 30 minutes ago Key: []byte("archived-1002"), Source: "parquet_archive", }, } case "system_logs": sampleResults = []HybridScanResult{ // Live system logs { Values: map[string]*schema_pb.Value{ "level": {Kind: &schema_pb.Value_StringValue{StringValue: "INFO"}}, "message": {Kind: &schema_pb.Value_StringValue{StringValue: "Live service heartbeat"}}, "service": {Kind: &schema_pb.Value_StringValue{StringValue: "api-gateway"}}, }, Timestamp: now - 60000000000, // 1 minute ago Key: []byte("live-log-001"), Source: "live_log", }, // Archived system logs { Values: map[string]*schema_pb.Value{ "level": {Kind: &schema_pb.Value_StringValue{StringValue: "ERROR"}}, "message": {Kind: &schema_pb.Value_StringValue{StringValue: "Database connection timeout"}}, "service": {Kind: &schema_pb.Value_StringValue{StringValue: "user-service"}}, }, Timestamp: now - 7200000000000, // 2 hours ago Key: []byte("archived-error-001"), Source: "parquet_archive", }, } default: return &QueryResult{ Error: fmt.Errorf("table '%s.%s' not found", database, tableName), }, fmt.Errorf("table '%s.%s' not found", database, tableName) } // Apply basic LIMIT if specified if stmt.Limit != nil && stmt.Limit.Rowcount != nil { if limitExpr, ok := stmt.Limit.Rowcount.(*sqlparser.SQLVal); ok && limitExpr.Type == sqlparser.IntVal { if limit64, err := strconv.ParseInt(string(limitExpr.Val), 10, 64); err == nil { if limit64 > math.MaxInt32 || limit64 < 0 { return &QueryResult{ Error: fmt.Errorf("LIMIT value %d is out of valid range", limit64), }, fmt.Errorf("LIMIT value %d is out of valid range", limit64) } limit := int(limit64) if limit > 0 && limit < len(sampleResults) { sampleResults = sampleResults[:limit] } } } } // Convert to SQL result format using hybrid scanner logic return convertHybridResultsToSQL(sampleResults, nil), nil } // convertHybridResultsToSQL converts HybridScanResults to SQL format (helper function) func convertHybridResultsToSQL(results []HybridScanResult, columns []string) *QueryResult { if len(results) == 0 { return &QueryResult{ Columns: columns, Rows: [][]sqltypes.Value{}, } } // Determine columns if not specified if len(columns) == 0 { columnSet := make(map[string]bool) for _, result := range results { for columnName := range result.Values { columnSet[columnName] = true } } columns = make([]string, 0, len(columnSet)) for columnName := range columnSet { columns = append(columns, columnName) } // Add metadata columns showing data source columns = append(columns, "_source") } // Convert to SQL rows rows := make([][]sqltypes.Value, len(results)) for i, result := range results { row := make([]sqltypes.Value, len(columns)) for j, columnName := range columns { if columnName == "_source" { row[j] = sqltypes.NewVarChar(result.Source) } else if value, exists := result.Values[columnName]; exists { row[j] = convertSchemaValueToSQL(value) } else { row[j] = sqltypes.NULL } } rows[i] = row } return &QueryResult{ Columns: columns, Rows: rows, } } // extractTimeFilters extracts time range filters from WHERE clause for optimization // This allows push-down of time-based queries to improve scan performance // Returns (startTimeNs, stopTimeNs) where 0 means unbounded func (e *SQLEngine) extractTimeFilters(expr sqlparser.Expr) (int64, int64) { startTimeNs, stopTimeNs := int64(0), int64(0) // Recursively extract time filters from expression tree e.extractTimeFiltersRecursive(expr, &startTimeNs, &stopTimeNs) return startTimeNs, stopTimeNs } // extractTimeFiltersRecursive recursively processes WHERE expressions to find time comparisons func (e *SQLEngine) extractTimeFiltersRecursive(expr sqlparser.Expr, startTimeNs, stopTimeNs *int64) { switch exprType := expr.(type) { case *sqlparser.ComparisonExpr: e.extractTimeFromComparison(exprType, startTimeNs, stopTimeNs) case *sqlparser.AndExpr: // For AND expressions, combine time filters (intersection) e.extractTimeFiltersRecursive(exprType.Left, startTimeNs, stopTimeNs) e.extractTimeFiltersRecursive(exprType.Right, startTimeNs, stopTimeNs) case *sqlparser.OrExpr: // For OR expressions, we can't easily optimize time ranges // Skip time filter extraction for OR clauses to avoid incorrect results return case *sqlparser.ParenExpr: // Unwrap parentheses and continue e.extractTimeFiltersRecursive(exprType.Expr, startTimeNs, stopTimeNs) } } // extractTimeFromComparison extracts time bounds from comparison expressions // Handles comparisons against timestamp columns (_timestamp_ns, timestamp, created_at, etc.) func (e *SQLEngine) extractTimeFromComparison(comp *sqlparser.ComparisonExpr, startTimeNs, stopTimeNs *int64) { // Check if this is a time-related column comparison leftCol := e.getColumnName(comp.Left) rightCol := e.getColumnName(comp.Right) var valueExpr sqlparser.Expr var reversed bool // Determine which side is the time column if e.isTimeColumn(leftCol) { valueExpr = comp.Right reversed = false } else if e.isTimeColumn(rightCol) { valueExpr = comp.Left reversed = true } else { // Not a time comparison return } // Extract the time value timeValue := e.extractTimeValue(valueExpr) if timeValue == 0 { // Couldn't parse time value return } // Apply the comparison operator to determine time bounds operator := comp.Operator if reversed { // Reverse the operator if column and value are swapped operator = e.reverseOperator(operator) } switch operator { case sqlparser.GreaterThanStr: // timestamp > value if *startTimeNs == 0 || timeValue > *startTimeNs { *startTimeNs = timeValue } case sqlparser.GreaterEqualStr: // timestamp >= value if *startTimeNs == 0 || timeValue >= *startTimeNs { *startTimeNs = timeValue } case sqlparser.LessThanStr: // timestamp < value if *stopTimeNs == 0 || timeValue < *stopTimeNs { *stopTimeNs = timeValue } case sqlparser.LessEqualStr: // timestamp <= value if *stopTimeNs == 0 || timeValue <= *stopTimeNs { *stopTimeNs = timeValue } case sqlparser.EqualStr: // timestamp = value (point query) // For exact matches, set both bounds to the same value *startTimeNs = timeValue *stopTimeNs = timeValue } } // isTimeColumn checks if a column name refers to a timestamp field func (e *SQLEngine) isTimeColumn(columnName string) bool { if columnName == "" { return false } // System timestamp columns timeColumns := []string{ "_timestamp_ns", // SeaweedFS MQ system timestamp (nanoseconds) "timestamp_ns", // Alternative naming "timestamp", // Common timestamp field "created_at", // Common creation time field "updated_at", // Common update time field "event_time", // Event timestamp "log_time", // Log timestamp "ts", // Short form } for _, timeCol := range timeColumns { if strings.EqualFold(columnName, timeCol) { return true } } return false } // getColumnName extracts column name from expression (handles ColName types) func (e *SQLEngine) getColumnName(expr sqlparser.Expr) string { switch exprType := expr.(type) { case *sqlparser.ColName: return exprType.Name.String() } return "" } // extractTimeValue parses time values from SQL expressions // Supports nanosecond timestamps, ISO dates, and relative times func (e *SQLEngine) extractTimeValue(expr sqlparser.Expr) int64 { switch exprType := expr.(type) { case *sqlparser.SQLVal: if exprType.Type == sqlparser.IntVal { // Parse as nanosecond timestamp if val, err := strconv.ParseInt(string(exprType.Val), 10, 64); err == nil { return val } } else if exprType.Type == sqlparser.StrVal { // Parse as ISO date or other string formats timeStr := string(exprType.Val) // Try parsing as RFC3339 (ISO 8601) if t, err := time.Parse(time.RFC3339, timeStr); err == nil { return t.UnixNano() } // Try parsing as RFC3339 with nanoseconds if t, err := time.Parse(time.RFC3339Nano, timeStr); err == nil { return t.UnixNano() } // Try parsing as date only (YYYY-MM-DD) if t, err := time.Parse("2006-01-02", timeStr); err == nil { return t.UnixNano() } // Try parsing as datetime (YYYY-MM-DD HH:MM:SS) if t, err := time.Parse("2006-01-02 15:04:05", timeStr); err == nil { return t.UnixNano() } } } return 0 // Couldn't parse } // reverseOperator reverses comparison operators when column and value are swapped func (e *SQLEngine) reverseOperator(op string) string { switch op { case sqlparser.GreaterThanStr: return sqlparser.LessThanStr case sqlparser.GreaterEqualStr: return sqlparser.LessEqualStr case sqlparser.LessThanStr: return sqlparser.GreaterThanStr case sqlparser.LessEqualStr: return sqlparser.GreaterEqualStr case sqlparser.EqualStr: return sqlparser.EqualStr case sqlparser.NotEqualStr: return sqlparser.NotEqualStr default: return op } } // buildPredicate creates a predicate function from a WHERE clause expression // This is a simplified implementation - a full implementation would be much more complex func (e *SQLEngine) buildPredicate(expr sqlparser.Expr) (func(*schema_pb.RecordValue) bool, error) { switch exprType := expr.(type) { case *sqlparser.ComparisonExpr: return e.buildComparisonPredicate(exprType) case *sqlparser.AndExpr: leftPred, err := e.buildPredicate(exprType.Left) if err != nil { return nil, err } rightPred, err := e.buildPredicate(exprType.Right) if err != nil { return nil, err } return func(record *schema_pb.RecordValue) bool { return leftPred(record) && rightPred(record) }, nil case *sqlparser.OrExpr: leftPred, err := e.buildPredicate(exprType.Left) if err != nil { return nil, err } rightPred, err := e.buildPredicate(exprType.Right) if err != nil { return nil, err } return func(record *schema_pb.RecordValue) bool { return leftPred(record) || rightPred(record) }, nil default: return nil, fmt.Errorf("unsupported WHERE expression: %T", expr) } } // buildComparisonPredicate creates a predicate for comparison operations (=, <, >, etc.) func (e *SQLEngine) buildComparisonPredicate(expr *sqlparser.ComparisonExpr) (func(*schema_pb.RecordValue) bool, error) { // Extract column name (left side) colName, ok := expr.Left.(*sqlparser.ColName) if !ok { return nil, fmt.Errorf("unsupported comparison left side: %T", expr.Left) } columnName := colName.Name.String() // Extract comparison value (right side) var compareValue interface{} switch val := expr.Right.(type) { case *sqlparser.SQLVal: switch val.Type { case sqlparser.IntVal: intVal, err := strconv.ParseInt(string(val.Val), 10, 64) if err != nil { return nil, err } compareValue = intVal case sqlparser.StrVal: compareValue = string(val.Val) default: return nil, fmt.Errorf("unsupported SQL value type: %v", val.Type) } case sqlparser.ValTuple: // Handle IN expressions with multiple values: column IN (value1, value2, value3) var inValues []interface{} for _, tupleVal := range val { switch v := tupleVal.(type) { case *sqlparser.SQLVal: switch v.Type { case sqlparser.IntVal: intVal, err := strconv.ParseInt(string(v.Val), 10, 64) if err != nil { return nil, err } inValues = append(inValues, intVal) case sqlparser.StrVal: inValues = append(inValues, string(v.Val)) } } } compareValue = inValues default: return nil, fmt.Errorf("unsupported comparison right side: %T", expr.Right) } // Create predicate based on operator operator := expr.Operator return func(record *schema_pb.RecordValue) bool { fieldValue, exists := record.Fields[columnName] if !exists { return false } return e.evaluateComparison(fieldValue, operator, compareValue) }, nil } // evaluateComparison performs the actual comparison func (e *SQLEngine) evaluateComparison(fieldValue *schema_pb.Value, operator string, compareValue interface{}) bool { // This is a simplified implementation // A full implementation would handle type coercion and all comparison operators switch operator { case "=": return e.valuesEqual(fieldValue, compareValue) case "<": return e.valueLessThan(fieldValue, compareValue) case ">": return e.valueGreaterThan(fieldValue, compareValue) case "<=": return e.valuesEqual(fieldValue, compareValue) || e.valueLessThan(fieldValue, compareValue) case ">=": return e.valuesEqual(fieldValue, compareValue) || e.valueGreaterThan(fieldValue, compareValue) case "!=", "<>": return !e.valuesEqual(fieldValue, compareValue) case "LIKE", "like": return e.valueLike(fieldValue, compareValue) case "IN", "in": return e.valueIn(fieldValue, compareValue) default: return false } } // Helper functions for value comparison (simplified implementation) func (e *SQLEngine) valuesEqual(fieldValue *schema_pb.Value, compareValue interface{}) bool { switch v := fieldValue.Kind.(type) { case *schema_pb.Value_Int32Value: if intVal, ok := compareValue.(int64); ok { if intVal > math.MaxInt32 || intVal < math.MinInt32 { return false // Value out of range for int32, cannot be equal } return v.Int32Value == int32(intVal) } case *schema_pb.Value_Int64Value: if intVal, ok := compareValue.(int64); ok { return v.Int64Value == intVal } case *schema_pb.Value_StringValue: if strVal, ok := compareValue.(string); ok { return v.StringValue == strVal } } return false } func (e *SQLEngine) valueLessThan(fieldValue *schema_pb.Value, compareValue interface{}) bool { switch v := fieldValue.Kind.(type) { case *schema_pb.Value_Int32Value: if intVal, ok := compareValue.(int64); ok { if intVal > math.MaxInt32 { return true // int32 value is always less than values > MaxInt32 } if intVal < math.MinInt32 { return false // int32 value is always greater than values < MinInt32 } return v.Int32Value < int32(intVal) } case *schema_pb.Value_Int64Value: if intVal, ok := compareValue.(int64); ok { return v.Int64Value < intVal } } return false } func (e *SQLEngine) valueGreaterThan(fieldValue *schema_pb.Value, compareValue interface{}) bool { switch v := fieldValue.Kind.(type) { case *schema_pb.Value_Int32Value: if intVal, ok := compareValue.(int64); ok { if intVal > math.MaxInt32 { return false // int32 value is never greater than values > MaxInt32 } if intVal < math.MinInt32 { return true // int32 value is always greater than values < MinInt32 } return v.Int32Value > int32(intVal) } case *schema_pb.Value_Int64Value: if intVal, ok := compareValue.(int64); ok { return v.Int64Value > intVal } } return false } // valueLike implements SQL LIKE pattern matching with % and _ wildcards func (e *SQLEngine) valueLike(fieldValue *schema_pb.Value, compareValue interface{}) bool { // Only support LIKE for string values stringVal, ok := fieldValue.Kind.(*schema_pb.Value_StringValue) if !ok { return false } pattern, ok := compareValue.(string) if !ok { return false } // Convert SQL LIKE pattern to Go regex pattern // % matches any sequence of characters (.*), _ matches single character (.) regexPattern := strings.ReplaceAll(pattern, "%", ".*") regexPattern = strings.ReplaceAll(regexPattern, "_", ".") regexPattern = "^" + regexPattern + "$" // Anchor to match entire string // Compile and match regex regex, err := regexp.Compile(regexPattern) if err != nil { return false // Invalid pattern } return regex.MatchString(stringVal.StringValue) } // valueIn implements SQL IN operator for checking if value exists in a list func (e *SQLEngine) valueIn(fieldValue *schema_pb.Value, compareValue interface{}) bool { // For now, handle simple case where compareValue is a slice of values // In a full implementation, this would handle SQL IN expressions properly values, ok := compareValue.([]interface{}) if !ok { return false } // Check if fieldValue matches any value in the list for _, value := range values { if e.valuesEqual(fieldValue, value) { return true } } return false } // Helper methods for specific operations func (e *SQLEngine) showDatabases(ctx context.Context) (*QueryResult, error) { databases := e.catalog.ListDatabases() result := &QueryResult{ Columns: []string{"Database"}, Rows: make([][]sqltypes.Value, len(databases)), } for i, db := range databases { result.Rows[i] = []sqltypes.Value{ sqltypes.NewVarChar(db), } } return result, nil } func (e *SQLEngine) showTables(ctx context.Context, dbName string) (*QueryResult, error) { // Use current database context if no database specified if dbName == "" { dbName = e.catalog.GetCurrentDatabase() if dbName == "" { dbName = "default" } } tables, err := e.catalog.ListTables(dbName) if err != nil { return &QueryResult{Error: err}, err } result := &QueryResult{ Columns: []string{"Tables_in_" + dbName}, Rows: make([][]sqltypes.Value, len(tables)), } for i, table := range tables { result.Rows[i] = []sqltypes.Value{ sqltypes.NewVarChar(table), } } return result, nil } func (e *SQLEngine) createTable(ctx context.Context, stmt *sqlparser.DDL) (*QueryResult, error) { // Parse CREATE TABLE statement // Assumption: Table name format is [database.]table_name tableName := stmt.NewName.Name.String() database := "" // Check if database is specified in table name if stmt.NewName.Qualifier.String() != "" { database = stmt.NewName.Qualifier.String() } else { // Use current database context or default database = e.catalog.GetCurrentDatabase() if database == "" { database = "default" } } // Parse column definitions from CREATE TABLE // Assumption: stmt.TableSpec contains column definitions if stmt.TableSpec == nil || len(stmt.TableSpec.Columns) == 0 { err := fmt.Errorf("CREATE TABLE requires column definitions") return &QueryResult{Error: err}, err } // Convert SQL columns to MQ schema fields fields := make([]*schema_pb.Field, len(stmt.TableSpec.Columns)) for i, col := range stmt.TableSpec.Columns { fieldType, err := e.convertSQLTypeToMQ(col.Type) if err != nil { return &QueryResult{Error: err}, err } fields[i] = &schema_pb.Field{ Name: col.Name.String(), Type: fieldType, } } // Create record type for the topic recordType := &schema_pb.RecordType{ Fields: fields, } // Create the topic via broker partitionCount := int32(6) // Default partition count - TODO: make configurable err := e.catalog.brokerClient.ConfigureTopic(ctx, database, tableName, partitionCount, recordType) if err != nil { return &QueryResult{Error: err}, err } // Register the new topic in catalog mqSchema := &schema.Schema{ Namespace: database, Name: tableName, RecordType: recordType, RevisionId: 1, // Initial revision } err = e.catalog.RegisterTopic(database, tableName, mqSchema) if err != nil { return &QueryResult{Error: err}, err } // Return success result result := &QueryResult{ Columns: []string{"Result"}, Rows: [][]sqltypes.Value{ {sqltypes.NewVarChar(fmt.Sprintf("Table '%s.%s' created successfully", database, tableName))}, }, } return result, nil } func (e *SQLEngine) alterTable(ctx context.Context, stmt *sqlparser.DDL) (*QueryResult, error) { // TODO: Implement table alteration // This will modify the MQ topic schema with versioning err := fmt.Errorf("ALTER TABLE not yet implemented") return &QueryResult{Error: err}, err } func (e *SQLEngine) dropTable(ctx context.Context, stmt *sqlparser.DDL) (*QueryResult, error) { // Parse DROP TABLE statement // Assumption: Table name is in stmt.NewName for DROP operations tableName := stmt.NewName.Name.String() database := "" // Check if database is specified in table name if stmt.NewName.Qualifier.String() != "" { database = stmt.NewName.Qualifier.String() } else { // Use current database context or default database = e.catalog.GetCurrentDatabase() if database == "" { database = "default" } } // Delete the topic via broker err := e.catalog.brokerClient.DeleteTopic(ctx, database, tableName) if err != nil { return &QueryResult{Error: err}, err } // Remove from catalog cache // TODO: Implement catalog cache removal // Return success result result := &QueryResult{ Columns: []string{"Result"}, Rows: [][]sqltypes.Value{ {sqltypes.NewVarChar(fmt.Sprintf("Table '%s.%s' dropped successfully", database, tableName))}, }, } return result, nil } // AggregationSpec defines an aggregation function to be computed type AggregationSpec struct { Function string // COUNT, SUM, AVG, MIN, MAX Column string // Column name, or "*" for COUNT(*) Alias string // Optional alias for the result column Distinct bool // Support for DISTINCT keyword } // AggregationResult holds the computed result of an aggregation type AggregationResult struct { Count int64 Sum float64 Min interface{} Max interface{} } // parseAggregationFunction parses an aggregation function expression func (e *SQLEngine) parseAggregationFunction(funcExpr *sqlparser.FuncExpr, aliasExpr *sqlparser.AliasedExpr) (*AggregationSpec, error) { funcName := strings.ToUpper(funcExpr.Name.String()) spec := &AggregationSpec{ Function: funcName, } // Parse function arguments switch funcName { case "COUNT": if len(funcExpr.Exprs) != 1 { return nil, fmt.Errorf("COUNT function expects exactly 1 argument") } switch arg := funcExpr.Exprs[0].(type) { case *sqlparser.StarExpr: spec.Column = "*" spec.Alias = "COUNT(*)" case *sqlparser.AliasedExpr: if colName, ok := arg.Expr.(*sqlparser.ColName); ok { spec.Column = colName.Name.String() spec.Alias = fmt.Sprintf("COUNT(%s)", spec.Column) } else { return nil, fmt.Errorf("COUNT argument must be a column name or *") } default: return nil, fmt.Errorf("unsupported COUNT argument: %T", arg) } case "SUM", "AVG", "MIN", "MAX": if len(funcExpr.Exprs) != 1 { return nil, fmt.Errorf("%s function expects exactly 1 argument", funcName) } switch arg := funcExpr.Exprs[0].(type) { case *sqlparser.AliasedExpr: if colName, ok := arg.Expr.(*sqlparser.ColName); ok { spec.Column = colName.Name.String() spec.Alias = fmt.Sprintf("%s(%s)", funcName, spec.Column) } else { return nil, fmt.Errorf("%s argument must be a column name", funcName) } default: return nil, fmt.Errorf("unsupported %s argument: %T", funcName, arg) } default: return nil, fmt.Errorf("unsupported aggregation function: %s", funcName) } // Override with user-specified alias if provided if !aliasExpr.As.IsEmpty() { spec.Alias = aliasExpr.As.String() } return spec, nil } // executeAggregationQuery handles SELECT queries with aggregation functions func (e *SQLEngine) executeAggregationQuery(ctx context.Context, hybridScanner *HybridMessageScanner, aggregations []AggregationSpec, stmt *sqlparser.Select) (*QueryResult, error) { // Parse WHERE clause for filtering var predicate func(*schema_pb.RecordValue) bool var err error if stmt.Where != nil { predicate, err = e.buildPredicate(stmt.Where.Expr) if err != nil { return &QueryResult{Error: err}, err } } // Extract time filters for optimization startTimeNs, stopTimeNs := int64(0), int64(0) if stmt.Where != nil { startTimeNs, stopTimeNs = e.extractTimeFilters(stmt.Where.Expr) } // FAST PATH: Try to use parquet statistics for optimization // This can be ~130x faster than scanning all data if stmt.Where == nil { // Only optimize when no complex WHERE clause fastResult, canOptimize := e.tryFastParquetAggregation(ctx, hybridScanner, aggregations) if canOptimize { fmt.Printf("Using fast hybrid statistics for aggregation (parquet stats + live log counts)\n") return fastResult, nil } } // SLOW PATH: Fall back to full table scan fmt.Printf("Using full table scan for aggregation (parquet optimization not applicable)\n") // Build scan options for full table scan (aggregations need all data) hybridScanOptions := HybridScanOptions{ StartTimeNs: startTimeNs, StopTimeNs: stopTimeNs, Limit: 0, // No limit for aggregations - need all data Predicate: predicate, } // Execute the hybrid scan to get all matching records results, err := hybridScanner.Scan(ctx, hybridScanOptions) if err != nil { return &QueryResult{Error: err}, err } // Compute aggregations aggResults := e.computeAggregations(results, aggregations) // Build result set columns := make([]string, len(aggregations)) row := make([]sqltypes.Value, len(aggregations)) for i, spec := range aggregations { columns[i] = spec.Alias row[i] = e.formatAggregationResult(spec, aggResults[i]) } return &QueryResult{ Columns: columns, Rows: [][]sqltypes.Value{row}, }, nil } // computeAggregations computes aggregation functions over the scan results func (e *SQLEngine) computeAggregations(results []HybridScanResult, aggregations []AggregationSpec) []AggregationResult { aggResults := make([]AggregationResult, len(aggregations)) for i, spec := range aggregations { switch spec.Function { case "COUNT": if spec.Column == "*" { // COUNT(*) counts all rows aggResults[i].Count = int64(len(results)) } else if spec.Distinct { // COUNT(DISTINCT column) counts unique non-null values uniqueValues := make(map[string]bool) for _, result := range results { if value := e.findColumnValue(result, spec.Column); value != nil { if !e.isNullValue(value) { // Use string representation for uniqueness check rawValue := e.extractRawValue(value) if rawValue != nil { uniqueValues[fmt.Sprintf("%v", rawValue)] = true } } } } aggResults[i].Count = int64(len(uniqueValues)) } else { // COUNT(column) counts non-null values count := int64(0) for _, result := range results { if value := e.findColumnValue(result, spec.Column); value != nil { if !e.isNullValue(value) { count++ } } } aggResults[i].Count = count } case "SUM": sum := float64(0) for _, result := range results { if value := e.findColumnValue(result, spec.Column); value != nil { if numValue := e.convertToNumber(value); numValue != nil { sum += *numValue } } } aggResults[i].Sum = sum case "AVG": sum := float64(0) count := int64(0) for _, result := range results { if value := e.findColumnValue(result, spec.Column); value != nil { if numValue := e.convertToNumber(value); numValue != nil { sum += *numValue count++ } } } if count > 0 { aggResults[i].Sum = sum / float64(count) // Store average in Sum field aggResults[i].Count = count } case "MIN": var min interface{} var minValue *schema_pb.Value for _, result := range results { if value := e.findColumnValue(result, spec.Column); value != nil { if minValue == nil || e.compareValues(value, minValue) < 0 { minValue = value min = e.extractRawValue(value) } } } aggResults[i].Min = min case "MAX": var max interface{} var maxValue *schema_pb.Value for _, result := range results { if value := e.findColumnValue(result, spec.Column); value != nil { if maxValue == nil || e.compareValues(value, maxValue) > 0 { maxValue = value max = e.extractRawValue(value) } } } aggResults[i].Max = max } } return aggResults } // Helper functions for aggregation processing func (e *SQLEngine) isNullValue(value *schema_pb.Value) bool { return value == nil || value.Kind == nil } func (e *SQLEngine) convertToNumber(value *schema_pb.Value) *float64 { switch v := value.Kind.(type) { case *schema_pb.Value_Int32Value: result := float64(v.Int32Value) return &result case *schema_pb.Value_Int64Value: result := float64(v.Int64Value) return &result case *schema_pb.Value_FloatValue: result := float64(v.FloatValue) return &result case *schema_pb.Value_DoubleValue: return &v.DoubleValue } return nil } func (e *SQLEngine) extractRawValue(value *schema_pb.Value) interface{} { switch v := value.Kind.(type) { case *schema_pb.Value_Int32Value: return v.Int32Value case *schema_pb.Value_Int64Value: return v.Int64Value case *schema_pb.Value_FloatValue: return v.FloatValue case *schema_pb.Value_DoubleValue: return v.DoubleValue case *schema_pb.Value_StringValue: return v.StringValue case *schema_pb.Value_BoolValue: return v.BoolValue case *schema_pb.Value_BytesValue: return string(v.BytesValue) // Convert bytes to string for comparison } return nil } func (e *SQLEngine) compareValues(value1 *schema_pb.Value, value2 *schema_pb.Value) int { if value2 == nil { return 1 // value1 > nil } raw1 := e.extractRawValue(value1) raw2 := e.extractRawValue(value2) if raw1 == nil { return -1 } if raw2 == nil { return 1 } // Simple comparison - in a full implementation this would handle type coercion switch v1 := raw1.(type) { case int32: if v2, ok := raw2.(int32); ok { if v1 < v2 { return -1 } else if v1 > v2 { return 1 } return 0 } case int64: if v2, ok := raw2.(int64); ok { if v1 < v2 { return -1 } else if v1 > v2 { return 1 } return 0 } case float32: if v2, ok := raw2.(float32); ok { if v1 < v2 { return -1 } else if v1 > v2 { return 1 } return 0 } case float64: if v2, ok := raw2.(float64); ok { if v1 < v2 { return -1 } else if v1 > v2 { return 1 } return 0 } case string: if v2, ok := raw2.(string); ok { if v1 < v2 { return -1 } else if v1 > v2 { return 1 } return 0 } case bool: if v2, ok := raw2.(bool); ok { if v1 == v2 { return 0 } else if v1 && !v2 { return 1 } return -1 } } return 0 } // tryFastParquetAggregation attempts to compute aggregations using hybrid approach: // - Use parquet metadata for parquet files // - Count live log files for live data // - Combine both for accurate results per partition // Returns (result, canOptimize) where canOptimize=true means the hybrid fast path was used func (e *SQLEngine) tryFastParquetAggregation(ctx context.Context, hybridScanner *HybridMessageScanner, aggregations []AggregationSpec) (*QueryResult, bool) { // Check if all aggregations are optimizable with parquet statistics for _, spec := range aggregations { if !e.canUseParquetStatsForAggregation(spec) { return nil, false } } // Get all partitions for this topic partitions, err := e.discoverTopicPartitions(hybridScanner.topic.Namespace, hybridScanner.topic.Name) if err != nil { return nil, false } // Collect statistics from all partitions (both parquet and live logs) allFileStats := make(map[string][]*ParquetFileStats) // partitionPath -> parquet file stats totalParquetRowCount := int64(0) totalLiveLogRowCount := int64(0) partitionsWithLiveLogs := 0 for _, partition := range partitions { partitionPath := fmt.Sprintf("/topics/%s/%s/%s", hybridScanner.topic.Namespace, hybridScanner.topic.Name, partition) // Get parquet file statistics (always try this) fileStats, err := hybridScanner.ReadParquetStatistics(partitionPath) if err != nil { // If we can't read stats from any partition, fall back to full scan return nil, false } if len(fileStats) > 0 { allFileStats[partitionPath] = fileStats for _, fileStat := range fileStats { totalParquetRowCount += fileStat.RowCount } } // Get parquet source files for deduplication parquetSourceFiles := e.extractParquetSourceFiles(fileStats) // Check if there are live log files and count their rows (excluding parquet-converted files) liveLogRowCount, err := e.countLiveLogRowsExcludingParquetSources(partitionPath, parquetSourceFiles) if err != nil { // If we can't count live logs, fall back to full scan return nil, false } if liveLogRowCount > 0 { totalLiveLogRowCount += liveLogRowCount partitionsWithLiveLogs++ } } totalRowCount := totalParquetRowCount + totalLiveLogRowCount // Debug: Show the hybrid optimization results if totalParquetRowCount > 0 || totalLiveLogRowCount > 0 { fmt.Printf("Hybrid fast aggregation with deduplication: %d parquet rows + %d deduplicated live log rows from %d partitions\n", totalParquetRowCount, totalLiveLogRowCount, partitionsWithLiveLogs) } // If no data found, can't optimize if totalRowCount == 0 { return nil, false } // Compute aggregations using parquet statistics aggResults := make([]AggregationResult, len(aggregations)) for i, spec := range aggregations { switch spec.Function { case "COUNT": if spec.Column == "*" { // COUNT(*) = sum of all file row counts aggResults[i].Count = totalRowCount } else { // COUNT(column) - for now, assume all rows have non-null values // TODO: Use null counts from parquet stats for more accuracy aggResults[i].Count = totalRowCount } case "MIN": // Find global minimum across all files and partitions var globalMin interface{} var globalMinValue *schema_pb.Value for _, fileStats := range allFileStats { for _, fileStat := range fileStats { if colStats, exists := fileStat.ColumnStats[spec.Column]; exists { if globalMinValue == nil || e.compareValues(colStats.MinValue, globalMinValue) < 0 { globalMinValue = colStats.MinValue globalMin = e.extractRawValue(colStats.MinValue) } } } } // Handle system columns that aren't in parquet column stats if globalMin == nil { globalMin = e.getSystemColumnGlobalMin(spec.Column, allFileStats) } aggResults[i].Min = globalMin case "MAX": // Find global maximum across all files and partitions var globalMax interface{} var globalMaxValue *schema_pb.Value for _, fileStats := range allFileStats { for _, fileStat := range fileStats { if colStats, exists := fileStat.ColumnStats[spec.Column]; exists { if globalMaxValue == nil || e.compareValues(colStats.MaxValue, globalMaxValue) > 0 { globalMaxValue = colStats.MaxValue globalMax = e.extractRawValue(colStats.MaxValue) } } } } // Handle system columns that aren't in parquet column stats if globalMax == nil { globalMax = e.getSystemColumnGlobalMax(spec.Column, allFileStats) } aggResults[i].Max = globalMax default: // SUM, AVG not easily optimizable with current parquet stats return nil, false } } // Build result using fast parquet statistics columns := make([]string, len(aggregations)) row := make([]sqltypes.Value, len(aggregations)) for i, spec := range aggregations { columns[i] = spec.Alias row[i] = e.formatAggregationResult(spec, aggResults[i]) } result := &QueryResult{ Columns: columns, Rows: [][]sqltypes.Value{row}, } return result, true } // canUseParquetStatsForAggregation determines if an aggregation can be optimized with parquet stats func (e *SQLEngine) canUseParquetStatsForAggregation(spec AggregationSpec) bool { switch spec.Function { case "COUNT": return spec.Column == "*" || e.isSystemColumn(spec.Column) || e.isRegularColumn(spec.Column) case "MIN", "MAX": return e.isSystemColumn(spec.Column) || e.isRegularColumn(spec.Column) case "SUM", "AVG": // These require scanning actual values, not just min/max return false default: return false } } // isSystemColumn checks if a column is a system column (_timestamp_ns, _key, _source) func (e *SQLEngine) isSystemColumn(columnName string) bool { lowerName := strings.ToLower(columnName) return lowerName == "_timestamp_ns" || lowerName == "timestamp_ns" || lowerName == "_key" || lowerName == "key" || lowerName == "_source" || lowerName == "source" } // isRegularColumn checks if a column might be a regular data column (placeholder) func (e *SQLEngine) isRegularColumn(columnName string) bool { // For now, assume any non-system column is a regular column return !e.isSystemColumn(columnName) } // getSystemColumnGlobalMin computes global min for system columns using file metadata func (e *SQLEngine) getSystemColumnGlobalMin(columnName string, allFileStats map[string][]*ParquetFileStats) interface{} { lowerName := strings.ToLower(columnName) switch lowerName { case "_timestamp_ns", "timestamp_ns": // For timestamps, find the earliest timestamp across all files // This should match what's in the Extended["min"] metadata var minTimestamp *int64 for _, fileStats := range allFileStats { for _, fileStat := range fileStats { // Extract timestamp from filename (format: YYYY-MM-DD-HH-MM-SS.parquet) timestamp := e.extractTimestampFromFilename(fileStat.FileName) if timestamp != 0 { if minTimestamp == nil || timestamp < *minTimestamp { minTimestamp = ×tamp } } } } if minTimestamp != nil { return *minTimestamp } case "_key", "key": // For keys, we'd need to read the actual parquet column stats // Fall back to scanning if not available in our current stats return nil case "_source", "source": // Source is always "parquet_archive" for parquet files return "parquet_archive" } return nil } // getSystemColumnGlobalMax computes global max for system columns using file metadata func (e *SQLEngine) getSystemColumnGlobalMax(columnName string, allFileStats map[string][]*ParquetFileStats) interface{} { lowerName := strings.ToLower(columnName) switch lowerName { case "_timestamp_ns", "timestamp_ns": // For timestamps, find the latest timestamp across all files var maxTimestamp *int64 for _, fileStats := range allFileStats { for _, fileStat := range fileStats { // Extract timestamp from filename (format: YYYY-MM-DD-HH-MM-SS.parquet) timestamp := e.extractTimestampFromFilename(fileStat.FileName) if timestamp != 0 { if maxTimestamp == nil || timestamp > *maxTimestamp { maxTimestamp = ×tamp } } } } if maxTimestamp != nil { return *maxTimestamp } case "_key", "key": // For keys, we'd need to read the actual parquet column stats return nil case "_source", "source": // Source is always "parquet_archive" for parquet files return "parquet_archive" } return nil } // extractTimestampFromFilename extracts timestamp from parquet filename // Format: YYYY-MM-DD-HH-MM-SS.parquet func (e *SQLEngine) extractTimestampFromFilename(filename string) int64 { // Remove .parquet extension if strings.HasSuffix(filename, ".parquet") { filename = filename[:len(filename)-8] } // Parse timestamp format: 2006-01-02-15-04-05 t, err := time.Parse("2006-01-02-15-04-05", filename) if err != nil { return 0 } return t.UnixNano() } // hasLiveLogFiles checks if there are any live log files (non-parquet files) in a partition func (e *SQLEngine) hasLiveLogFiles(partitionPath string) (bool, error) { // Get FilerClient from BrokerClient filerClient, err := e.catalog.brokerClient.GetFilerClient() if err != nil { return false, err } hasLiveLogs := false // Read all files in the partition directory err = filer_pb.ReadDirAllEntries(context.Background(), filerClient, util.FullPath(partitionPath), "", func(entry *filer_pb.Entry, isLast bool) error { // Skip directories and parquet files if entry.IsDirectory || strings.HasSuffix(entry.Name, ".parquet") { return nil } // Found a non-parquet file (live log) hasLiveLogs = true return nil // Can continue or return early, doesn't matter for existence check }) return hasLiveLogs, err } // countLiveLogRows counts the total number of rows in live log files (non-parquet files) in a partition func (e *SQLEngine) countLiveLogRows(partitionPath string) (int64, error) { filerClient, err := e.catalog.brokerClient.GetFilerClient() if err != nil { return 0, err } totalRows := int64(0) err = filer_pb.ReadDirAllEntries(context.Background(), filerClient, util.FullPath(partitionPath), "", func(entry *filer_pb.Entry, isLast bool) error { if entry.IsDirectory || strings.HasSuffix(entry.Name, ".parquet") { return nil // Skip directories and parquet files } // Count rows in live log file rowCount, err := e.countRowsInLogFile(filerClient, partitionPath, entry) if err != nil { fmt.Printf("Warning: failed to count rows in %s/%s: %v\n", partitionPath, entry.Name, err) return nil // Continue with other files } totalRows += rowCount return nil }) return totalRows, err } // extractParquetSourceFiles extracts source log file names from parquet file metadata for deduplication func (e *SQLEngine) extractParquetSourceFiles(fileStats []*ParquetFileStats) map[string]bool { sourceFiles := make(map[string]bool) for _, fileStat := range fileStats { // Each ParquetFileStats should have a reference to the original file entry // but we need to get it through the hybrid scanner to access Extended metadata // This is a simplified approach - in practice we'd need to access the filer entry // For now, we'll use filename-based deduplication as a fallback // Extract timestamp from parquet filename (YYYY-MM-DD-HH-MM-SS.parquet) if strings.HasSuffix(fileStat.FileName, ".parquet") { timeStr := strings.TrimSuffix(fileStat.FileName, ".parquet") // Mark this timestamp range as covered by parquet sourceFiles[timeStr] = true } } return sourceFiles } // countLiveLogRowsExcludingParquetSources counts live log rows but excludes files that were converted to parquet func (e *SQLEngine) countLiveLogRowsExcludingParquetSources(partitionPath string, parquetSourceFiles map[string]bool) (int64, error) { filerClient, err := e.catalog.brokerClient.GetFilerClient() if err != nil { return 0, err } // First, get the actual source files from parquet metadata actualSourceFiles, err := e.getParquetSourceFilesFromMetadata(partitionPath) if err != nil { // If we can't read parquet metadata, use filename-based fallback fmt.Printf("Warning: failed to read parquet metadata, using filename-based deduplication: %v\n", err) actualSourceFiles = parquetSourceFiles } // Debug: Show deduplication status if len(actualSourceFiles) > 0 { fmt.Printf("Excluding %d converted log files from %s\n", len(actualSourceFiles), partitionPath) } totalRows := int64(0) err = filer_pb.ReadDirAllEntries(context.Background(), filerClient, util.FullPath(partitionPath), "", func(entry *filer_pb.Entry, isLast bool) error { if entry.IsDirectory || strings.HasSuffix(entry.Name, ".parquet") { return nil // Skip directories and parquet files } // Skip files that have been converted to parquet if actualSourceFiles[entry.Name] { fmt.Printf("Skipping %s (already converted to parquet)\n", entry.Name) return nil } // Count rows in live log file rowCount, err := e.countRowsInLogFile(filerClient, partitionPath, entry) if err != nil { fmt.Printf("Warning: failed to count rows in %s/%s: %v\n", partitionPath, entry.Name, err) return nil // Continue with other files } totalRows += rowCount return nil }) return totalRows, err } // getParquetSourceFilesFromMetadata reads parquet file metadata to get actual source log files func (e *SQLEngine) getParquetSourceFilesFromMetadata(partitionPath string) (map[string]bool, error) { filerClient, err := e.catalog.brokerClient.GetFilerClient() if err != nil { return nil, err } sourceFiles := make(map[string]bool) err = filer_pb.ReadDirAllEntries(context.Background(), filerClient, util.FullPath(partitionPath), "", func(entry *filer_pb.Entry, isLast bool) error { if entry.IsDirectory || !strings.HasSuffix(entry.Name, ".parquet") { return nil } // Read source files from Extended metadata if entry.Extended != nil && entry.Extended["sources"] != nil { var sources []string if err := json.Unmarshal(entry.Extended["sources"], &sources); err == nil { for _, source := range sources { sourceFiles[source] = true } } } return nil }) return sourceFiles, err } // countRowsInLogFile counts rows in a single log file using SeaweedFS patterns func (e *SQLEngine) countRowsInLogFile(filerClient filer_pb.FilerClient, partitionPath string, entry *filer_pb.Entry) (int64, error) { lookupFileIdFn := filer.LookupFn(filerClient) rowCount := int64(0) // eachChunkFn processes each chunk's data (pattern from read_log_from_disk.go) eachChunkFn := func(buf []byte) error { for pos := 0; pos+4 < len(buf); { size := util.BytesToUint32(buf[pos : pos+4]) if pos+4+int(size) > len(buf) { break } entryData := buf[pos+4 : pos+4+int(size)] logEntry := &filer_pb.LogEntry{} if err := proto.Unmarshal(entryData, logEntry); err != nil { pos += 4 + int(size) continue // Skip corrupted entries } rowCount++ pos += 4 + int(size) } return nil } // Read file chunks and process them (pattern from read_log_from_disk.go) fileSize := filer.FileSize(entry) visibleIntervals, _ := filer.NonOverlappingVisibleIntervals(context.Background(), lookupFileIdFn, entry.Chunks, 0, int64(fileSize)) chunkViews := filer.ViewFromVisibleIntervals(visibleIntervals, 0, int64(fileSize)) for x := chunkViews.Front(); x != nil; x = x.Next { chunk := x.Value urlStrings, err := lookupFileIdFn(context.Background(), chunk.FileId) if err != nil { fmt.Printf("Warning: failed to lookup chunk %s: %v\n", chunk.FileId, err) continue } if len(urlStrings) == 0 { continue } // Read chunk data // urlStrings[0] is already a complete URL (http://server:port/fileId) data, _, err := util_http.Get(urlStrings[0]) if err != nil { fmt.Printf("Warning: failed to read chunk %s from %s: %v\n", chunk.FileId, urlStrings[0], err) continue } // Process this chunk if err := eachChunkFn(data); err != nil { return rowCount, err } } return rowCount, nil } // discoverTopicPartitions discovers all partitions for a given topic func (e *SQLEngine) discoverTopicPartitions(namespace, topicName string) ([]string, error) { // Use the same discovery logic as in hybrid_message_scanner.go topicPath := fmt.Sprintf("/topics/%s/%s", namespace, topicName) // Get FilerClient from BrokerClient filerClient, err := e.catalog.brokerClient.GetFilerClient() if err != nil { return nil, err } var partitions []string err = filer_pb.ReadDirAllEntries(context.Background(), filerClient, util.FullPath(topicPath), "", func(entry *filer_pb.Entry, isLast bool) error { if !entry.IsDirectory { return nil } // Check if this looks like a partition directory (format: vYYYY-MM-DD-HH-MM-SS) if strings.HasPrefix(entry.Name, "v") && len(entry.Name) == 20 { // This is a time-based partition directory // Look for numeric subdirectories (partition IDs) partitionBasePath := fmt.Sprintf("%s/%s", topicPath, entry.Name) err := filer_pb.ReadDirAllEntries(context.Background(), filerClient, util.FullPath(partitionBasePath), "", func(subEntry *filer_pb.Entry, isLast bool) error { if subEntry.IsDirectory { // Check if this is a numeric partition directory (format: 0000-XXXX) if len(subEntry.Name) >= 4 { partitionPath := fmt.Sprintf("%s/%s", entry.Name, subEntry.Name) partitions = append(partitions, partitionPath) } } return nil }) if err != nil { return err } } return nil }) return partitions, err } func (e *SQLEngine) formatAggregationResult(spec AggregationSpec, result AggregationResult) sqltypes.Value { switch spec.Function { case "COUNT": return sqltypes.NewInt64(result.Count) case "SUM": return sqltypes.NewFloat64(result.Sum) case "AVG": return sqltypes.NewFloat64(result.Sum) // Sum contains the average for AVG case "MIN": if result.Min != nil { return e.convertRawValueToSQL(result.Min) } return sqltypes.NULL case "MAX": if result.Max != nil { return e.convertRawValueToSQL(result.Max) } return sqltypes.NULL } return sqltypes.NULL } func (e *SQLEngine) convertRawValueToSQL(value interface{}) sqltypes.Value { switch v := value.(type) { case int32: return sqltypes.NewInt32(v) case int64: return sqltypes.NewInt64(v) case float32: return sqltypes.NewFloat32(v) case float64: return sqltypes.NewFloat64(v) case string: return sqltypes.NewVarChar(v) case bool: if v { return sqltypes.NewVarChar("1") } return sqltypes.NewVarChar("0") } return sqltypes.NULL } // findColumnValue performs case-insensitive lookup of column values // Now includes support for system columns stored in HybridScanResult func (e *SQLEngine) findColumnValue(result HybridScanResult, columnName string) *schema_pb.Value { // Check system columns first (stored separately in HybridScanResult) lowerColumnName := strings.ToLower(columnName) switch lowerColumnName { case "_timestamp_ns", "timestamp_ns": return &schema_pb.Value{Kind: &schema_pb.Value_Int64Value{Int64Value: result.Timestamp}} case "_key", "key": return &schema_pb.Value{Kind: &schema_pb.Value_BytesValue{BytesValue: result.Key}} case "_source", "source": return &schema_pb.Value{Kind: &schema_pb.Value_StringValue{StringValue: result.Source}} } // Then check regular columns in Values map // First try exact match if value, exists := result.Values[columnName]; exists { return value } // Then try case-insensitive match for key, value := range result.Values { if strings.ToLower(key) == lowerColumnName { return value } } return nil } // discoverAndRegisterTopic attempts to discover an existing topic and register it in the SQL catalog func (e *SQLEngine) discoverAndRegisterTopic(ctx context.Context, database, tableName string) error { // First, check if topic exists by trying to get its schema from the broker/filer recordType, err := e.catalog.brokerClient.GetTopicSchema(ctx, database, tableName) if err != nil { return fmt.Errorf("topic %s.%s not found or no schema available: %v", database, tableName, err) } // Create a schema object from the discovered record type mqSchema := &schema.Schema{ Namespace: database, Name: tableName, RecordType: recordType, RevisionId: 1, // Default to revision 1 for discovered topics } // Register the topic in the SQL catalog err = e.catalog.RegisterTopic(database, tableName, mqSchema) if err != nil { return fmt.Errorf("failed to register discovered topic %s.%s: %v", database, tableName, err) } fmt.Printf("Auto-discovered and registered topic: %s.%s\n", database, tableName) return nil }