PostgreSQL Sequence

-

Sequence:

It is used to automatically generate the number(unique).I generate serial list of unique number for numerical column of database tables.

Sequence Options:

TEMPORARY or TEMP //If specified, the sequence object is created only for this session and is automatically dropped on session exit.

IF NOT EXISTS //Do not throw an error if a relation with the same name already exists.
A notice is issued in this case. Note that there is no guarantee that
the existing relation is anything like the sequence that would have been created - it might not even be a sequence.

NAME //The name of the sequence to be created.

INCREMENT  //The optional clause INCREMENT BY increment specifies which value is added to the current sequence value to create a new value.
A positive value will make an ascending sequence, a negative one a descending sequence. The default value is 1.

MINVALUE
NO MINVALUE //The optional clause MINVALUE minvalue determines the minimum value a sequence can generate.
If this clause is not supplied or NO MINVALUE is specified, then defaults will be used.
The default for an ascending sequence is 1. The default for a descending sequence is the minimum value of the data type.

MAXVALUE
NO MAXVALUE //The optional clause MAXVALUE maxvalue determines the maximum value for the sequence.
If this clause is not supplied or NO MAXVALUE is specified, then default values will be used.
The default for an ascending sequence is the maximum value of the data type.
The default for a descending sequence is -1.

START //The optional clause START WITH start allows the sequence to begin anywhere.
The default starting value is minvalue for ascending sequences and maxvalue for descending ones.

CACHE //The optional clause CACHE cache specifies how many sequence numbers are to be preallocated and stored in memory for faster access.
The minimum value is 1 (only one value can be generated at a time, i.e., no cache), and this is also the default.

CYCLE
NO CYCLE //The CYCLE option allows the sequence to wrap around when the maxvalue or minvalue has been reached by an ascending or descending sequence respectively.
If the limit is reached, the next number generated will be the minvalue or maxvalue, respectively.
If NO CYCLE is specified, any calls to nextval after the sequence has reached its maximum value will return an error.
If neither CYCLE or NO CYCLE are specified, NO CYCLE is the default.

OWNED BY table_name.column_name
OWNED BY NONE //The OWNED BY option causes the sequence to be associated with a specific table column,
such that if that column (or its whole table) is dropped, the sequence will be automatically dropped as well.
The specified table must have the same owner and be in the same schema as the sequence.
OWNED BY NONE, the default, specifies that there is no such association.

Example:

Sample Table:

pearl=# create table muthu(id int,name text);
CREATE TABLE
pearl=# select * from muthu;
 id | name
----+------
(0 rows)

pearl=# create sequence muthu_id start 1 increment 1 minvalue 1 maxvalue 5 cycle;
CREATE SEQUENCE

pearl=# insert into muthu values (nextval('muthu_id'),'siva');
INSERT 0 1
pearl=# insert into muthu values (nextval('muthu_id'),'regan');
INSERT 0 1
pearl=# insert into muthu values (nextval('muthu_id'),'chandru');
INSERT 0 1
pearl=# insert into muthu values (nextval('muthu_id'),'thanigai');
INSERT 0 1
pearl=# insert into muthu values (nextval('muthu_id'),'kathir');
INSERT 0 1
pearl=# insert into muthu values (nextval('muthu_id'),'jana');
INSERT 0 1
pearl=# select * from muthu;
 id |   name 
----+----------
  1 | siva
  2 | regan
  3 | chandru
  4 | thanigai
  5 | kathir
  1 | jana
(6 rows)

Comments

Post a Comment

Popular posts from this blog

PostgreSQL pg_pool-II Installation and Configuration

-
Image
Pgpool-II Pgpool-II is a proxy software that sits between PostgreSQL servers and a PostgreSQL database client.  It provides the following features: 1.Connection Pooling:     Pgpool-II maintains established connections to the PostgreSQL servers, and reuses them whenever a new connection with the same properties (i.e. user name, database, protocol version, and other connection parameters if any) comes in. It reduces the connection overhead, and improves system's overall throughput.   2.Load Balancing:     If a database is replicated (because running in either replication mode or master/slave mode), performing a SELECT query on any server will return the same result. Pgpool-II takes advantage of the replication feature in order to reduce the load on each PostgreSQL server.  It does that by distributing SELECT queries among available servers, improving the system's overall throughput. In an ideal scenario, read performance could improve proportionally to the number of PostgreSQ
Read more

PostgreSQL Migration Using MTK

-
Enterprisedb Migration Toolkit: EDB Migration Toolkit is a powerful command-line tool that offers granular control of the migration process. Migration Toolkit facilitates migration of database objects and data to an EDB Postgres Advanced Server (Advanced Server) or PostgreSQL database from: Oracle MySQL Microsoft SQL Server Sybase which objects migrate to postgres Oracle Objects: Schemas   Tables    List-Partitioned Tables         Range-Partitioned Table         Constraints   Indexes   Triggers         Table Data   Views     Materialized Views         Packages         Procedures   Functions       Sequences       Users/Roles   Profiles   Object Types   Object Type Methods   Database Links     Queues       MySQL Objects: Schemas Tables Constraints Indexes Table Data Microsoft SQL Server Objects: Schemas Tables Constraints Indexes Table Data Sybase Obj
Read more

PostgreSQL Pages and Tuples

-
Image
INTERNAL LAYOUT: a tuple or an item is a synonym for a row a relation is a synonym for a table a filenode is an id which represent a reference to a table or an index. a block and page are equals and they represent a 8kb segment information the file storing the table. a heap refer to heap file . Heap files are lists of unordered records of variable size. Although sharing a similar name, heap files are different from heap data structure. CTID represent the physical location of the row version within its table. CTID is also a special column available for every tables but not visible unless specifically mentioned. It consists of a page number and the index of an item identifier. OID stands for Object Identifier. database cluster , we call a database cluster the storage area on disk. A database cluster is a collection of databases that is managed by a single instance of a running database server. Page:            Inside the data file (heap table and index, as well as the free space ma
Read more