databend VS tree-sitter-sql

Databend vs. Snowflake: https://github.com/datafuselabs/databend/issues/13059

Indeed, under a pay-as-you-go model, if there's a lack of precise control over the warehouse, such as a 10-minute suspension, it could lead to significant waste. This is because most queries might only take a few seconds, and the rest of the time is wasted. If you find Snowflake expensive, consider Databend. It's an open-source, cost-efficient alternative to Snowflake, and it maintains a consistent product experience with Snowflake.

Open-source: https://github.com/datafuselabs/databend

They're advertising as an open source direct competitor with Snowflake, with the ability to store data in parquet files. Github repo (5.6k stars) here.

Databend has recently introduced an SQL function that generates SQL statements from natural language. This feature can significantly reduce the time required for writing and debugging SQL statements.

Hi, we used to use sqlparser in [Databend](https://github.com/datafuselabs/databend). But at last we decide to write our own sqlparser using nom-rule.

Link to Github: https://github.com/datafuselabs/databend

Which grammar are you using? https://github.com/DerekStride/tree-sitter-sql supports backticks. This is the one that is used by nvim-treesitter.

A complete grammar of the SQL language is rather large, as can be seen by this grammar https://github.com/DerekStride/tree-sitter-sql/blob/main/grammar.js that is 2000 lines of code.

Alternatively, you could use a tree-sitter parser, such as https://github.com/DerekStride/tree-sitter-sql , which would provide fast incremental parses (but may result in a less detailed AST).