Scribd Logo
Upload

Welcome to Scribd!

  • 34 views

    Questions

    Uploaded by

    Tanvi Sharma
    The CARTESIAN operation is the most costly set operation among UNION, INTERSECTION, and SET DIFFERENCE. Forward lookup first executes the outer query and then invokes the sub-query. A delta stream is defined as a set of rows used to encode changes made to a specific base table. Physical query strategies are constructed from relational operators like selection, projection, join, etc. The buffer manager allocates buffers in main memory.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd

    Questions

    Uploaded by

    Tanvi Sharma
    34 views3 pages
    The CARTESIAN operation is the most costly set operation among UNION, INTERSECTION, and SET DIFFERENCE. Forward lookup first executes the outer query and then invokes the sub-query. A delta stream is defined as a set of rows used to encode changes made to a specific base table. Physical query strategies are constructed from relational operators like selection, projection, join, etc. The buffer manager allocates buffers in main memory.

    Original Description:

    questions dbms

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The CARTESIAN operation is the most costly set operation among UNION, INTERSECTION, and SET DIFFERENCE. Forward lookup first executes the outer query and then invokes the sub-query. A delta stream is defined as a set of rows used to encode changes made to a specific base table. Physical query strategies are constructed from relational operators like selection, projection, join, etc. The buffer manager allocates buffers in main memory.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    34 views3 pages

    Questions

    Uploaded by

    Tanvi Sharma
    The CARTESIAN operation is the most costly set operation among UNION, INTERSECTION, and SET DIFFERENCE. Forward lookup first executes the outer query and then invokes the sub-query. A delta stream is defined as a set of rows used to encode changes made to a specific base table. Physical query strategies are constructed from relational operators like selection, projection, join, etc. The buffer manager allocates buffers in main memory.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    of 3

    1.

    Among the following Set operations the _________operation


    is most costly.
    A.UNION,
    PRODUCT

    B.INTERSECTION, C.SET DIFFERENCE

    D.CARTESIAN

    2. _________ lookup firstly starts executing the outer query and when outer
    rows are generated then it invokes the sub-query
    A.forward B.reverse C.center D.top
    3. .________ is defined as a set of rows which is used to encode the
    changes to a specific base table.
    A.semantic data B.centralize data C.delta stream D.gama stream
    4. Physical query strategy is made from _________
    A.relation B.operand C.operator Dfunction.
    5. The buffer manager allocates buffers in _______ memory.
    a.virtual
    b.cache memory
    c.main memory D.rom
    6. The basic outline of a Heuristic Algebraic Optimization Algorithm is given below.
    1. Break up any SELECT operations by means of conjunctive operations
    into a cascade of SELECT operations.
    2. Move each and every SELECT operation as far down the query tree as
    is allowed by the attributes which are involved in the select condition.
    A.both are false B.both are true
    C.statement 1 only true D.statement 2 only true
    7. ._______ Locks just prevent other transactions from editing (writing to) the data item
    A.read B.write C.exclusive D.dead
    8. .In ________ lock only one user is permitted to update a specific part of data
    A.shared B.exclusive C.write D.read
    9. Transactions with unexpected read write locks can make use of_______Locks
    A.shared B.upgrading C.write

    D.update

    10. The purpose of concurrency control is to guarantee the transactions serialisability in the
    environment of a______ database.
    A.single-user B.multi-user C.double-user D.triple-user
    11. Write-ahead protocol makes sure that transaction logs are always written _______ any
    database data that are really updated.
    A.after B.before C.first D.last
    12. A clear solution to the issue of maintaining locks in a distributed database is considered
    as
    _________locking

    A.centralized B.symbolic

    C.relative

    D.conditional

    13. ._________ locking defines the process of acquiring and giving up the locks.
    A.one-phase B.two-phase C.three-phase D.multi-phase

    14. The capability of class to inherit the variables and methods from numerous superclasses is
    known as_______inheritance.
    A.multilevel B.multiple C.single D.dual
    15. The _______ clause provides permission to arrange the data retrieved in the variables.
    A.order-by B.having C.group by D.where
    16. ______ assesses to the group of nodes in 'a' that takes place previous to some node in 'b'.
    (A).a BEFORE b (B). a after b.. (C).a INTERSECT b (D). a EXCEPT b.
    17. What does the CREATE TRIGGER statement states?
    a) trigger name b) trigger class c) trigger function d) trigger variable
    18. ._________ database stores data with respect to transaction time.
    A.rollback B.historical C.bitemporal D.temporal
    19. ._______is a relational model database server developed by IBM.
    A.sql B.DB2 C.oracle D.pl/sql
    20. A__________is very significant resource, it requires tough, protected and easily
    obtainable software that can collect and utilize it fast.
    A.information

    B.Data.

    C.storage

    D.release

    21. .______________process results in wasting storage area.


    A.redundancy B. atomicity

    C. flexibility. D.integrity.

    22. Security guidelines are defined by DBMS to use the ________.


    A.information

    B.storage C.data

    D.record

    23. .___________constraints can be defined and applied means of DBMS.


    A.integrity

    B.redundancy.

    C.flexibility

    D.atomicity..

    24. The commands that can be issued against database by clients are known as___________.
    A.queries.

    B.sequence

    C.view

    D.cursor

    25. The machine which is utilized for running DBMS and includes a databse is considered as
    the ___________ of database.

    A.server B.client

    C.desktop

    D.program

    26. moving a part of data from one position to the other position needs you to modify
    _______ accessing application related to that data which is complicated to perform.
    A.one
    B.two
    C.every
    D.no
    27. The relations ______ is based on how many attributes exists in respective relation
    schema
    A.schema B.degree C.feild D.record
    28. The relations ______ is based on how many attributes exists in respective relation
    schema
    A.schema B.degree C.feild D.record
    29. .OLTP stands for ___________.
    A. online transaction processing systemsB.order transaction processing systems
    C.online transaction processing software D.online truncation processing systems
    30. In _______ databse data is administrated by a central DBMS.
    A.one-tier B.client-server

    C.centralizedD.distributed

    You might also like