Database Management Systems Flashcards
6 cards from real B CompE Bachelor of Computer Engineering practice questions. Tap to flip, then mark Knew It or Still Learning — missed cards come back until you master them.
Read the first 6 Database Management Systems flashcards as text
Which indexing structure is most commonly used in relational databases for primary keys?
Answer: B-Tree Index
B-Tree indexes are the default in most relational databases because they support both equality and range queries efficiently.
What is a deadlock in a database system?
Answer: Two transactions wait indefinitely for each other to release locks
A deadlock occurs when two or more transactions each hold a lock the other needs, creating a circular wait that prevents progress.
Which relational algebra operation combines tuples from two relations where a condition is met?
Answer: Join
The Join operation in relational algebra combines rows from two relations based on a matching condition between their attributes.
What is the purpose of a database view?
Answer: Provide a virtual table based on the result of a stored query
A database view is a stored query that appears as a virtual table, simplifying complex queries and restricting data access.
Which SQL aggregate function returns the total number of rows in a result set?
Answer: COUNT()
COUNT() returns the number of rows that match the specified criteria, counting non-NULL values when a column is specified.
What is a stored procedure in a relational database?
Answer: A precompiled set of SQL statements stored in the database
A stored procedure is a precompiled group of SQL statements saved in the database that can be executed by name, improving performance and reusability.
How this page was made: written with AI tools and published by Nathan Beja, founder of Practice Test Geeks, who is responsible for its content. We have not yet matched this exam's facts to an official source, so confirm fees, dates and rules with the exam body. Not reviewed by a subject-matter expert. Editorial policy