Question 1

Does TextQL generate native T-SQL or generic SQL?

Accepted Answer

TextQL generates native T-SQL specifically optimized for SQL Server. Ana uses T-SQL idioms like TOP, CROSS APPLY, STRING_AGG, PIVOT, and common table expressions — not generic ANSI SQL adapted at runtime. This produces better execution plans and more readable queries for your DBA team to review.

Question 2

Can TextQL work with SQL Server databases that have hundreds of tables?

Accepted Answer

Yes. TextQL is designed for complex enterprise schemas. Ana discovers and maps all tables, views, foreign keys, and constraints regardless of database size. For very large schemas, Ana uses metadata about column names, types, and relationships to identify the relevant tables for each question.

Question 3

Does TextQL support Windows Authentication?

Accepted Answer

Yes. TextQL supports SQL Authentication, Windows Authentication (Kerberos), and Azure AD authentication. Windows Authentication lets you leverage your existing Active Directory security infrastructure. Your DBA can grant TextQL access through domain service accounts with read-only permissions.

Question 4

Can TextQL query across multiple SQL Server databases?

Accepted Answer

Yes. TextQL can connect to multiple databases on the same SQL Server instance and generate cross-database queries using three-part naming (database.schema.table). You can also connect databases from different SQL Server instances and join them through TextQL's multi-source query engine.

Question 5

How does TextQL handle SQL Server temporal tables?

Accepted Answer

TextQL supports querying temporal tables (system-versioned tables) in SQL Server 2016 and later. Ana can generate FOR SYSTEM_TIME queries to access historical data when your question involves point-in-time or time-range analysis. Current and history tables are both discovered during schema introspection.

Connect SQL Server to Your AI Agent

Everything you need to know

Common questions

Connect to any of your other data sources

Bring Us Your Hardest Problem