Consider a database system based on a client-server architecture, with the server acting as a data server. A. What is the effect of the speed of the interconnection between the client and the server on the choice between tuple and page shipping? B.. If page shipping is used, the cache of data at the client can be organized either as a tuple cache or a page cache. The page cache stores data in units of a page, while the tuple cache stores data in units of tuples. Assume tuples are smaller than pages. Describe one benefit of a tuple cache over a page cache.

Consider a database system based on a client-server architecture, with the server acting as a data server. A. What is the effect of the speed of the interconnection between the client and the server on the choice between tuple and page shipping? B.. If page shipping is used, the cache of data at the client can be organized either as a tuple cache or a page cache. The page cache stores data in units of a page, while the tuple cache stores data in units of tuples. Assume tuples are smaller than pages. Describe one benefit of a tuple cache over a page cache.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Suppose a byte-addressable computer using set-associative cache has 216 bytes of main memory and a cache of 32 blocks, and each cache block contains 8 bytes.Q.) If this cache is 4-way set associative, what is the format of a memory address as seen by the cache?
Suppose a byte-addressable computer using set associative cache has 8M byes of main memory and a cache of 128 blocks, where each cache block contains 64 bytes. a) If this cache is 4-way set associative, what is the format of a memory address as seen by the cache, that is, what are the sizes of the tag, set, and offset fields? b) If this cache is 16-way set associative, what is the format of a memory address as seen by the cache
Assume that a database system is installed on a server with 3 core processors. You want your query to run on multiple processors so that each processor accesses in parallel a subset of the database. Or, you might set up your system in a way that partitions your query so that each part of the same query runs on a different processor. Explain, with an example, how a query might be broken apart so that each parallel processor handles a subset of the query
Distributed database systems, like other distributed systems, have an issue with concurrency management, which is similar to the problem that other distributed systems have. Considering that pieces are not duplicated, is it required to impose concurrency management methods such as 2PL (Two-phase locking) on a system? Explain.
What happens when a translation look-aside buffer (TLB) does not support address-space identifiers (ASIDs)? A. The TLB must be flushed every time a new page table is selected. B. The TLB can contain entries for several processes simultaneously. C. The TLB will have address-space protection for each process. D. The TLB will have unique identifier for each process.
9. “The reason of having cache in a system is because a program tends to have Locality of Reference”. Briefly explain the term Locality of Reference with example(s).
Parallel database systems maintain copies of each data item (or division) on many nodes, which is known as redundancy.If copies of data items allocated to a node are distributed throughout many other nodes rather than maintaining all copies in the same node, explain why this is the preferred method. (or a collection of nodes)The benefits and cons of using RAID storage as opposed to storing an extra copy of each data item is discussed in detail in Section B. b.
We consider a virtual memory design for a computer architecture. Suppose that the byte- addressed computer has 256 bytes pages, 16-bit virtual addresses, and 16-bit page table entries (PTE) (NUM 1 bits of one PTE are used for reference, valid checking, protection mechanism, etc.). The computer uses two-level hierarchical page tables. 1. How many virtual pages can be addressed by the architecture? 2. What is the maximal size of the physical memory that can be supported by the architec- ture? 3. We are now running a program which is using 300 bytes of memory currently. What is the smallest possible number of PTES to store the running program?
Take, for example, the database used by a major airline that manages its data using snapshot isolation. In what circumstances would an airline tolerate a non-serializable execution in exchange for better overall performance?
How can one ensure data consistency when serializing and deserializing in concurrent systems?
CSC 472 Introduction to Database Systems Project Consider the CLOCK page replacement policy. Assume that there are only 3 page slots available in the buffer pool. If a page reference sequence is: 0, 4, 1, 4, 2, 4, 3, 4 (in order from left to right). What happens when the second 4 (i.e., the 4 underlined with blue color) is referenced? Group of answer choices Its reference bit is set to 1. Its reference bit is set to 0. It is evicted. Nothing changes.
Question 1 Consider a logical address space of 32 pages of 1,024 words each, mapped onto a physical memory of 16 frames. 1. 2. How many bits are there in the logical address? are there in the physical address? How many bits