0
Describe Procedural query language and non procedural query language in DBMS?
Wiki User
∙ 12y ago
A query language is a language in which a user requests information from the database. These languages are usually on a level higher than that of a standard
programming language. Query languages can be categorized as either procedural or non procedural.
In a procedural language, the user instructs the system to
perform a sequence of operations on the database to compute the desired result.
In a non procedural language, the user describes the desired information without
giving a specific procedure for obtaining that information.
Wiki User
∙ 12y ago
Add your answer:
Earn +20 pts
Is a query language procedural language?
isA query language is a procedural language.
What is Procedural query language?
A procedural language is nothing but what we call relational algebra. Procedural language is just like SQL but with different syntax. In Procedural language for "Select" we use projection and for "where" clause we use selection.
Is a query language a procedural language?
No, a query language is not a procedural language. Query languages are used to retrieve specific information from databases or other data sources by defining and executing queries, while procedural languages are used to write algorithms and executable instructions to solve problems.
What is sql and plsql?
SQL stands for Structured Query Language, and is a computer language designed for writing data manipulation or data management statements against a relational database. PL/SQL stands for Procedural Language/Structured Query Language which is Oracle's proprietary procedural extensions to the SQL language.
What are the benefits of relational data model?
structural independencesimplicityad-hoc query capabilityeasy to designsecurity controlnon procedural access language
What is PLSQL?
The Oracle Corporation's application development language is PL/SQL. It is a superset of SQL that uses standard programming-language to supplement the SQL. PL/SQL stands for Procedural Language/Structured Query Language.
Why relational algebra is a procedural query language?
The syntax of a query in relational algebra essentially describes the query evaluation algorithm i.e. SELECT WHERE FROM --------------- I don't agree with the above answer. Notice that 'SELECT WHERE FROM' is fragmentary SQL. It does not describe an algorithm, or procedure, for obtaining the desired results. Rather, it describes the characteristics of the desired results and where they might be obtained. In fact, relational algebra is not inherently procedural. It involves closed collections of objects called relations and a set of permitted operations on these objects. Please see the link.
What advantages might a procedural language have over a declarative language?
The procedural and declarative paradigms are not mutually exclusive. For instance, database query languages such as SQL are both declarative and procedural. Procedural programming is advantageous whenever the programmer knows precisely what steps should be carried out and in what specific order. We use declarative programming when we know exactly what task we want to perform but are not concerned with how that action is performed. The "how" aspect is decided by the language implementation. Declarative programming is extremely high-level, concentrating on the logic of a computation rather than focusing upon control flow. Procedural programming isn't as high-level as declarative programming and focuses more upon control flow. However, a language implementation is still free to alter the control flow when the order of execution is immaterial to the result of a computation but would result in more efficient code.
What is the difference between QBE and SQL?
Query by Example (QBE) is a database query language for relational databases. A QBE parser parses the search query and looks for the keywords. A more formal query string, in languages such as SQL, is then generated, which is finally executed. However, when compared with a formal query, the results in the QBE system will be more variable.SQL (Structured Query Language) SQL is a set-based, declarative query language, not an imperative language such as C or BASIC. However, there are extensions to Standard SQL which add procedural programming language functionality, such as control-of-flow constructs
What are some examples of procedural and non procedural programming?
Procedural programming is classic programming where the program language is used to tell the computer EXACTLY what do do - step by step. Examples are Assembler, Fortran, Cobol, C, etc etc. Very detailed, very difficult and time consuming to write, but very efficient from the computers point of view. NON-procedural programming is where you tell the computer what you want, and it figures out how to get it. Non/P programming is often used for database manipulations, like SQL, Visual Basic, etc etc. A SQL command like "Select name, address, city, state, zip order by zip" is non procedural. That one line replaces dozens, or hundred of lines, that would be needed to do the same thing in Cobol or C to get data out of a database.
The types of languages a database system?
Database systems can support multiple types of languages, including data definition language (DDL) for defining database schema, data manipulation language (DML) for querying and updating data, and data control language (DCL) for managing access and permissions. Additionally, some database systems support procedural languages like PL/SQL or T-SQL for writing stored procedures and triggers.
How would you classify the relational algebra and relational calculus?
1. Relational algebra operations manipulate some relations and provide some expression in the form of queries where as relational calculus are formed queries on the basis of pairs of expressions. 2. RA have operator like join, union, intersection, division, difference, projection, selection etc. where as RC has tuples and domain oriented expressions. 3. RA is procedural language where as RC is non procedural query system. 4. Expressive power of RA and RC are equivalent. This means any query that could be expressed in RA could be expressed by formula in RC. 5. Any KC formula is translated in Algebric query. 6. There is modification which is easy in queries in RA than the RC. 7 RA formed the mathematical form and have no specificjuer1 language RC also has mathematical form but has one query language QUEL. 8. Relational algebra is easy to manipulate and understand than RC. 9. RA queries are more powerful than the RC. 10. RC are formed WFFs where as RA does not form any formula.
