File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: OPTIMAL GRANULARITY AND DEGREE OF MULTIPROGRAMMING IN A DISTRIBUTED DATABASE SYSTEM.
| Title | OPTIMAL GRANULARITY AND DEGREE OF MULTIPROGRAMMING IN A DISTRIBUTED DATABASE SYSTEM. |
|---|---|
| Authors | |
| Issue Date | 1986 |
| Citation | International Conference on Data Engineering, Los Angeles, CA., 1986. How to Cite? |
| Abstract | The optimal choices of granularity (size of a physical lock) and the degree of multiprogramming (maximum number of transactions allowed to run concurrently) for a single-site database system (SDBS) using a locking mechanism for concurrency control have been investigated by many researchers. However, the case for a distributed database system (DDBS) has not been examined. Using a simulation model, the problem for a DDBS in various application and system environments is studied. The authors consider: the preclaim and the claim-as-needed locking policies; three different granule placements; two different transaction sizes; and two different communication delays. Conclusions concerning the optimal choices of granularity and the degree of multiprogramming in different environments are drawn to provide guidelines in achieving good performance in a DDBS. |
| Persistent Identifier | http://hdl.handle.net/10722/151784 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Pun, KH | en_US |
| dc.contributor.author | Belford, GG | en_US |
| dc.date.accessioned | 2012-06-26T06:29:30Z | - |
| dc.date.available | 2012-06-26T06:29:30Z | - |
| dc.date.issued | 1986 | en_US |
| dc.identifier.citation | International Conference on Data Engineering, Los Angeles, CA., 1986. | - |
| dc.identifier.uri | http://hdl.handle.net/10722/151784 | - |
| dc.description.abstract | The optimal choices of granularity (size of a physical lock) and the degree of multiprogramming (maximum number of transactions allowed to run concurrently) for a single-site database system (SDBS) using a locking mechanism for concurrency control have been investigated by many researchers. However, the case for a distributed database system (DDBS) has not been examined. Using a simulation model, the problem for a DDBS in various application and system environments is studied. The authors consider: the preclaim and the claim-as-needed locking policies; three different granule placements; two different transaction sizes; and two different communication delays. Conclusions concerning the optimal choices of granularity and the degree of multiprogramming in different environments are drawn to provide guidelines in achieving good performance in a DDBS. | en_US |
| dc.language | eng | en_US |
| dc.relation.ispartof | International Conference on Data Engineering | - |
| dc.title | OPTIMAL GRANULARITY AND DEGREE OF MULTIPROGRAMMING IN A DISTRIBUTED DATABASE SYSTEM. | en_US |
| dc.type | Conference_Paper | en_US |
| dc.identifier.email | Pun, KH:pun@cs.hku.hk | en_US |
| dc.identifier.authority | Pun, KH=rp00164 | en_US |
| dc.description.nature | link_to_subscribed_fulltext | en_US |
| dc.identifier.scopus | eid_2-s2.0-0022593654 | en_US |
| dc.identifier.scopusauthorid | Pun, KH=8979404900 | en_US |
| dc.identifier.scopusauthorid | Belford, GG=7004236690 | en_US |