Database Administrator

MySQL fuzzy query: LIKE and REGEXP Modes MySQL fuzzy query provides two modes: LIKE mode and REGEXP mode.LIKE Mode The LIKE mode uses the LIKE or not like comparison operator to perform fuzzy queries. SELECT field FROM table WHERE field LIKE [not

Upgrade Goldengate 11.1.1.1.2 to 11.2.1.0.1 Configuration environment: Source:OGG: 11.2.1.0.1Name: bkjia1 Target:OGG: 11.1.1.1.2Name: bkjia2 Upgrade Target to the same version as the source. Backup Target ogg installation directory:[Root @ bkjia2/] #

Oracle mobile table When creating a table, you can specify a storage space for the table. If not specified, Oracle will store the table to the default tablespace. You can move a table from one tablespace to another as needed. Syntax: Alter table

How does MySQL track SQL statements? In project development, it is inevitable that you need to track SQL Execution statements on the database server. By tracking SQL Execution statements, we can determine that When Upper-layer applications are

SQL and SQL tutorialsAn inner join is a join in which the values in the columns being joined are compared using a comparison operator. In the ISO standard, inner joins can be specified in either the FROM or WHERE clause. this is the only type of

SQL and SQL tutorialsInner joins return rows only when there is at least one row from both tables that matches the join condition. inner joins eliminate the rows that do not match with a row from the other table. outer joins, however, return all

[Translated from mos] nodes are not displayed in the "Cluster Node Information" or "Specify Cluster Configuration" window on aix and the add button is gray. nodecluster Nodes are not displayed in the "Cluster Node Information" or "Specify Cluster

Study database notes 7. Database notes Internal Connection Query The two tables are connected to one table using inner join, and then queried. When filtering the two tables, the on (where is the condition for querying a single table) is

Sharp SQL2014: handling deadlocks, sql2014  In two or more tasks, if each task locks the resources that other tasks attempt to lock, this will cause permanent blocking of these tasks and lead to deadlocks. For example: Transaction A obtains the

Group by and having clauses, and grouphaving clausesGroup by clauseIn some cases. You need to divide the rows in a table into multiple groups, and then use the group as a whole to obtain information about the reorganization, such as the number of

Basic SQL internal connection and external connection, basic SQL connection Some problems have been depressing for a long time. For example, why is there a connection between the left and right sides? If the foreign key is empty, the foreign key

Data replication between tables We can use insert between two tables to implement simple replication (the two tables have the same structure). The example is as follows: SQL> create table T (2 tid number (4 ), 3 tname varchar2 (10) default 'abc ', 4

Install and use memcache. 1 memcache depends on libevent brew install libevent 2 download memcache ＃wget http://www.memcached.org/files/memcached-1.4.22.tar.gz Then install configure; make install 3. Start: 'Sudo./memcached-p 11211-m 64-u shenyb-d

Oracle cascade operations, oracle-levelWhen you add a foreing key constraint, you can also specify the cascade operation type, which is mainly used to determine how to process the foreign key fields in the subtable When deleting a record in the (on

An error occurred in Suse: Access denied for user ''@ 'localhost' to &, susedenied I haven't used MySQL for a long time. The last time I installed Banq's forum system, when MySQL Administrator is used, the system prompts mysql error number 1045

Sub-structure and sub-structure of the tree 1. Question Enter Two Binary Trees A and B to determine whether B is A sub-structure. The binary tree structure is as follows: Struct BinaryTreeNode { Int m_nValue; BinaryTreeNode * m_pLeft; BinaryTreeNOde

11. Basic binary tree theory and 11 basic binary tree theoryI. Basic concepts of Binary Trees1. DefinitionA Binary Tree is a finite set of n (n> = 0) nodes. It is an empty set (or an empty Binary Tree ), it can also be composed of a root node and a

Enq: TX, enqtx Enq: three parameters of the TX-row lock contention wait event are as follows: * P1 = name | mode * P2 = usn XidusnAnd v $ transaction.Xidslot* P3 = sequence XidseqIt is not hard to find that P2 and P3 are actually XIDComponents --

Data migration-compact and move -- The current requirement is that the following result sets become compact: COL1 COL2 COL3------------------------------ 123456789101112 COL1 COL2 COL3------------------------------1 7 112 8 123 94 1056 Drop table

Build a highly scalable WEB interactive system (I) to build a highly scalable web Source: http://www.zaojuzi.com/nirenju/1287.html Scalability is a design indicator for the processing capability of software systems. high scalability represents a