Further fixing plus the first actual AST specification.
[dbsrgits/SQL-Abstract-2.0-ish.git] / lib / SQL / Abstract / Manual / Specification.pod
CommitLineData
d6e108eb 1=head1 NAME
2
3SQL::Abstract::Manual::Specification
4
5=head1 SYNOPSIS
6
7This discusses the specification for the AST provided by L<SQL::Abstract>. It is
8meant to describe how the AST is structured, various components provided by
9L<SQL::Abstract> for use with this AST, how to manipulate the AST, and various
10uses for the AST once it is generated.
11
12=head1 MOTIVATIONS
13
14L<SQL::Abstract> has been in use for many years. Originally created to handle
15the where-clause formation found in L<DBIx::Abstract>, it was generalized to
16manage the creation of any SQL statement through the use of Perl structures.
17Through the beating it received as the SQL generation syntax for L<DBIx::Class>,
18various deficiencies were found and a generalized SQL AST was designed. This
19document describes that AST.
20
21=head1 GOALS
22
23The goals for this AST are as follows:
24
25=head2 SQL-specific semantics
26
27Instead of attempting to be an AST to handle any form of query, this will
28instead be specialized to manage SQL queries (and queries that map to SQL
29queries). This means that there will be support for SQL-specific features, such
30as placeholders.
31
32=head2 Perl-specific semantics
33
34This AST is meant to be used from within Perl5 only. So, it will take advantage
35of as many Perl-specific features that make sense to use. No attempt whatosever
36will be made to make this AST work within any other language, including Perl6.
37
38=head2 Whole-lifecycle management
39
40Whether a query is built out of whole cloth in one shot or cobbled together from
41several snippets over the lifetime of a process, this AST will support any way
42to construct the query. Queries can also be built from other queries, so an
43UPDATE statement could be used as the basis for a SELECT statement, DELETE
44statement, or even a DDL statement of some kind.
45
46=head2 Dialect-agnostic usage
47
48Even though SQL itself has several ANSI specifications (SQL-92 and SQL-99 among
49them), this only serves as a basis for what a given RDBMS will expect. However,
50every engine has its own specific extensions and specific ways of handling
393a4eb8 51common features. The AST will provide ways of expressing common functionality in
52a common language. The emitters (objects that follow the Visitor pattern) will
53be responsible for converting that common language into RDBMS-specific SQL.
54
55=head1 COMPONENTS
56
57There are two major components to SQL::Abstract v2.
58
59=over 4
60
61=item * AST
62
63This is the Abstract Syntax Tree. It is a data structure that represents
64everything necessary to construct the SQL statement in whatever dialect the
65user requires.
66
67=item * Visitor
68
69This object conforms to the Visitor pattern and is used to generate the SQL
70represented by the AST. Each dialect will have a different Visitor object. In
71addition, there will be visitors for at least one of the ANSI specifications.
72
73=back
d6e108eb 74
df35a525 75The division of duties between the two components will focus on what the AST
76can and cannot assume. For example, identifiers do not have 20 components in
77any dialect, so the AST can validate that. However, determining what
78constitutes a legal identifier can only be determined by the Visitor object
79enforcing that dialect's rules.
80
d6e108eb 81=head1 AST STRUCTURE
82
393a4eb8 83The AST will be a HoHo..oH (hash of hash of ... of hashes). The keys to the
84outermost hash will be the various clauses of a SQL statement, plus some
85metadata keys. All metadata keys will be identifiable as such by being prefixed
86with an underscore. All keys will be in lowercase.
d6e108eb 87
88=head2 Metadata keys
89
90These are the additional metadata keys that the AST provides for.
91
df35a525 92=head3 _query
93
94This denotes what kind of query this AST should be interpreted as. Different
95Visitors may accept additional values for _query. For example, a MySQL Visitor
96may choose to accept 'replace'. If a _query value is unrecognized by the
97Visitor, the Visitor is expected to throw an error.
98
99All Visitors are expected to handle the following values for _query:
100
d6e108eb 101=over 4
102
df35a525 103=item * select
104
105This is a SELECT statement.
d6e108eb 106
df35a525 107=item * insert
d6e108eb 108
df35a525 109This is an INSERT statement.
393a4eb8 110
df35a525 111=item * update
112
113This is an UPDATE statement.
114
115=item * delete
116
117This is a DELETE statement.
d6e108eb 118
119=back
120
df35a525 121=head3 _version
122
123This denotes the version of the AST. Different versions will indicate different
124capabilities provided. Visitors will choose to respect the _version as needed
125and desired.
126
d6e108eb 127=head2 Structural units
128
df35a525 129All structural units will be hashes. These hashes will have, at minimum, the
130following keys:
131
132=over 4
133
134=item * _name
135
136This indicates the structural unit that this hash is representing. While this
137specification provides for standard structural units, different Visitors may
138choose to accept additional units as desired. If a Visitor encounters a unit it
139doesn't know how to handle, it is expected to throw an exception.
140
141=back
142
d6e108eb 143Structural units in the AST are supported by loaded components. L<SQL::Abstract>
144provides for the following structural units by default:
145
146=head3 Identifier
147
df35a525 148This is a (potentially) fully canonicalized identifier for a elemnt in the
149query. This element could be a schema, table, or column. The Visitor will
150determine validity within the context of that SQL dialect. The AST is only
151responsible for validating that the elements are non-empty Strings.
152
153The hash will be structured as follows:
154
155 {
156 _name => 'identifier',
157 items => [String],
158 }
d6e108eb 159
df35a525 160The items will always be quoted per the SQL dialect's quoting scheme. It is the
161responsibility of the Visitor to do this.
d6e108eb 162
10000e9e 163=head3 Value
d6e108eb 164
10000e9e 165A Value is a Perl scalar. It may either be a:
166
167=over 4
168
169=item * String
170
171A String is a quoted series of characters
172
173=item * Number
174
175A Number is an unquoted number in some numeric format
176
177=item * NULL
178
393a4eb8 179NULL is SQL's NULL and corresponds to Perl's C<undef>.
10000e9e 180
181=item * BindParameter
182
183This corresponds to a value that will be passed in. This value is normally
184quoted in such a fashion so as to protect against SQL injection attacks. (q.v.
185L<DBI/quote()> for an example.)
186
187=back
188
189=head3
d6e108eb 190
191=head3 Function
192
193A Function is anything of the form C< name( arglist ) > where C<name> is a
194string and C<arglist> is a comma-separated list of Expressions.
195
81cd86f1 196Yes, a Subquery is legal as an argument for many functions. Some example
197functions are:
198
199=over 4
200
201=item * C<< IN >>
202
203=item * C<< MAX >>
204
205=item * C<< MIN >>
206
207=item * C<< SUM >>
208
209=back
d6e108eb 210
211=head3 Subquery
212
213A Subquery is another AST whose _query metadata parameter is set to "SELECT".
214
215Most places that a Subquery can be used would require a single value to be
216returned (single column, single row), but that is not something that the AST can
217easily enforce. The single-column restriction can possibly be enforced, but the
218single-row restriction is much more difficult and, in most cases, probably
219impossible.
220
81cd86f1 221Subqueries, when expressed in SQL, must bounded by parentheses.
222
d6e108eb 223=head3 Unary Operator
224
225A UnaryOperator takes a single argument on the RHS and is one of the following:
226
227=over 4
228
229=item * C<< NOT >>
230
231=back
232
233=head3 BinaryOperator
234
235A BinaryOperator takes two arguments (one on the LHS and one on the RHS) and is
236one of the following:
237
238=over 4
239
240=item * C<< = >>
241
242=item * C<< != >>
243
244=item * C<< > >>
245
246=item * C<< < >>
247
248=item * C<< >= >>
249
250=item * C<< <= >>
251
252=item * C<< IS >>
253
254=item * C<< IS NOT >>
255
d6e108eb 256=back
257
258Note that an operator can comprise of what would be multiple tokens in a normal
259parsing effort.
260
261=head3 Expression
262
263An expression can be any one of the following:
264
265=over 4
266
10000e9e 267=item * Value
d6e108eb 268
269=item * Function
270
271=item * Subquery
272
273=item * UnaryOperator Expression
274
275=item * Expression BinaryOperator Expression
276
81cd86f1 277=item * ( Expression )
278
d6e108eb 279=back
280
81cd86f1 281Parentheses indicate precedence and, in some situations, are necessary for
282certain operators.
283
d6e108eb 284=head2 SQL clauses
285
10000e9e 286These are all the legal and acceptable clauses within the AST that would
287correpsond to clauses in a SQL statement. Not all clauses are legal within a
288given RDBMS engine's SQL dialect and some clauses may be required in one and
289optional in another. Detecting and enforcing those engine-specific restrictions
290is the responsibility of the Visitor object.
291
292The clauses are defined with a yacc-like syntax. The various parts are:
293
294=over 4
295
296=item * :=
297
298This means "defined" and is used to create a new term to be used below.
299
300=item * []
301
302This means optional and indicates that the items within it are optional.
303
304=item * []*
305
306This means optional and repeating as many times as desired.
307
308=item * |
309
310This means alternation. It is a binary operator and indicates that either the
311left or right hand sides may be used, but not both.
312
313=item * C<< <> >>
314
315This is a grouping construct. It means that all elements within this construct
316are treated together for the purposes of optional, repeating, alternation, etc.
317
318=back
319
d6e108eb 320The expected clauses are (name and structure):
321
322=head3 select
323
81cd86f1 324This corresponds to the SELECT clause of a SELECT statement.
325
326A select clause is composed as follows:
327
328 SelectComponent := Expression [ [ AS ] String ]
329
330 SelectComponent
331 [ , SelectComponent ]*
d6e108eb 332
333=head3 tables
334
335This is a list of tables that this clause is affecting. It corresponds to the
81cd86f1 336FROM clause in a SELECT statement and the INSERT INTO/UPDATE/DELETE clauses in
337those respective statements. Depending on the _query metadata entry, the
338appropriate clause name will be used.
d6e108eb 339
340The tables clause has several RDBMS-specific variations. The AST will support
341all of them and it is up to the Visitor object constructing the actual SQL to
342validate and/or use what is provided as appropriate.
343
344A table clause is composed as follows:
345
346 TableIdentifier := Identifier [ [ AS ] String ]
81cd86f1 347 JoinType := < LEFT|RIGHT [ OUTER ] > | INNER | CROSS
d6e108eb 348
349 TableIdentifier
350 [
351 < , TableIdentifier >
352 | <
353 [ JoinType ] JOIN TableIdentifier
354 [
355 < USING ( Identifier [ , Identifier ] ) >
356 | < ON [ ( ] Expression [ , Expression ] [ ) ] >
357 ]
358 >
359 ]*
360
361Additionally, where aliases are provided for in the TableIdentifier, those
362aliases must be used as the tablename in subsequent Identifiers that identify a
363column of that table.
364
365=head3 where
366
81cd86f1 367This corresponds to the WHERE clause in a SELECT, UPDATE, or DELETE statement.
368
369A where clause is composed as follows:
370
371 WhereOperator := AND | OR
372 WhereExpression := Expression | Expression WhereOperator Expression
373
374 WhereExpression
375
d6e108eb 376=head3 set
377
81cd86f1 378This corresponds to the SET clause in an INSERT or UPDATE statement.
379
380A set clause is composed as follows:
381
382 SetComponent := Identifier = Expression
383
384 SetComponent [ , SetComponent ]*
385
386=head3 columns
387
388This corresponds to the optional list of columns in an INSERT statement.
389
390A columns clause is composed as follows:
391
392 ( Identifier [ , Identifier ]* )
393
d6e108eb 394=head3 values
395
81cd86f1 396This corresponds to the VALUES clause in an INSERT statement.
397
398A values clause is composed as follows:
399
400 ( Expression [ , Expression ]* )
401
402If there is a columns clause, the number of entries in the values clause must be
403equal to the number of entries in the columns clause.
404
d6e108eb 405=head3 orderby
406
81cd86f1 407This corresponds to the ORDER BY clause in a SELECT statement.
408
409An orderby clause is composed as follows:
410
10000e9e 411 OrderByComponent := XXX-TODO-XXX
81cd86f1 412 OrderByDirection := ASC | DESC
413
414 OrderByComponent [ OrderByDirection ]
415 [ , OrderByComponent [ OrderByDirection ] ]*
416
d6e108eb 417=head3 groupby
418
81cd86f1 419This corresponds to the GROUP BY clause in a SELECT statement.
420
421An groupby clause is composed as follows:
422
10000e9e 423 GroupByComponent := XXX-TODO-XXX
81cd86f1 424
425 GroupByComponent [ , GroupByComponent ]*
426
d6e108eb 427=head3 rows
428
81cd86f1 429This corresponds to the clause that is used in some RDBMS engines to limit the
430number of rows returned by a query. In MySQL, this would be the LIMIT clause.
431
432A rows clause is composed as follows:
433
434 Number [, Number ]
435
d6e108eb 436=head3 for
437
81cd86f1 438This corresponds to the clause that is used in some RDBMS engines to indicate
439what locks are to be taken by this SELECT statement.
440
441A for clause is composed as follows:
442
443 UPDATE | DELETE
444
445=head3 connectby
446
447This corresponds to the clause that is used in some RDBMS engines to provide for
448an adjacency-list query.
449
450A connectby clause is composed as follows:
451
452 Identifier, WhereExpression
453
d6e108eb 454=head1 AUTHORS
455
81cd86f1 456robkinyon: Rob Kinyon C<< <rkinyon@cpan.org> >>
d6e108eb 457
458=head1 LICENSE
459
460You may distribute this code under the same terms as Perl itself.
461
462=cut