Big data Storage & retrieval
Quiz by Johan De Gelas
Feel free to use or edit a copy
includes Teacher and Student dashboards
Measure skillsfrom any curriculum
Measure skills
from any curriculum
Tag the questions with any skills you have. Your dashboard will track each student's mastery of each skill.
With a free account, teachers can
- edit the questions
- save a copy for later
- start a class game
- automatically assign follow-up activities based on students’ scores
- assign as homework
- share a link with colleagues
- print as a bubble sheet
19 questions
Show answers
- Q1What are the two fundamental operations that a database needs to perform?Store data and delete dataSort data and analyze dataStore data and retrieve dataRetrieve data and back up data30s
- Q2How does the db_get function perform lookups?It scans the entire database fileIt retrieves data from a cacheIt queries a separate databaseIt uses an index30s
- Q3What does an index do in a database?It stores backup dataIt compresses the dataIt acts as a signpost to locate data efficientlyIt sorts the data30s
- Q4What are two main approaches to indexing in databases?B-trees and log-structured storageRow-oriented and column-orientedHeap and stack memoryRelational and non-relational30s
- Q5What does LSM-tree stand for?Large Storage Medium TreeLast Structured Memory TreeList-Structured Merge TreeLog-Structured Merge Tree30s
- Q6What is a significant advantage of column-oriented storage?Faster transaction processingEasier data backupsEfficiently loading and querying specific columnsSimpler data retrieval30s
- Q7What is the purpose of indexing in databases?To perform backups of the databaseTo maintain data integrityTo store data in a compressed formatTo improve the speed of data retrieval operations30s
- Q8What trade-off exists when using indexes in a database?Indexes make reads faster but decrease the overall data sizeIndexes require more disk space but improve compressionIndexes ensure data integrity but slow down readsIndexes speed up reads but slow down writes.30s
- Q9What does an SSTable (Sorted String Table) format require?The keys must be unique within each segmentThe data must be stored in binary formatThe sequence of key-value pairs must be sorted by key.The values can be duplicated30s
- Q10In what way do B-trees handle modifications to the database?They store all data in memoryThey allow in-place updating of pages on disk.They only allow appending new dataThey require all data to be sorted in advance30s
- Q11How do LSM-trees (Log-Structured Merge-Trees) improve write performance?They only write data during off-peak hoursThey sequentially write compact SSTable files rather than overwriting pages.They require fewer disk accesses for readsThey store all data in memory to avoid disk writes30s
- Q12What are the two primary functions a database must perform at its most fundamental level?Store data and retrieve data.Optimize queries and manage transactions.Store data and process data.Retrieve data and analyze data.30s
- Q13What are the two families of storage engines discussed that are used in traditional relational and NoSQL databases?Graph databases and object-oriented databases.Binary trees and hash maps.Indexed storage systems and flat file systems.Log-structured storage engines and page-oriented storage engines.30s
- Q14What is the main advantage of using an index in a database?It increases data redundancy.It speeds up read queries.It minimizes storage space.It simplifies data structure.30s
- Q15What does the term 'compaction' mean in the context of log-structured storage?It refers to compressing data to save space.It is an optimization step for query execution.It involves removing duplicate keys and merging segments.It indicates the process of splitting large files.30s