Query processor in database management system, Database Management System

Assignment Help:

Query Processor

The query language processor is responsible for taking query language statements or shifting them from the English-like syntax of the query language to a form the DBMS can know. The query language processor commonly consists of two separate elements: the parser or the query optimizer.

The parsers receive query language statements to the command-line utilities or application programs and study the syntax of the statements to make sure they are right. To do this, the parsers splits a statement down into primary units of syntax and study them to make sure each statement consists of the proper component elements. If the statements follow the syntax rules, the tokens are approved to the query optimizer.

The query optimiser displays the query language statement, and tries to selected the best and most efficient way of implementing the query. To do this, the query optimizer will make various query plans in that operations are performed in dissimilar orders, and then try to compute taht plan will implement most efficiently. While making this estimation, the query optimizer might show factors like as: disk time, network time, CPU time, scanning methods or sorting methods.

 


Related Discussions:- Query processor in database management system

Concatenation operator-data manipulation language, Concatenation operator ...

Concatenation operator Example : Printing name and job as one string as column name employees: SELECT ENAME||JOB "EMPLOYEES" FROM EMP;

Define the concept of generalization, Define the concept of generalization ...

Define the concept of generalization A generalization is relationship between specific kind of thing and general thing. It is also known as "is-a-kind-of" relationship. Inher

The logical dbms architecture, Normal 0 false false false ...

Normal 0 false false false EN-IN X-NONE X-NONE

DBMS , need a DBMS system on any data for assignment.

need a DBMS system on any data for assignment.

Computing the closure of a set of functional dependency, What is meant by c...

What is meant by computing the closure of a set of functional dependency? The closure of F denoted by F + is the set of functional dependencies logically implied by F.

List the data structures implemented by the storage manager, List the data ...

List the data structures implemented by the storage manager. The storage manager executes the following data structure a) Data files b) Data dictionary c) indices

How nulls are treated in comparison operator, How nulls are treated in comp...

How nulls are treated in comparison operator? Along with comparison (relational) operators, the null values are ignored as we cannot derive the relation along with the given op

Why were functional methods fashionable in early days, Why were functional ...

Why were functional methods fashionable in early days? These are inspired directly by computer architecture and thus popular among computer scientist in early days. The divisio

Distributed query and transaction processing, a.  Construct a query around ...

a.  Construct a query around any one of the functional divisions you made in 4a such that if executed in the distributed design of 4 would require reconstruction of at least two ho

ER diegrams, How to draw an ER diagram to a finance companz

How to draw an ER diagram to a finance companz

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