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
how to submit answers softcopy

Define Timestamp ordering Ans In timestamp-based method, a serial order is made among the concurrent transaction by assigning to every transaction a unique nondecreasing number

Give the reasons for allowing concurrency? The reasons for allowing concurrency is if the transactions run serially, a short transaction might have to wait for a preceding long

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 VA

At its most essential level the DBMS architecture can be divide into two parts: the back end and the front end. The back end is responsible for managing the physical database an

Give an example of Object Representation  For illustration, consider the implementation of a social security number within an employee object that is shown in Figure. The soci

What are the various symbols used to draw an E-R diagram (any 3)?

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

1. Create the tables for the play-scheme database as specified in the TMA. 2. Enter the data as given in the spreadsheet. 3. Create queries to retrieve specified information