1989
DOI: 10.1007/3-540-51085-0_46
|View full text |Cite
|
Sign up to set email alerts
|

The case for orderly sharing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1991
1991
1994
1994

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…The performance of a DDBS with locking and the send-on-demand protocol respectively was studied for K = 1, and all other conditions remaining the same as before. The results are provided in Figure 16, where it is 25 All Sites: Update claim queues as and when transactions are con rmed. If responsible for broadcasting a fragment of the database, append timestamp information to the data items as the updated data items arrive.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…The performance of a DDBS with locking and the send-on-demand protocol respectively was studied for K = 1, and all other conditions remaining the same as before. The results are provided in Figure 16, where it is 25 All Sites: Update claim queues as and when transactions are con rmed. If responsible for broadcasting a fragment of the database, append timestamp information to the data items as the updated data items arrive.…”
Section: Simulation Resultsmentioning
confidence: 99%