Example of sequences, Database Management System

Assignment Help:

Example: Create a sequence named SEQSS that starts at 105, has a step of 1 and can take maximum value as 2000.

 CREATE SEQUENCE SEQSS START WITH 105

INCREMENT BY 1

MAX VALUE 2000;

How the sequence so formed is used? The following sequence of commands try to illustrate the use of the sequence SEQSS.

Suppose a table person exists as: SELECT * FROM PERSON;

Output:             CODE      NAME         ADDRESS

------                      -------    --------         ---------------

                               104       RAMESH    MUMBAI

Now, if we give the command:

INSERT INTO PERSON

VALUES (SEQSS.NEXTVAL, &NAME, &ADDRESS) 

On implementation of statement above do the following input:

Enter value for name: 'Rakhi'

Enter value for address: 'New Delhi'

Now, here is the following command to see the output:

SELECT * FROM PERSON;

CODE        NAME           ADDRESS

--------- --------------- -----------------

104        RAMESH         MUMBAI

105        Rakhi             NEW DELHI

 

The explanations of sequences such as minimum value, maximum value, increment or step are stored in the data dictionary.  For instance, in oracle it is stored in the table user_sequences. You can see the explanation of sequences by giving the SELECT command.


Related Discussions:- Example of sequences

Database manager, Database Manager It is the interface among low-leve...

Database Manager It is the interface among low-level data, queries and application programs. Databases typically need a large amount of storage space. It is kept on disks, as

Define and differentiate among ordered indexing and hashing, Define and dif...

Define and differentiate between ordered indexing and hashing. Ans: Ordered indexing: To gain fast random access to records in a file, we can make of an index structure. Every

Unix System Administration, What Command You Use What Day of the week were ...

What Command You Use What Day of the week were you born

What are the two methods for dealing deadlock problem, What are the two met...

What are the two methods for dealing deadlock problem? The two procedures for dealing deadlock problem is deadlock detection and deadlock recovery.

Explain the query processing, Explain the Query Processing  Data Query ...

Explain the Query Processing  Data Query Processing permits a user to report or analyze structured and unstructured data pulled from multiple data sources.

Define the wait for graph, Define the Wait for graph Ans: The wait-for-...

Define the Wait for graph Ans: The wait-for-graph is a directed graph and consist of nodes and directed arcs; the nodes of the graph are active transactions. An arc of the grap

Define what Immediate database modification technique uses, Define what Imm...

Define what Immediate database modification technique uses?  Ans: Both undo and redo.

Define a relation schema, A Relation Schema represented by R(A1, A2, .....

A Relation Schema represented by R(A1, A2, ..., An) is made up of the relation name the list of attributes and R Ai that it contains. A relation is described as a set of tuples

In e-r diagram how relationship type is represented, In E-R Diagram how rel...

In E-R Diagram how relationship type is represented ? In E-R Diagram relationship type is represented as a Diamond.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd