HSAM stands for ……….
Hierarchic Standard Access Method
Hierarchic Sequential Access Method
Hierarchic Sequential and Method
Hierarchic Standard and Method
Also checkout these categories
Neurology MCQ Genetics MCQ Phylum - Aschelminthes MCQ Chemical Engineering Basics MCQ Classifications of Animal Kindom MCQ Software Engineering MCQ Phylum - Mammalia MCQ Male reproduction and infertility MCQ Machine Design MCQ Current Affairs May 2017 MCQ Drawing Inference MCQ Atomic Structure MCQ
- In E-R Diagram total participation is represented by
- Which of the following constitutes a basic set of operations for manipulating relational data?
- The cost of reading and writing temporary files while evaluating a query can be reduced by
- Immediate database modification technique uses
- The full form of GUI is _________
- If both the functional dependencies : Xï®Y and Yï®X hold for two attributes X and Y then the relationship…
- The keyword to eliminate duplicate rows from the query result in SQL is
- In SQL the statement select * from R, S is equivalent to
- Which two files are used during operation of the DBMS?
- Between DRAM and magnetic disk storage another form of memory, called ______ memory is becoming common…
- Relational Algebra is
- DBMS helps achieve
- Which of the syntax is correct for insert statement? i) insert into values ii) insert into (column list)…
- Data independence means
- The drawback of shadow paging technique are
- The ______ key of a relation is the attribute (column) or collection of attributes, which uniquely identify…
- For using a specific database …………… command is used.
- Relationships among relationships can be represented in an-E-R model using
- The size of a data item is called its _______, which can be a field of some record or may be a larger…
- ____ table store information about database or about the system.
- If the closure of an attribute set is the entire relation then the attribute set is a
- Which of the following concurrency control schemes is not based on the serializability property?
- Assume transaction A holds a shared lock R. If transaction B also requests for a shared lock on R.
- Maximum height of a B+ tree of order m with n key values is
- Precedence graphs help to find a
- Which of the following is not a consequence of concurrent operations?
- Which of the following is true for network structure?
- The transactions like adding an employee, enrolling a student in a course are examples of _______
- Key to represent relationship between tables is called
- An advantage of views is