Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
consider the following relational schema doctordnameregno patientpname disease assignedto pnamedname give expression in both tuple calculus and
what are the disadvantages of relational data disadvantagesbull performance - if the number of tables among that relationships to be established are
what are the advantages of relational data model normal 0 false false false en-in x-none x-none microsoftinternetexplorer4
explain the concepts of relational data modelrelational data model - the relational model was first introduced through prof ef codd of the ibm
explain algorithm of er to relational mapping er-to-relational mapping algorithm1 step 1 mapping of regular entity types for each strong entity type
explain er relationship modelan entity-relationship model erm an entity-relationship model erm is an abstract theoretical illustration of structured
change the city of first bank corporation to lsquonew delhiupdate companyset city lsquonew delhiwhere companyname lsquofirst bank
find out the names and company names of all employees sorted in ascending order of company name and descending order of employee names of by which
find out the names of all employees who work for first bank corporation from databaseselect employeenamefrom workswhere companyname lsquofirst bank
create table employee and enter employee data in sqlconsider the following relational schemas employee employeename street city works employeename
short note on mid square method of hashingmid square method of hashing in the method midsquare hashing the key is squared and the address selected
write a short note on oracle instanceoracle instances an instance is the executed oracle software and the memory they use it is the instance which
describe the types of attributestypes of attributes an attributes category determines the type of values that are permitted in the attribute for
explain weak and strong entity setsweak and strong entity sets a physically powerful entity set has a primary key all tuples in the group are
describe logical data independence logical data independence - it is the capacity to modify the conceptual schema without having to change external
describe physical data independence physical data independence - it is capacity to modify the internal schema without having to change conceptual
explain data independence data independence is the capacity to modify the schema at one stage of a database system without having to change the
explain foreign keyforeign key - let there are two relations tables r and s any candidate key of the relation r that is referred within the relation
explain alternate keyalternate key - all the candidate keys except primary key are known as alternate
explain candidate keycandidate key - a candidate key is a minimal superkey that can be used to uniquely identify a tuple in the
what is key key - a single attribute or a combination of two or more attributes of an entity set which is used to recognize one or more instances
consider the following relational schema person ss name address car registrationnumber year model accident date driver carregno owns ss
describe application programming interfaceapplication programming interface - commercial sql implementations take one of the two primary techniques
explain view in rdbmsview - a view is a relation virtual rather than base and could be used in query expressions which is queries can be written by
explain what is rdbms rdbms - rdbms is a database management system dbms which stores data within the form of relations relational databases are