Entry Rennhackkamp:1988:SNU from compj1980.bib
Last update: Sat Jan 6 02:03:49 MST 2018
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Rennhackkamp:1988:SNU,
author = "M. H. Rennhackkamp and S. H. von Solms",
title = "Short notes: on using an Abstract Model of Distributed
Database Concurrency Control Methods",
journal = j-COMP-J,
volume = "31",
number = "6",
pages = "570--572",
month = dec,
year = "1988",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/31.6.570",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:25 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/31/6.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_06/",
URL = "http://comjnl.oxfordjournals.org/content/31/6/570.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_06/tiff/570.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_06/tiff/571.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_06/tiff/572.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of Stellenbosch",
affiliationaddress = "Stellenbosch, S Afr",
classcodes = "C6160B (Distributed DBMS)",
classification = "723; C6160B (Distributed DBMS)",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "abstract model; Computer Programming--Algorithms;
concurrency control; Concurrency Control; Database
Systems; Distributed; Distributed Basic Timestamp
Ordering, Abstract model; distributed database
concurrency control; Distributed database concurrency
control; distributed databases; overhead costs;
Overhead Costs; Overhead costs",
thesaurus = "Concurrency control; Distributed databases",
treatment = "P Practical",
}
Related entries
- 25-3-396b-396, 25-4-496a-496,
26(2)134,
26(2)175,
26(3)205,
26(3)235,
26(3)282,
27(1)3,
27(1)62,
27(3)254,
28(3)216,
28(4)366,
28(5)487,
29(1)9,
29(1)12,
29(1)24,
29(1)33,
29(2)109,
29(2)118,
29(2)176,
29(3)229,
29(3)235,
29(3)241,
29(6)527,
30(1)20,
30(1)52,
30(2)157,
30(3)228,
30(3)249,
30(5)386,
30(5)437,
30(5)451,
30(6)487,
31(1)9,
31(3)209,
31(3)220,
31(6)503,
32(2)162,
32(4)323,
32(4)362
- abstract,
23(3)243,
24(4)308,
25(1)17,
25(2)161,
26(4)289,
27(2)127,
28(1)1,
28(1)59,
28(2)154,
28(3)298,
29(3)261,
29(4)340,
31(2)110,
31(2)165,
31(3)193,
31(4)313,
32(2)127,
32(4)290,
32(4)312,
32(5)413,
32(5)461,
32(6)494
- Algorithms;, Programming-,
31(6)553,
31(6)561,
32(1)36,
32(1)45,
32(1)68,
32(1)91
- basic,
25(4)471,
29(4)289
- C6160B,
32(1)55
- concurrency,
24(3)243,
25(1)74,
27(1)62,
27(4)289,
28(5)449,
28(5)466,
29(2)118,
29(2)176,
31(2)165,
32(4)323
- cost,
25(3)368,
27(1)8,
27(2)143,
28(3)319,
30(5)458,
32(1)93,
32(2)98
- DBMS,
23(1)53,
25(2)169,
25(3)368,
25(4)448,
25(4)486,
26(3)218,
26(3)228,
27(3)209,
27(3)218,
28(2)170,
28(4)372,
28(4)391,
30(6)485,
31(2)99,
31(2)182,
31(6)490,
31(6)550,
32(1)55,
32(1)63,
32(1)68,
32(1)90,
32(4)333
- method,
22(2)105,
24(2)139,
24(2)190,
24(3)230,
24(4)320,
25(1)7,
25(1)56,
25(1)61,
25(3)327,
25(3)353,
26(1)6,
26(2)187,
26(3)199,
26(3)283,
27(3)218,
27(3)238,
28(2)112,
28(2)184,
28(3)330,
28(4)372,
28(4)379,
28(4)417,
28(4)433,
28(4)444,
28(5)498,
29(2)97,
29(2)118,
29(2)167,
29(5)416,
29(5)434,
30(1)70,
30(2)149,
30(2)163,
30(2)189,
30(3)268,
30(3)277,
30(4)289,
30(4)295,
30(4)316,
30(4)337,
30(4)376,
30(6)535,
31(1)83,
31(6)510,
31(6)565,
32(1)93,
32(2)108,
32(2)142,
32(2)187,
32(3)220,
32(3)238,
32(3)241,
32(3)281,
32(4)305,
32(4)374,
32(4)377,
32(5)385,
32(5)432,
32(6)563
- note,
24(3)278,
25(1)158,
25(1)159,
25(3)397,
26(1)93,
26(2)187,
26(2)187,
26(2)188-1,
26(3)205,
26(3)282,
27(1)83,
27(1)84,
27(1)86,
27(1)87,
27(2)179,
27(3)283-1,
27(3)283-3,
27(3)284,
27(3)284-1,
27(4)373,
27(4)375,
27(4)376,
28(2)111,
28(3)343,
29(2)189-1,
29(4)378,
29(4)380-1,
29(5)477,
29(6)572,
29(6)573,
30(2)189,
30(3)276-1,
30(3)276-2,
30(3)282-1,
30(3)283,
30(4)376,
30(4)378,
31(3)285,
31(5)474,
31(6)564,
31(6)565,
31(6)567,
32(1)13,
32(1)16,
32(1)90,
32(1)91,
32(1)93,
32(2)187,
32(3)281,
32(4)377,
32(5)474
- ordering,
28(4)444,
30(6)487,
31(4)296
- Programming--Algorithms,
31(6)553,
31(6)561,
32(1)36,
32(1)45,
32(1)68,
32(1)91
- short,
25(1)158,
26(1)93,
26(2)187,
26(2)188-1,
26(3)282,
27(1)83,
27(1)84,
27(1)86,
27(1)87,
27(3)283-1,
27(3)283-3,
27(3)284-1,
27(4)373,
27(4)375,
27(4)376,
28(2)111,
29(2)189-1,
29(4)378,
29(4)380-1,
29(5)477,
29(6)572,
29(6)573,
30(2)189,
30(3)282-1,
30(3)283,
30(4)376,
30(4)378,
31(3)285,
31(5)474,
31(6)564,
31(6)565,
31(6)567,
32(1)90,
32(1)91,
32(1)93,
32(2)152,
32(2)187,
32(3)281,
32(4)377,
32(5)474
- using,
23(1)41,
23(2)142,
23(4)380,
23(4)381,
24(2)118,
24(3)263,
24(3)271,
24(4)295,
24(4)324,
25(1)63,
25(1)84,
26(2)113,
26(4)344,
28(2)112,
28(4)409,
28(4)414,
29(2)118,
29(2)176,
29(2)182,
29(3)201,
29(5)423,
29(6)564,
30(1)87,
30(2)176,
30(4)298,
30(4)343,
30(5)437,
30(6)541,
31(3)201,
31(3)269,
31(4)289,
31(6)525,
31(6)567,
32(2)142,
32(3)273,
32(4)341,
32(5)470