SQL Definitive Guide (4th edition)(Chinese Edition) by ( MEI ) Joe Celko

paperback. New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date: 2013 Language: English Publisher: People's Posts and Telecommunications Press SQL Definitive Guide (4th Edition) is the latest version of the world-renowned database expert Joe Celko classics. it reveals the formulation of the theory of the SQL standard and practical considerations. from a novel perspective analysis of the idea of ??resolving SQL programming. is a must-read for SQL Advanced not to be missed. Getting Started with SQL is not difficult. the difficulty is advanced and improved. As a member of the SQL standards committee. Celko aside commercial database products in this book. a comprehensive. in-depth. thorough analysis of the SQL language itself. Book ANSI SQL-89. taking into account the SQL-92 features fully explain the relational database design. optimization. and operational aspects of a variety of key issues. SQL data types. queries. grouping. set operations. optimization. data telescopic and senior theme coding. transaction and concurrency control model professional SQL programmer must understand and master everything. The language of humor. unique perspective. to read often very sobering sense of Brief Encounter. Book Peiyoudaliang straightforward sample code is also a book widely critical readers praised and respected. SQL Definitive Guide (4th edition) for some SQL programming experience senior SQL programmer or DBA learning reference. Contents: 1.4. the 1.1 Entity Table 1.2 of Chapter 1 of the database and file system relations Table 1.3 line and record mode object with field 1.5 1.6 CREATE SCHEMA statement Chapter 2 transaction concurrency control 2.1 sessions the 2.2 Affairs and ACID2.2.1 of atomic 2.2. 2 Conformance 2.2.3 2.2.4 Persistent isolation 2.3 Concurrency Control 2.3.1 three phenomena 2.4 2.3.2 isolation level pessimistic concurrency control 2.5 snapshot isolation and optimistic concurrency 2.6 logic Concurrency Control 2.7 deadlock and livelock first Chapter 3 database schema objects 3.1 CREATE SCHEMA statement 3.2 create the CREATE the PROCEDURE. CREATE FUNCTION to CREATE TRIGGER statement 3.3 CREATE DOMAIN statement 3.4 the sequence 3.5 create assertion 3.5.1 Mode level constraints use view 3.5.2 is constrained using the primary key and assertions 3.6 character set Create a character set structure 3.6.1 to 3.6.2. to create collation 3.6.3 create translation Chapter 4 positioning data and special values ??of 4.1 explicit physical locator a 4.1.1 ROWID and the physical disk address 4.1.2 identity column 4.2 generates the identifier 4.2.1 GUID4.2.2 UUID4.3 sequence generation function 4.4 4.5.1 Series pre-assigned a value of 4.5 special sequence table 4.5.2 primes 4.5.3 random order value 4.5.4 Chapter 5 of the other sequences underlying table and related elements 5.1 CREATE TABLE statement column constraint 5.1.1 5.1.2 DEFAULT clause 5.1.3 NOT NULL constraints 5.1.4 CHECK () constraint 5.1.5 UNIQUE and PRIMARY KEY constraints 5.1.6 REFERENCES clause 5.2 nested UNIQUE constraint 5.2.1 overlap key 5.2.2 single-column and multi-column unique 5.3 CREATE ASSERTION constraint 5.4 temporary operation Table 5.5 Table 5.5.1 DROP TABLE 5.5.2 ALTER TABLE5.6 avoid attribute segmentation 5.6.1 table-level attribute segmentation 5.6.2 line level attributes split 5.7 DDL in the performance class hierarchy relations 5.8 explicit physical locator 5.9 5.9.1 ROWID physical disk address 5.9.2 identity column since added 5.9.3 Comparison identity column and sequence 5.10 to generate identifiers 5.10.1 industry standard unique identifier unique identifier of the Department of Defense 5.10.2 5.10.3 5.10.4 sequence generation function only value generator the 5.10.5 verify source 5.11 5.15 CREATE TRIGGER statement duplicate rows 5.12 other schema objects 5.13 temporary table 5.14 the CREATE DOMAIN statement 5.16 CREATE PROCEDURE statement 5.17 DECLARE CURSOR statement 5.17.1 How to Use the cursor the 5.17.2 location update and delete statements Chapter 6 procedural. the basic principle of the semi-procedural and declarative programming 6.1 Software Engineering 6.2 6.3 degree of coupling 6.4 cohesion across 6.4 .1 A common error 6.4.2 an improved 6.5 6.5.2 calculate an alternative Find 6.5.3 Fibonacci series 6.6 predicate function 6.7 the process of decomposition and logic decomposition techniques 6.5.1 Data Sheet and generate code rewrite 6.7.1 the procedural decomposition scheme 6.7.2 logic decomposition scheme Chapter 7 process structure 7.1 7.2 Creating Triggers 7.3 cursor 7.3.1 DECLARE CURSOR statement 7.3.2 an ORDER BY clause 7.3.3 the OPEN statement 7.3.4 FETCH creation process statement 7.3.5 CLOSE statement 7.3.6 DEALLOCATE. statement 7.3.7 How to Use the cursor the 7.3.8 location update and delete statements 7.4 sequence of 7.5 generated column the Auxiliary Table 8.1 of Chapter 8 of the 7.6 table function sequence table 8.1.1 lists enumerate 8.1 .2 sequence mapping cycle replace the iterative loop 8.2 8.1.3 8.2.3 Multi-parameter the auxiliary table 8.2.4 range auxiliary table 8.2.5 hierarchy lookup the auxiliary table 8.2.1 simple conversion auxiliary table 8.2.2 multi-conversion value auxiliary table Auxiliary Table 8.2.6 a true look-up table the 8.3 auxiliary function table 8.3.1 negated function auxiliary table 8.3.2 8.4.2 Scale 8.4.1 pre-assigned values ??primes 8.4 the interpolating 8.4 global constant auxiliary function table. 8.4.4 random order of Number 3 Fibonacci value 8.5 process code into the table Notes Chapter 9 standardized 9.1 functional dependency and multivalued dependencies 9.2 First Normal Form (1NF) 9.3 Second Normal Form (2NF) 9.4 first paradigm (3NF) 9.5 Basic keyword paradigm (EKNF) 9.6 Boyce-Codd paradigm (BCNF) 9.7 Fourth Normal Form (4NF) 9.8 Fifth Normal Form (5NF) 9.9 domains - key paradigm (DKNF) 9.10 standardized practical skills 9.11 key type 9.11.1 natural key 9.11.2 artificial key 9.11.3 external exposed physical locator 9.12 10.1 Numeric Types 10.2 Chapter 10 SQL numeric data value type conversion of non-standardized practical skills 10.2.1 numerical rounding and truncation 10.2.2 CAST () function 10.3 four arithmetic functions 10.4 arithmetic operations and NULL10.5 value of NULL conversion 10.5.1 NULLIF () function 10.5.2 COALESCE () function 10.6 Mathematical Functions 10.6.1 Mathematical Operators 10.6.2 index the function 10.6.3 scalar function 10.6.4 convert a numeric value stored the text 10.7 only value generator 10.7.1 there is a gap sequence 10.7.2 pre-assigned values ??10.8 IP address 10.8.1 CHAR (39) 10.8.2 binary storage the separate SMALLINT Chapter 11 SQL time data type 11.1 Description 11.2 SQL data types on calendar standards 11.2.1 10.8.3 Internal processing timestamp 11.2 11.2.2 Date Format standard 11.2.3. 4 processing time 11.2.5 time zone and daylight saving time data types 11.4 11.3 INTERVAL time characteristics of the data model of arithmetic 11.5 11.5.1 11.5.2 relationship between duration of Chapter 12 the character datatypes 12.1 SQL string duration modeling 12.1.2 string sorting problem 12.1.1 string equal string grouping of 12.1.3 12.2 Standard String Functions 12.3 12.4 Cutter Table 12.5 Nested replace Chapter 13 NULL: SQL missing data 13.1 common vendor extensions the NULL values ??in the missing values ??in the empty table and missing Table 13.2 13.3 context and missing value 13.4 Comparison NULL13.5 NULL and logical 13.5.1 sub-NULL values ??in the query the logic value predicate NULL13.5.2 predicates 13.6 arithmetic 13.7 function Chapter 14. 13.8 NULL and host language design advice 13.9 NULL 13.10 with multi NULL values. distance function of multi-column data elements 14.1 14.2 IPv4 addresses are stored in SQL 14.2.1 using a single VARCHAR (15) column represents the IPv4 address 14.2.2 use an INTEGER column represents the IPv4 address use four SMALLINT column represents the IPv4 address in SQL 14.3 14.4 Currency with other units of the storage IPv6 addresses conversion 14.5 Social Security number 14.6 rationals Chapter 15 table operation 15.1 DELETE FROM statement 15.1.1 14.2.3 DELETE FROM clause 15.1.2 WHERE clause 15.1.3 Data Execution delete the auxiliary table 15.1.4 delete 15.1.5 without declarative referential integrity delete the 15.2 INSERT INTO statement in more than one table at the same table 15.2 .1 INSERT INTO clause 15.2.2 insert nature 15.2.3 bulk loading and unloading utility using the second table 15.3 UPDATE statement 15.3.1 UPDATE clause 15.3.2 WHERE clause 15.3.3 SET clause 15.3.4 description of the defect to be updated 15.3.5 CASE expression in UPDATE 15.4 common vendor extensions Chapter 16 15.5 MERGE statement comparing or theta operation 16.1 data type conversion 16.1.1 date display format 16.1.2 other display format 16.2 SQL row Compare 16.3 IS [NOT] DISTINCT FROM operator Chapter 17 value predicates 17.1 IS NULL predicates 17.2 IS [NOT] [TRUE FALSE UNKNOWN] predicates 17.3 IS [NOT] the NORMALIZED predicate Chapter 18 CASE expression 18.1 CASE expression 18.1. 1 COALESCE () and NULLIF () function with GROUP BY CASE expression 18.1.2 18.1.3 CASE CHECK () clause and logical implication the 18.2 subquery expressions and constants 18.3 Rozenshtein characteristic function Chapter 19 LIKE and SIMILAR TO the predicates 19.1 usage patterns skills 19.2 NULL values ??and empty string predicate results is not equal 19.4 19.3 LIKE with links to eliminate the the LIKE predicate 19.5 CASE expression and LIKE search criteria 19.6 SIMILAR TO predicate 19.7 string skills 19.7.1 string 19.7.2 Search with the statement of the character content of a string 19.7.3 create string index Chapter 20 the BETWEEN and OVERLAPS predicates 20.1 BETWEEN predicate 20.1.1 NULL value the results 20.1.2 empty set the results 20.1.3 programming skills Chapter 21 of the 20.2 OVERLAPS predicate [NOT] IN () predicates 21.1 optimization IN () predicates 21.2 IN () the predicate replacement OR21.3 NULL IN () predicates 21.4 IN () predicates and referential constraints 21.5 IN () predicates and scalar 22.6 EXISTS and three-valued logic Chapter 23 quantitative sub queries Chapter 22 EXISTS () the predicates 22.1 EXISTS and NULL22.2 EXISTS and INNER JOIN22.3 NOT EXISTS and OUTER JOIN22.4 EXISTS () and quantifiers 22.5 EXISTS () and referential constraints the 25.1 related sub a simple SELECT statement The query predicates 23.1 scalar subquery comparison 23.2 quantifiers and missing data of 23.3 ALL predicates and extremal function 23.4 UNIQUE predicate 23.5 DISTINCT predicate Chapter 24 24.1 SELECT statement is executed Chapter 25 of the order of 24.2 single-level SELECT statement SELECT statement query 25.2 embed the INNER JOIN25.3 OUTER JOIN25.3.1 OUTER JOIN some historical 25.3.2 NULL and OUTER JOIN search type OUTER JOIN25.3.4 OUTER JOIN JOIN25.3.3 NATURAL self-join 25.3.5 twice or multiple OUTER JOIN25. 3.6 OUTER JOIN and aggregate functions 25.3.7 FULL OUTER JOIN25.4 the UNION the JOIN operator 25.5 scalar SELECT expression 25.6 Old JOIN syntax with new JOIN syntax 25.7 bound JOIN25.7.1 inventory and orders 25.7.2 stable marriage 25.7.3 the ball into the box 25.8 Codd Dr. T links the the 25.8.1 Stobbs program 25.8.2 Pieere program 25.8.3 reference the literature Chapter 26 virtual table: the view. derived table view the CTE and MQT26.1 query 26.2 updatable type 26.3.1 single table view and read-only view of 26.3 view projection and restrictions 26.3.2 computed column 26.3.3 conversion column 26.3.4 grouped view 26.3.5 join 26.3.7 Nested view 26.3.6 view links view 26.4 26.4.1 view column list database engine how to handle view 26.4.2 26.4.5 26.4.4 pointer structure index and view 26.4.3 embedded text expansion 26.5 WITH CHECK OPTION clause 26.6 delete view 26.7 view the use of the temporary table view materialization prompts view 26.7.2 using the temporary table 26.7.1 26.7.3 view flatten Table 26.8 VALUES constructor derived table derived table derived table 26.8.1 FROM clause 26.8.2 26.9 common table expressions 26.10 recursive common table expression 26.10.1 26.10.2 simple tree simple incremental traversal 26.11 materialized query tables Chapter 27 27.1 coverage and query partition data partition 27.1.1 27.1.2 The single-column range range partitioning table 27.1.3 with the function partition 27.1.4 partition in order window function partition 27.2 relations division 27.2.1 division with remainder 27.2.2 exact division 27.2.3 Performance 27.1.5 Description 27.2.4 Todd's division 27.2.5 with JOIN division 27.2. 6 with a collection of operators Boolean expressions divide 27.3 Romley divide 27.4 RDBMS 27.5 FIFO and LIFO subset Chapter 28 grouping operations 28.1 GROUP BY clause 28.2 GROUP BY and HAVING28.3 multi-level aggregation 28.3.1 multistage polymerization grouped view 28.3.2 multi-level aggregation of sub a query expression multilayer polymeric 28.3.3 CASE expression 28.4 28.5 paired grouping 28.6 sorting and Chapter 29 simple GROUP BY aggregate functions grouped on a computed column 29.1 COUNT () function 29.2 SUM () function 29.3 AVG () extremal function of a simple average of 29.4 on the the the function 29.3.1 empty group average of 29.3.2 multiple columns extremal function 29.4.1 29.4.2 generalized extreme value function 29.4.3 conditions extremal function 29.4.4 GREATEST () and LEAST () function to 29.5 the LIST () aggregate function 29.5.1 using recursive CTE the LIST aggregate functions 29.5.2 crosstab LIST () function 29.6 PRD () aggregate function 29.6.1 29.6.2 29.7.1 OR operator by 29.7 Operators logarithmic implement PRD () aggregate function aggregate functions aggregate functions 29.7.2 AND operator aggregation function Chapter 30 Advanced grouping by the expression to achieve the PRD () function. OLAP example 30.3 SET30.2.2 ROLLUP30.2.3 CUBE30.2.4 SQL window of the window of polymerization and SQL OLAP30.1 Star the mode 30.2 GROUPING operator. 30.2.1 Draw of the GROUP BY the GROUPING clause 30.3.1 PARTITION BY clause 30.3.2 the ORDER BY clause 30.3.3 window frame clause 30.4 Windowing Aggregate Functions 30.5 serial number function 30.5.1 line number 30.5.2 RANK () and DENSE_RANK () 30.5.3 PERCENT_RANK () and CUME_DIST () 30.5.4 Some examples of 30.6 vendor extensions of 30.6.1 LEAD and LAG functions 30.6.2 FIRST and LAST function 30.7 is historical knowledge Chapter 31 SQL descriptive statistics. AVG 31.1 plural 31.2 () function the 31.3 median 31.3.1 median programming problem 31.3.2 Celko first 31.3.3 Date median 31.3.4 Murchison one value value value the 31.3.5 Celko value 31.3.6 Vaughan application view in 31.3.7 in the value of the characteristic function 31.3.8 Celko first in the value of the three values ??in 31.3.9 Ken Henderson 31.3.10 OLAP median 31.4 variance and standard deviation of the average deviation 31.5 31.6 Cumulative Statistics 31.6.1 the run differential 31.6.2 cumulative percentage 31.6.3 serial function 31.6.4 quintile 31.7 crosstab and related statistics 31.7.1 through cross-links to create crosstab 31.7.2 to create crosstab 31.7.3 subquery crosstab 31.7.4 CASE expression crosstab 31.8 harmonic mean and geometric average outside links Description the statistical data 31.9.1 covariance 31.9.2 Pearson correlation coefficient r31.9.3 number multivariate 31.9 SQL described multivariate statistics NULL value 31.10 SQL: 2006 statistical functions 31.10.1 variance. standard deviation. and a description STATS 31.10.2 31.10.3 distribution function Chapter 32 of the sub-sequence. region. cis string. the gap and island 32.1 Finding the size n of the sub-area 32.2 the area number 32.3 32.4 find the maximum size of the region boundaries to query of 32.5 cis string and sequence query 32.6 number column summing 32.7 exchange and translational list value 32.8 compression a value 32.9 fold a value 32.10 covering Chapter 33 SQL matrix 33.1 access by naming columns of the array 33.2 under standard column carried out to access the array 33.3 SQL the matrix operation 33.3.1 matrix equation the 33.3.2 of matrix addition 33.3.3 matrix multiplication 33.3.4 matrix transpose 33.5 comparison table format line 33.3.5 Sort and column sorting 33.3.6 matrix operations 33.4 Table flat as arrays sequence 34.1.2 hybrid implementation of the UNION operation 34.2 INTERSECT EXCEPT34.2.1 of NULL values ??and duplicate rows using UNION and UNION ALL operator 34.1.3 on the same table column array Chapter 34 collection operations 34.1 UNION and UNION ALL34.1.1 operation 34.2.2 there is a NULL value when the INTERSECT and EXCEPT and INTERSECT and EXCEPT operation duplicate rows 34.3 Chapter 35 34.4 equal subset and proper subset of a subset of a note on ALL SELECT DISTINCT 35.1 in each of n items 35.2 35.3 CONTAINS operator select random row from table 35.3.1 Mako 35.6 select representative subset of the set operator 35.3.2 Table 35.4 equality operator sequence gap 35.5 overlap interval cover problem Chapter 36 SQL tree 36.1 adjacency list model 36.1.1 hierarchy to traverse complex process constraints 36.1.2 queries 36.1.3 Changing Table 36.2 path enumeration model 36.2.1 to 36.2.3 delete Find subtree and node 36.2.2 identify the level and future generations of nodes and sub- converted to tree the 36.2.4 integrity constraints 36.3 hierarchy nested set model 36.3.1 counting characteristics 36.3.2 contains the characteristics 36.3.3 subordinate node 36.3.4 Hierarchical 36.3.6 36.3.5 delete nodes and subtree will adjacency list nested sets model 36.4 Other manifestations tree hierarchy model Figure 37.1 in Chapter 37 SQL adjacency list model Figure 37.1.1 SQL adjacency list the model 37.1.2 path with CTE37.1.3 of cyclic 37.1.4 adjacency matrix model Figure 37.2 split nested sets model represented node the path endpoint 37.2.3 up to 37.2.2 edge node 37.2.4. 37.2.5 indegree and out-degree of all nodes in 37.2.1 Figure 37.2.6 source nodes. aggregation nodes. isolated nodes and internal nodes 37.2.7 will ring map into nested collection point 37.4 37.3 polygon Graph Theory Bibliography Chapter 38 queries 38.1 time math 38.2 38.3 personalized calendar sequence gap 38.3.1 time series start and end missing 38.3.2 continuous period 38.3.3 adjacent events Find a date 38.3.5 38.3.4 38.6 weeks of the the point 38.3.6 start time and end time 38.4 Julian Day 38.5 Other time functions 38.7 time modeling in Table 38.8 calendar Auxiliary Table 38.9 2000 38.9.5 consequences of weird date in a leap year. 38.9.2 38.9.3 38.9.1 2000 38.9.4 old data Chapter 39 to optimize SQL39.1 access method 39.1.4 vector index 39.1.1 Sequential Access 39.1.2 index access 39.1.3 hash index 39.2 how to create a simple string expression index 39.2.1 using simple query 39.2.2 39.2.3 simple expression 39.3 prudent to establish multi-column the index 39.5 expedition IN predicate additional information 39.4 39.6 avoid UNION39.7 links is better than nested query 39.8 fewer statements to avoid cross-links the static SQL39 39.11 to understand the optimizer mode recompile changed 39.12 39.9 avoid the sort 39.10. 13 temporary table can sometimes bring convenience to the 39.14 update statistics not superstition newer features References 39.15 Satisfaction guaranteed,or money back.