Entry Rennhackkamp:1988:UAM from compj.bib
Last update: Sun Nov 30 02:31:30 MST 2003
Top |
Symbols |
Numbers |
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:UAM,
author = "M. H. Rennhackkamp and S. H. {von Solms}",
title = "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",
ISSN = "0010-4620",
bibdate = "Tue Mar 25 13:51:56 MST 1997",
bibsource = "Compendex database;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_06/",
URL = "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)",
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
- abstract,
15(1)37,
18(2)164,
22(3)240,
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)290,
32(4)312,
32(5)413,
32(5)461,
32(6)494,
33(1)40,
34(1)52,
34(2)186,
34(4)290,
34(6)z-1,
35(2)138,
35(2)170,
35(5)468,
36(1)4,
36(4)387,
36(8)712,
38(3)181,
38(6)457,
38(8)670,
38(10)785,
39(1)20,
39(1)52,
39(2)145,
39(7)598
- Algorithms;, Programming-,
31(6)553,
31(6)561,
32(1)36,
32(1)45,
32(1)68,
32(1)91
- basic,
4(1)20,
7(4)282,
11(2)157,
11(3)352,
12(1)102,
12(3)251,
13(2)131,
14(4)447,
15(3)238,
16(3)205,
19(1)56,
19(1)90,
19(3)276,
21(3)234,
25(4)471,
29(4)289,
37(4)243,
37(4)259,
37(4)269
- C6160B,
32(1)55,
33(1)61,
33(1)71,
33(1)79,
34(6)514,
34(6)551,
34(6)z-8,
35(2)98,
37(2)88,
37(6)487,
37(6)509,
37(7)561
- 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,
33(6)501,
34(4)345,
34(6)z-8,
35(1)45,
36(2)168,
36(8)723,
37(6)519,
38(9)704,
38(9)717,
39(5)417,
39(6)511,
40(10)630,
42(6)511
- cost,
12(2)118,
14(1)13,
15(2)170,
15(3)254,
16(3)262,
16(4)347,
17(3)224,
18(2)98,
18(3)198,
21(1)7,
21(3)199,
22(3)234,
25(3)368,
27(1)8,
27(2)143,
28(3)319,
30(5)458,
32(2)98,
33(1)61,
34(1)73,
35(1)62,
35(2)98,
35(5)z-2,
37(5)429,
37(8)715,
38(1)71,
38(5)339,
38(8)691,
38(10)801,
39(4)325,
39(5)417,
39(6)496
- DBMS,
21(1)15,
22(3)195,
22(3)200,
22(4)303,
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,
33(1)2,
33(1)11,
33(1)19,
33(1)31,
33(1)40,
33(1)49,
33(1)61,
33(1)71,
33(1)79,
33(6)535,
33(6)547,
34(1)73,
34(3)225,
34(3)239,
34(3)254,
34(3)265,
34(3)282,
34(5)455,
34(6)514,
34(6)551,
34(6)z-4,
34(6)z-8,
35(1)45,
35(2)98,
35(2)119,
35(2)129,
35(4)322,
35(4)332,
35(5)501,
35(6)611,
36(2)127,
36(8)734,
37(1)26,
37(2)88,
37(3)164,
37(7)576,
37(7)588,
38(1)31,
38(1)43
- ordering,
4(2)150,
6(4)366,
9(3)250,
14(2)150,
17(1)80,
18(1)49,
28(4)444,
30(6)487,
31(4)296,
37(1)35,
39(1)36
- overhead,
13(4)363,
15(1)25,
33(3)219,
33(5)466,
35(1)52,
38(6)457,
38(6)471
- Programming--Algorithms,
31(6)553,
31(6)561,
32(1)36,
32(1)45,
32(1)68,
32(1)91