Q: For correct execution of a replicated state machine, the actions must
For correct execution of a replicated state machine, the actions must be deterministic. What could happen if an action is non-deterministic?
See AnswerQ: The stepped merge variant of the LSM tree allows multiple trees per
The stepped merge variant of the LSM tree allows multiple trees per level. What are the tradeoffs in having more trees per level?
See AnswerQ: Suppose you want to use the idea of a quad tree for
Suppose you want to use the idea of a quad tree for data in three dimensions. How would the resultant data structure (called an cotter) divide up space?
See AnswerQ: Explain the distinction between closed and open hashing. Discuss the relative
Explain the distinction between closed and open hashing. Discuss the relative merits of each technique in database applications.
See AnswerQ: What are the causes of bucket overflow in a hash file organization
What are the causes of bucket overflow in a hash file organization? What can be done to reduce the occurrence of bucket overflows?
See AnswerQ: Why is a hash structure not the best choice for a search
Why is a hash structure not the best choice for a search key on which range queries are likely?
See AnswerQ: Our description of static hashing assumes that a large contiguous stretch of
Our description of static hashing assumes that a large contiguous stretch of disk blocks can be allocated to a static hash table. Suppose you can allocate only C contiguous blocks. Suggest how to impl...
See AnswerQ: Database tuning: a. What are the three broad levels
Database tuning: a. What are the three broad levels at which a database system can be tuned to improve performance? b. Give two examples of how tuning can be done for each of the levels.
See AnswerQ: When carrying out performance tuning, should you try to tune your
When carrying out performance tuning, should you try to tune your hardware (by adding disks or memory) first, or should you try to tune your transactions (by adding indices or materialized views) first....
See AnswerQ: Suppose that your application has transactions that each access and update some
Suppose that your application has transactions that each access and update some that all internal nodes of the B+-tree are in memory, but only a very small fraction of the leaf pages can fit in memory...
See Answer
