Query processor in database management system, Database Management System

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.


Posted Date: 3/5/2013 5:20:55 AM | Location : United States

Related Discussions:- Query processor in database management system, Assignment Help, Ask Question on Query processor in database management system, Get Answer, Expert's Help, Query processor in database management system Discussions

Write discussion on Query processor in database management system
Your posts are moderated
Related Questions
What is a Name? A user-supplied name is used for identity. This form of identity is used for files in file systems. The user gives every file a name that uniquely identifies it

What is Distributed system ? Distributed System - A distributed system consists of a number of processing parts in which are interconnected through a computer network and in

3NF Normal Form A relation schema R is in 3NF if it is in 2NF and for each FD X A either of the following is true X is a Super-key of R. A is a prime attribute of R

Haw does it work one database application

What is a Phantom Deadlock? In distributed deadlock detection, the delay in propagating local information might cause the deadlock detection algorithms to recognize deadlocks

Define tuple variable? Tuple variables are used for comparing two tuples in the same relation. The tuple variables are explained in the from clause by way of the as clause.

Submission Requirements All answers must be computer generated (including text and diagrams). The hand-in version must include a header page (or with sufficient space)

Authorisation Authorisation is the culmination of the administrative policies of the organisation.  As the name shows, authorisation is a set of rules that can be used to verif

Demonstrate the Design of associations During object design phase we must design a strategy to implement associations. Association may be unidirectional or bi-directional. Wha