Storage, Query Processing and Transactions flashcards
23 flashcard decks by 14 users
This GoConqr page gathers over 20 flashcard decks on storage, query processing and transactions, from ACID properties to indexing and search. University students can use them to practise database concepts, while teachers can find material for lessons. Most resources are at university level. Choose a deck to begin.
Flashcards
-
39 cardsDatabases Topic 7 What is a transaction?
-
35 cardsCONCURRENCY CONTROL What is concurrency control?
-
37 cardsQUERY PROCESSING AND OPTIMISATION Why query processing problem is much more difficult in distributed environments than in centralized ones?
-
55 cardsSCC 201 - Concurrency and Transactions Define a multi-user database?
-
45 cardsSCC 201 - Concurrency Locking What are concurrency control techniques used for?
-
45 cardsUntitled Two Views of the System
-
32 cardsSCC 201 - Secondary Files access What are fields used used to create an index in an auxiliary access structure called and how can they be cr...
-
26 cardsSCC 201 - Access Routines Describe the linear search (brute force) access routine?
-
29 cardsSCC 201 - Query Processing and Optimisation What does the cost based query optimization involve?
-
22 cardsSCC 201 - Search and B-Trees What is a search tree?
-
11 cardsTransaction Management What is a transaction?
-
21 cardsFiles and Indices True or false: heap files are ordered.
-
9 cardsAdditional Material For Final
-
15 cardsTransactions & ACID what is ACID?
-
8 cardsHash Indexes What is a hash index?
-
9 cardsTransactions What does ACID stand for?
-
7 cardsTree Indexing What is multilevel indexing?
-
1 cardsUntitled
-
13 cardsKey Terms
-
5 cards404 Concepts What is the buffer manager?
-
10 cardsChapter 12 Review Questions What are the desirable properties of a file system?
-
3 cardsUntitled Explain Serializability Schedule
-
3 cardsHashing What is hashing?
More Storage, Query Processing and Transactions resources
About storage, query processing and transactions flashcards
GoConqr OriginalStorage, Query Processing and Transactions flashcards
The decks offer questions on transaction properties, concurrency control, query optimisation and access routines. You can also find cards on search trees, file access, hashing and indices.
For a focused starting point, try Transactions. Its questions ask about ACID and rollback, so you can practise recalling both properties and transaction behaviour. If you are working on storage instead, explore the deck on search and B-trees, which asks about balanced trees and B-tree constraints.
Revise with the cards
Work through a deck by attempting each question before checking its answer. Return to the cards you found difficult, then move to a related deck, such as Hashing or Files and Indices, to practise another part of the unit.
When you want a different way to review, switch to a mind map or quiz on the unit page. Pick a topic and try a deck that matches it.
Frequently asked questions
Which flashcard deck should I start with for transactions?
Start with “Transactions” if you want to practise ACID properties and rollback. Its cards ask what ACID stands for and what each property means. You can then try “Transaction Management”, which includes questions on transaction termination and concurrency scenarios.
Are these flashcards free to use?
Yes. Every deck listed on this page is free to open and study without an account. A free account also lets you save quiz scores and make your own flashcards, quizzes, mind maps and notes. The listed resources were made by GoConqr users.
What do the storage and query flashcards cover?
The storage decks include questions on search trees, B-tree constraints, access routines and secondary file access. There are also decks titled “Files and Indices”, “Tree Indexing” and “Hash Indexes”. For query work, a deck on query processing and optimisation asks about costs and optimisation concepts.