Added example of simple WHERE clause
[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
10000e9e 203=head3 Value
d6e108eb 204
7c66a0ab 205A Value is a Perl scalar. Depending on the type, a Visitor may be able to make
206certain decisions.
10000e9e 207
208=over 4
209
210=item * String
211
7c66a0ab 212A String is a quoted series of characters. The Visitor is expected to ensure
213that embedded quotes are properly handled per the SQL dialect's quoting scheme.
10000e9e 214
215=item * Number
216
7c66a0ab 217A Number is an unquoted number in some numeric format.
10000e9e 218
ad0f8fa6 219=item * Null
10000e9e 220
ad0f8fa6 221Null is SQL's NULL and corresponds to Perl's C<undef>.
10000e9e 222
223=item * BindParameter
224
225This corresponds to a value that will be passed in. This value is normally
226quoted in such a fashion so as to protect against SQL injection attacks. (q.v.
227L<DBI/quote()> for an example.)
228
7c66a0ab 229BindParameters are normally represented by a '?'.
230
10000e9e 231=back
232
a3872878 233The hash will be structured as follows:
234
235 {
804bd4ab 236 type => 'Value'
7c66a0ab 237 subtype => [ 'String' | 'Number' | 'Null' | 'BindParameter' ]
238 value => Scalar
a3872878 239 }
240
241The provided subtypes are the ones that all Visitors are expected to support.
242Visitors may choose to support additional subtypes. Visitors are expected to
243throw an exception upon encountering an unknown subtype.
d6e108eb 244
804bd4ab 245=head3 Operator
81cd86f1 246
804bd4ab 247An Operator would be, in SQL dialect terms, a unary operator, a binary operator,
248a trinary operator, or a function. Since different dialects may have a given
249functionality as an operator or a function (such as CONCAT in MySQl vs. || in
250Oracle for string concatenation), they will be represented in the AST as generic
251operators.
d6e108eb 252
7c66a0ab 253The hash will be structured as follows:
254
255 {
804bd4ab 256 type => 'Operator',
257 op => String,
258 args => ExpressionList,
7c66a0ab 259 }
260
804bd4ab 261Operators have a cardinality, or expected number of arguments. Some operators,
ad0f8fa6 262such as MAX(), have a cardinality of 1. Others, such as IF(), have a cardinality
263of N, meaning they can have any number of arguments greater than 0. Others, such
804bd4ab 264as NOW(), have a cardinality of 0. Several operators with the same meaning may
ad0f8fa6 265have a different cardinality in different SQL dialects as different engines may
804bd4ab 266allow different behaviors. As cardinality may differ between dialects, enforcing
267cardinality is necessarily left to the Visitor.
ad0f8fa6 268
804bd4ab 269Operators also have restrictions on the types of arguments they will accept. The
270first argument may or may not restricted in the same fashion as the other
271arguments. As with cardinality, this restriction will need to be managed by the
272Visitor.
273
274The operator name needs to take into account the possibility that the RDBMS may
275allow UDFs (User-Defined Functions) that have the same name as an operator, such
276as 'AND'. This will have to be managed by the Visitor.
ad0f8fa6 277
d6e108eb 278=head3 Subquery
279
37f2cc3f 280A Subquery is another AST whose type metadata parameter is set to "SELECT".
d6e108eb 281
282Most places that a Subquery can be used would require a single value to be
283returned (single column, single row), but that is not something that the AST can
ad0f8fa6 284easily enforce. The single-column restriction may possibly be enforced, but the
d6e108eb 285single-row restriction is much more difficult and, in most cases, probably
286impossible.
287
7c66a0ab 288Subqueries, when expressed in SQL, must be bounded by parentheses.
81cd86f1 289
d6e108eb 290=head3 Expression
291
7c66a0ab 292An Expression can be any one of the following:
d6e108eb 293
294=over 4
295
804bd4ab 296=item * Identifier
297
10000e9e 298=item * Value
d6e108eb 299
804bd4ab 300=item * Operator
d6e108eb 301
302=item * Subquery
303
d6e108eb 304=back
305
7c66a0ab 306An Expression is a meta-syntactic unit. An "Expression" unit will never appear
307within the AST. It acts as a junction.
308
309=head3 ExpressionList
310
311An ExpressionList is a list of Expressions, generally separated by commas
312(though other separators may be appropriate at times or for different SQL
cca4daf5 313dialects). An null separator may also be used.
81cd86f1 314
7c66a0ab 315The hash for an ExpressionList is as follows:
ad0f8fa6 316
317 {
804bd4ab 318 type => 'ExpressionList',
7c66a0ab 319 separator => ',',
320 elements => Array of Expressions,
ad0f8fa6 321 }
322
7c66a0ab 323An ExpressionList is always rendered in SQL with parentheses around it.
324
d6e108eb 325=head2 SQL clauses
326
10000e9e 327These are all the legal and acceptable clauses within the AST that would
328correpsond to clauses in a SQL statement. Not all clauses are legal within a
329given RDBMS engine's SQL dialect and some clauses may be required in one and
330optional in another. Detecting and enforcing those engine-specific restrictions
331is the responsibility of the Visitor object.
332
333The clauses are defined with a yacc-like syntax. The various parts are:
334
335=over 4
336
337=item * :=
338
339This means "defined" and is used to create a new term to be used below.
340
341=item * []
342
343This means optional and indicates that the items within it are optional.
344
345=item * []*
346
347This means optional and repeating as many times as desired.
348
349=item * |
350
351This means alternation. It is a binary operator and indicates that either the
352left or right hand sides may be used, but not both.
353
354=item * C<< <> >>
355
356This is a grouping construct. It means that all elements within this construct
357are treated together for the purposes of optional, repeating, alternation, etc.
358
359=back
360
d6e108eb 361The expected clauses are (name and structure):
362
363=head3 select
364
81cd86f1 365This corresponds to the SELECT clause of a SELECT statement.
366
7c66a0ab 367A select clause unit is an array of one or more SelectComponent units.
81cd86f1 368
7c66a0ab 369The hash for a SelectComponent unit is composed as follows:
81cd86f1 370
7c66a0ab 371 {
804bd4ab 372 type => 'SelectComponent',
7c66a0ab 373 value => Expression,
cca4daf5 374 as => String,
7c66a0ab 375 }
376
377The 'as' component is optional. Visitors may choose to make it required in
378certain situations.
d6e108eb 379
380=head3 tables
381
382This is a list of tables that this clause is affecting. It corresponds to the
81cd86f1 383FROM clause in a SELECT statement and the INSERT INTO/UPDATE/DELETE clauses in
37f2cc3f 384those respective statements. Depending on the type metadata entry, the
81cd86f1 385appropriate clause name will be used.
d6e108eb 386
387The tables clause has several RDBMS-specific variations. The AST will support
388all of them and it is up to the Visitor object constructing the actual SQL to
389validate and/or use what is provided as appropriate.
390
cca4daf5 391A TableJoin is a junction of the following elements:
7c66a0ab 392
cca4daf5 393=over 4
7c66a0ab 394
cca4daf5 395=item * TableIdentifier
396
397=item * Operator
398
399=back
7c66a0ab 400
401The hash for a TableIdentifier will be composed as follows:
d6e108eb 402
7c66a0ab 403 # TableIdentifier
404 {
804bd4ab 405 type => 'TableIdentifier',
cca4daf5 406 value => Expression,
407 as => String,
7c66a0ab 408 }
409
cca4daf5 410The value should be either an Identifier or a SubQuery.
7c66a0ab 411
cca4daf5 412The hash for an Operator within a tables clause will be composed as follows:
413
414 # Operator
7c66a0ab 415 {
cca4daf5 416 type => 'Operator',
417 op => '< LEFT|RIGHT|FULL [ OUTER ] > | INNER | CROSS',
418 on => Expression,
7c66a0ab 419 }
d6e108eb 420
cca4daf5 421A USING clause is syntactic sugar for an ON clause and, as such, is not provided
422for by the AST. A join of a comma is identical to a CROSS JOIN. The on clause is
423optional.
d6e108eb 424
425=head3 where
426
81cd86f1 427This corresponds to the WHERE clause in a SELECT, UPDATE, or DELETE statement.
428
37f2cc3f 429A where clause is composed of an Expression.
81cd86f1 430
d6e108eb 431=head3 set
432
81cd86f1 433This corresponds to the SET clause in an INSERT or UPDATE statement.
434
435A set clause is composed as follows:
436
437 SetComponent := Identifier = Expression
438
439 SetComponent [ , SetComponent ]*
440
441=head3 columns
442
443This corresponds to the optional list of columns in an INSERT statement.
444
7c66a0ab 445A columns clause is an IdentifierList and the unit is composed as follows:
81cd86f1 446
7c66a0ab 447 columns => [
448 Identifier,
449 [ Identifier, ]*
450 ],
81cd86f1 451
d6e108eb 452=head3 values
453
81cd86f1 454This corresponds to the VALUES clause in an INSERT statement.
455
7c66a0ab 456A values clause is an ExpressionList and the unit is composed as follows.
81cd86f1 457
7c66a0ab 458 values => [
459 Expression,
460 [ Expression, ]*
461 ],
81cd86f1 462
463If there is a columns clause, the number of entries in the values clause must be
464equal to the number of entries in the columns clause.
465
d6e108eb 466=head3 orderby
467
81cd86f1 468This corresponds to the ORDER BY clause in a SELECT statement.
469
470An orderby clause is composed as follows:
471
10000e9e 472 OrderByComponent := XXX-TODO-XXX
81cd86f1 473 OrderByDirection := ASC | DESC
474
475 OrderByComponent [ OrderByDirection ]
476 [ , OrderByComponent [ OrderByDirection ] ]*
477
d6e108eb 478=head3 groupby
479
81cd86f1 480This corresponds to the GROUP BY clause in a SELECT statement.
481
482An groupby clause is composed as follows:
483
10000e9e 484 GroupByComponent := XXX-TODO-XXX
81cd86f1 485
486 GroupByComponent [ , GroupByComponent ]*
487
d6e108eb 488=head3 rows
489
81cd86f1 490This corresponds to the clause that is used in some RDBMS engines to limit the
491number of rows returned by a query. In MySQL, this would be the LIMIT clause.
492
493A rows clause is composed as follows:
494
495 Number [, Number ]
496
d6e108eb 497=head3 for
498
81cd86f1 499This corresponds to the clause that is used in some RDBMS engines to indicate
500what locks are to be taken by this SELECT statement.
501
502A for clause is composed as follows:
503
504 UPDATE | DELETE
505
506=head3 connectby
507
508This corresponds to the clause that is used in some RDBMS engines to provide for
509an adjacency-list query.
510
511A connectby clause is composed as follows:
512
513 Identifier, WhereExpression
514
cca4daf5 515=head1 TODO
516
517=over 4
518
519=item * sproc unit
520
521=back
522
d6e108eb 523=head1 AUTHORS
524
81cd86f1 525robkinyon: Rob Kinyon C<< <rkinyon@cpan.org> >>
d6e108eb 526
527=head1 LICENSE
528
529You may distribute this code under the same terms as Perl itself.
530
531=cut