
- DBMS Tutorial
- DBMS - Home
- DBMS - Overview
- DBMS - Architecture
- DBMS - Data Models
- DBMS - Data Schemas
- DBMS - Data Independence
- Entity Relationship Model
- DBMS - ER Model Basic Concepts
- DBMS - ER Diagram Representation
- DBMS - Generalization, Aggregation
- Relational Model
- DBMS - Codd's Rules
- DBMS - Relational Data Model
- DBMS - Relational Algebra
- DBMS - ER to Relational Model
- DBMS- SQL Overview
- Relational Database Design
- DBMS - Database Normalization
- DBMS - Database Joins
- Storage and File Structure
- DBMS - Storage System
- DBMS - File Structure
- Indexing and Hashing
- DBMS - Indexing
- DBMS - Hashing
- Transaction And Concurrency
- DBMS - Transaction
- DBMS - Concurrency Control
- DBMS - Deadlock
- Backup and Recovery
- DBMS - Data Backup
- DBMS - Data Recovery
- DBMS Useful Resources
- DBMS - Quick Guide
- DBMS - Useful Resources
- DBMS - Discussion
What is a query language in DBMS?
Query is a question or requesting information. Query language is a language which is used to retrieve information from a database.
Query language is divided into two types as follows −
Procedural language
Non-procedural language
Procedural language
Information is retrieved from the database by specifying the sequence of operations to be performed.
For Example: Relational algebra
Structure Query language (SQL) is based on relational algebra.
Relational algebra consists of a set of operations that take one or two relations as an input and produces a new relation as output.
The different types of relational algebra operations are −
Select operation
Project operation
Rename operation
Union operation
Intersection operation
Difference operation
Cartesian product operation
Join operation
Division operation.
Select, project, rename comes under unary operation (operate on one table). Union, intersection, difference, cartesian, join, division comes under binary operation (operate on two tables).
Non-Procedural language
Information is retrieved from the database without specifying the sequence of operation to be performed. Users only specify what information is to be retrieved.
For Example: Relational Calculus
Query by Example (QBE) is based on Relational calculus
Relational calculus is a non-procedural query language in which information is retrieved from the database without specifying sequence of operation to be performed.
Relational calculus is of two types which are as follows −
Tuple calculus
Domain calculus
- Related Articles
- Explain about insert command in Structured query language in DBMS
- Explain about Create, Insert, Select command in structure query language (DBMS)?
- What is query processing and optimization in DBMS?
- What is query optimization and explain its two forms(DBMS)?
- What are the steps of SQL Query processing in DBMS?
- What is a database(dbms)?
- What is a Data Model in DBMS?
- What is a composite attribute in DBMS?
- What is a materialized view in DBMS?
- What is Decomposition in DBMS?
- What is 4NF in DBMS?
- What is RAID in DBMS?
- What is a multimedia database (DBMS)?
- Structured Query Language (SQL)
- What is dirty read in a transaction(DBMS)?
