Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Explain view in RDBMS?
View - A view is a relation (virtual rather than base) and could be used in query expressions, which is, queries can be written by using the view as a relation. Instead, a view is a named table in which is represented, not through its own physically separate stored data, but through its definition in terms of other named tables (base tables or views). The base relations on that a view is based are sometimes known as the existing relations. The definition of a view in a create view statement is stored within the system catalog. The syntax to create a view is:
CREATE [OR REPLACE] VIEW [()] AS
WITH {READ ONLY|CHECK OPTION [CONSTRAINT
]};
design a generalization specialization hierarchy for a motor vehicle sales company. the company sells motorcycles, passenger cars, vens and buses.
Aggregate functions Some of these functions are min, count, max, and avg. These functions help in getting consolidated information from a set of tuples. Example:
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
Explain how the object classes are mapped to tables. Each object class maps to one or more than one tables in the database. The objects in the class may be partitioned horizont
What is candidate key? Candidate Key - A candidate key of an entity set is a minimal superkey, which uniquely identifies each row in the relation.
Question: Data Mining is the process of extracting knowledge hidden from large volumes of raw data. (a) Using a suitable example, illustrate how Data Mining can be useful t
Replication : It is definite as a copy of a relation. Every replica is stored at a dissimilar site. The alternative to replication is to store only single copy of a relation which
how does Btree differ from a B+ - tree?
What is deadlock? How can it be avoided? How can it be resolved once it occurs? Deadlock happens when two transactions are each waiting on a resource that the other transaction
Problem : (b) A deductive database system is essentially the outcome of applying mathematics logic to database management, where logic is used for both data representation and
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd