Merge branch 'master' of git@github.com:ashb/sql-abstract
[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
ad0f8fa6 55=head1 RESTRICTIONS
56
57The following are the restrictions upon the AST:
58
59=head2 DML-only
60
61The AST will only support DML (Data Modelling Language). It will not (currently)
62support DDL (Data Definition Language). Practically, this means that the only
63statements supported will be:
64
65=over 4
66
67=item * SELECT
68
69=item * INSERT INTO
70
71=item * UPDATE
72
73=item * DELETE
74
75=back
76
77Additional DML statements may be supported by specific Visitors (such as a
78MySQL visitor supporting REPLACE INTO). q.v. the relevant sections of this
79specification for details.
80
804bd4ab 81=head2 Dialect-agnostic construction
82
83The AST will not attempt to be immediately readable to a human as SQL. In fact,
84due to the dialect differences, particularly in terms of which use operators and
cca4daf5 85which use functions for a given action, the AST will provide simple units. It is
86the responsibility of the Visitor to provide the appropriate SQL. Furthermore,
87the AST will be very generic and only provide hints for a subset of SQL. If a
88Visitor is sufficiently intelligent, pretty SQL may be emitted, but that is not
89the goal of this AST.
804bd4ab 90
393a4eb8 91=head1 COMPONENTS
92
93There are two major components to SQL::Abstract v2.
94
95=over 4
96
97=item * AST
98
99This is the Abstract Syntax Tree. It is a data structure that represents
100everything necessary to construct the SQL statement in whatever dialect the
101user requires.
102
103=item * Visitor
104
105This object conforms to the Visitor pattern and is used to generate the SQL
106represented by the AST. Each dialect will have a different Visitor object. In
107addition, there will be visitors for at least one of the ANSI specifications.
108
109=back
d6e108eb 110
df35a525 111The division of duties between the two components will focus on what the AST
112can and cannot assume. For example, identifiers do not have 20 components in
113any dialect, so the AST can validate that. However, determining what
114constitutes a legal identifier can only be determined by the Visitor object
115enforcing that dialect's rules.
116
d6e108eb 117=head1 AST STRUCTURE
118
393a4eb8 119The AST will be a HoHo..oH (hash of hash of ... of hashes). The keys to the
120outermost hash will be the various clauses of a SQL statement, plus some
37f2cc3f 121metadata keys.
d6e108eb 122
123=head2 Metadata keys
124
125These are the additional metadata keys that the AST provides for.
126
37f2cc3f 127=head3 type
df35a525 128
129This denotes what kind of query this AST should be interpreted as. Different
37f2cc3f 130Visitors may accept additional values for type. For example, a MySQL Visitor
131may choose to accept 'replace' for REPLACE INTO. If a type value is
7c66a0ab 132unrecognized by the Visitor, the Visitor is expected to throw an error.
df35a525 133
37f2cc3f 134All Visitors are expected to handle the following values for type:
df35a525 135
d6e108eb 136=over 4
137
df35a525 138=item * select
139
140This is a SELECT statement.
d6e108eb 141
df35a525 142=item * insert
d6e108eb 143
df35a525 144This is an INSERT statement.
393a4eb8 145
df35a525 146=item * update
147
148This is an UPDATE statement.
149
150=item * delete
151
152This is a DELETE statement.
d6e108eb 153
154=back
155
37f2cc3f 156=head3 ast_version
df35a525 157
158This denotes the version of the AST. Different versions will indicate different
37f2cc3f 159capabilities provided. Visitors will choose to respect the ast_version as needed
df35a525 160and desired.
161
d6e108eb 162=head2 Structural units
163
df35a525 164All structural units will be hashes. These hashes will have, at minimum, the
165following keys:
166
167=over 4
168
804bd4ab 169=item * type
df35a525 170
171This indicates the structural unit that this hash is representing. While this
172specification provides for standard structural units, different Visitors may
173choose to accept additional units as desired. If a Visitor encounters a unit it
174doesn't know how to handle, it is expected to throw an exception.
175
176=back
177
d6e108eb 178Structural units in the AST are supported by loaded components. L<SQL::Abstract>
179provides for the following structural units by default:
180
181=head3 Identifier
182
df35a525 183This is a (potentially) fully canonicalized identifier for a elemnt in the
184query. This element could be a schema, table, or column. The Visitor will
185determine validity within the context of that SQL dialect. The AST is only
186responsible for validating that the elements are non-empty Strings.
187
188The hash will be structured as follows:
189
190 {
804bd4ab 191 type => 'Identifier',
7c66a0ab 192 element1 => Scalar,
193 element2 => Scalar,
194 element3 => Scalar,
df35a525 195 }
d6e108eb 196
7c66a0ab 197If element3 exists, then element2 must exist. element1 must always exist. If a
198given element exists, then it must be defined and of non-zero length.
199
ad0f8fa6 200Visitors are expected to, by default, quote all identifiers according to the SQL
201dialect's quoting scheme.
d6e108eb 202
4f6e8987 203Any of the elements may be '*', as in SELECT * or SELECT COUNT(*). Visitors must
204be careful to I<not> quote asterisks.
205
10000e9e 206=head3 Value
d6e108eb 207
7c66a0ab 208A Value is a Perl scalar. Depending on the type, a Visitor may be able to make
209certain decisions.
10000e9e 210
211=over 4
212
213=item * String
214
7c66a0ab 215A String is a quoted series of characters. The Visitor is expected to ensure
216that embedded quotes are properly handled per the SQL dialect's quoting scheme.
10000e9e 217
218=item * Number
219
7c66a0ab 220A Number is an unquoted number in some numeric format.
10000e9e 221
ad0f8fa6 222=item * Null
10000e9e 223
ad0f8fa6 224Null is SQL's NULL and corresponds to Perl's C<undef>.
10000e9e 225
226=item * BindParameter
227
228This corresponds to a value that will be passed in. This value is normally
229quoted in such a fashion so as to protect against SQL injection attacks. (q.v.
230L<DBI/quote()> for an example.)
231
7c66a0ab 232BindParameters are normally represented by a '?'.
233
10000e9e 234=back
235
a3872878 236The hash will be structured as follows:
237
238 {
804bd4ab 239 type => 'Value'
7c66a0ab 240 subtype => [ 'String' | 'Number' | 'Null' | 'BindParameter' ]
241 value => Scalar
a3872878 242 }
243
244The provided subtypes are the ones that all Visitors are expected to support.
245Visitors may choose to support additional subtypes. Visitors are expected to
246throw an exception upon encountering an unknown subtype.
d6e108eb 247
804bd4ab 248=head3 Operator
81cd86f1 249
804bd4ab 250An Operator would be, in SQL dialect terms, a unary operator, a binary operator,
251a trinary operator, or a function. Since different dialects may have a given
252functionality as an operator or a function (such as CONCAT in MySQl vs. || in
253Oracle for string concatenation), they will be represented in the AST as generic
254operators.
d6e108eb 255
7c66a0ab 256The hash will be structured as follows:
257
258 {
804bd4ab 259 type => 'Operator',
260 op => String,
261 args => ExpressionList,
7c66a0ab 262 }
263
804bd4ab 264Operators have a cardinality, or expected number of arguments. Some operators,
ad0f8fa6 265such as MAX(), have a cardinality of 1. Others, such as IF(), have a cardinality
266of N, meaning they can have any number of arguments greater than 0. Others, such
804bd4ab 267as NOW(), have a cardinality of 0. Several operators with the same meaning may
ad0f8fa6 268have a different cardinality in different SQL dialects as different engines may
804bd4ab 269allow different behaviors. As cardinality may differ between dialects, enforcing
270cardinality is necessarily left to the Visitor.
ad0f8fa6 271
804bd4ab 272Operators also have restrictions on the types of arguments they will accept. The
273first argument may or may not restricted in the same fashion as the other
274arguments. As with cardinality, this restriction will need to be managed by the
275Visitor.
276
277The operator name needs to take into account the possibility that the RDBMS may
278allow UDFs (User-Defined Functions) that have the same name as an operator, such
279as 'AND'. This will have to be managed by the Visitor.
ad0f8fa6 280
d6e108eb 281=head3 Subquery
282
37f2cc3f 283A Subquery is another AST whose type metadata parameter is set to "SELECT".
d6e108eb 284
285Most places that a Subquery can be used would require a single value to be
286returned (single column, single row), but that is not something that the AST can
ad0f8fa6 287easily enforce. The single-column restriction may possibly be enforced, but the
d6e108eb 288single-row restriction is much more difficult and, in most cases, probably
289impossible.
290
7c66a0ab 291Subqueries, when expressed in SQL, must be bounded by parentheses.
81cd86f1 292
d6e108eb 293=head3 Expression
294
7c66a0ab 295An Expression can be any one of the following:
d6e108eb 296
297=over 4
298
804bd4ab 299=item * Identifier
300
10000e9e 301=item * Value
d6e108eb 302
804bd4ab 303=item * Operator
d6e108eb 304
305=item * Subquery
306
d6e108eb 307=back
308
7c66a0ab 309An Expression is a meta-syntactic unit. An "Expression" unit will never appear
310within the AST. It acts as a junction.
311
312=head3 ExpressionList
313
314An ExpressionList is a list of Expressions, generally separated by commas
315(though other separators may be appropriate at times or for different SQL
cca4daf5 316dialects). An null separator may also be used.
81cd86f1 317
7c66a0ab 318The hash for an ExpressionList is as follows:
ad0f8fa6 319
320 {
804bd4ab 321 type => 'ExpressionList',
7c66a0ab 322 separator => ',',
323 elements => Array of Expressions,
ad0f8fa6 324 }
325
7c66a0ab 326An ExpressionList is always rendered in SQL with parentheses around it.
327
4f6e8987 328=head3 Nesting
329
330A Nesting is, essentially, another set of parentheses.
331
332The hash for a Nesting is as follows:
333
334 {
335 type => 'Nesting',
336 args => Array of Expressions,
337 }
338
d6e108eb 339=head2 SQL clauses
340
10000e9e 341These are all the legal and acceptable clauses within the AST that would
342correpsond to clauses in a SQL statement. Not all clauses are legal within a
343given RDBMS engine's SQL dialect and some clauses may be required in one and
344optional in another. Detecting and enforcing those engine-specific restrictions
345is the responsibility of the Visitor object.
346
347The clauses are defined with a yacc-like syntax. The various parts are:
348
349=over 4
350
351=item * :=
352
353This means "defined" and is used to create a new term to be used below.
354
355=item * []
356
357This means optional and indicates that the items within it are optional.
358
359=item * []*
360
361This means optional and repeating as many times as desired.
362
363=item * |
364
365This means alternation. It is a binary operator and indicates that either the
366left or right hand sides may be used, but not both.
367
368=item * C<< <> >>
369
370This is a grouping construct. It means that all elements within this construct
371are treated together for the purposes of optional, repeating, alternation, etc.
372
373=back
374
d6e108eb 375The expected clauses are (name and structure):
376
377=head3 select
378
81cd86f1 379This corresponds to the SELECT clause of a SELECT statement.
380
7c66a0ab 381A select clause unit is an array of one or more SelectComponent units.
81cd86f1 382
7c66a0ab 383The hash for a SelectComponent unit is composed as follows:
81cd86f1 384
7c66a0ab 385 {
804bd4ab 386 type => 'SelectComponent',
7c66a0ab 387 value => Expression,
cca4daf5 388 as => String,
7c66a0ab 389 }
390
391The 'as' component is optional. Visitors may choose to make it required in
392certain situations.
d6e108eb 393
394=head3 tables
395
396This is a list of tables that this clause is affecting. It corresponds to the
81cd86f1 397FROM clause in a SELECT statement and the INSERT INTO/UPDATE/DELETE clauses in
37f2cc3f 398those respective statements. Depending on the type metadata entry, the
81cd86f1 399appropriate clause name will be used.
d6e108eb 400
401The tables clause has several RDBMS-specific variations. The AST will support
402all of them and it is up to the Visitor object constructing the actual SQL to
403validate and/or use what is provided as appropriate.
404
cca4daf5 405A TableJoin is a junction of the following elements:
7c66a0ab 406
cca4daf5 407=over 4
7c66a0ab 408
cca4daf5 409=item * TableIdentifier
410
411=item * Operator
412
413=back
7c66a0ab 414
415The hash for a TableIdentifier will be composed as follows:
d6e108eb 416
7c66a0ab 417 # TableIdentifier
418 {
804bd4ab 419 type => 'TableIdentifier',
cca4daf5 420 value => Expression,
421 as => String,
7c66a0ab 422 }
423
cca4daf5 424The value should be either an Identifier or a SubQuery.
7c66a0ab 425
cca4daf5 426The hash for an Operator within a tables clause will be composed as follows:
427
428 # Operator
7c66a0ab 429 {
cca4daf5 430 type => 'Operator',
431 op => '< LEFT|RIGHT|FULL [ OUTER ] > | INNER | CROSS',
432 on => Expression,
7c66a0ab 433 }
d6e108eb 434
cca4daf5 435A USING clause is syntactic sugar for an ON clause and, as such, is not provided
436for by the AST. A join of a comma is identical to a CROSS JOIN. The on clause is
437optional.
d6e108eb 438
439=head3 where
440
81cd86f1 441This corresponds to the WHERE clause in a SELECT, UPDATE, or DELETE statement.
442
37f2cc3f 443A where clause is composed of an Expression.
81cd86f1 444
d6e108eb 445=head3 set
446
81cd86f1 447This corresponds to the SET clause in an INSERT or UPDATE statement.
448
449A set clause is composed as follows:
450
451 SetComponent := Identifier = Expression
452
453 SetComponent [ , SetComponent ]*
454
455=head3 columns
456
457This corresponds to the optional list of columns in an INSERT statement.
458
7c66a0ab 459A columns clause is an IdentifierList and the unit is composed as follows:
81cd86f1 460
7c66a0ab 461 columns => [
462 Identifier,
463 [ Identifier, ]*
464 ],
81cd86f1 465
d6e108eb 466=head3 values
467
81cd86f1 468This corresponds to the VALUES clause in an INSERT statement.
469
7c66a0ab 470A values clause is an ExpressionList and the unit is composed as follows.
81cd86f1 471
7c66a0ab 472 values => [
473 Expression,
474 [ Expression, ]*
475 ],
81cd86f1 476
477If there is a columns clause, the number of entries in the values clause must be
478equal to the number of entries in the columns clause.
479
d6e108eb 480=head3 orderby
481
81cd86f1 482This corresponds to the ORDER BY clause in a SELECT statement.
483
484An orderby clause is composed as follows:
485
10000e9e 486 OrderByComponent := XXX-TODO-XXX
81cd86f1 487 OrderByDirection := ASC | DESC
488
489 OrderByComponent [ OrderByDirection ]
490 [ , OrderByComponent [ OrderByDirection ] ]*
491
d6e108eb 492=head3 groupby
493
81cd86f1 494This corresponds to the GROUP BY clause in a SELECT statement.
495
496An groupby clause is composed as follows:
497
10000e9e 498 GroupByComponent := XXX-TODO-XXX
81cd86f1 499
500 GroupByComponent [ , GroupByComponent ]*
501
d6e108eb 502=head3 rows
503
81cd86f1 504This corresponds to the clause that is used in some RDBMS engines to limit the
505number of rows returned by a query. In MySQL, this would be the LIMIT clause.
506
507A rows clause is composed as follows:
508
509 Number [, Number ]
510
d6e108eb 511=head3 for
512
81cd86f1 513This corresponds to the clause that is used in some RDBMS engines to indicate
514what locks are to be taken by this SELECT statement.
515
516A for clause is composed as follows:
517
518 UPDATE | DELETE
519
520=head3 connectby
521
522This corresponds to the clause that is used in some RDBMS engines to provide for
523an adjacency-list query.
524
525A connectby clause is composed as follows:
526
527 Identifier, WhereExpression
528
cca4daf5 529=head1 TODO
530
531=over 4
532
533=item * sproc unit
534
535=back
536
d6e108eb 537=head1 AUTHORS
538
81cd86f1 539robkinyon: Rob Kinyon C<< <rkinyon@cpan.org> >>
d6e108eb 540
541=head1 LICENSE
542
543You may distribute this code under the same terms as Perl itself.
544
545=cut