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{Bell:1984:HTV,
author = "D. A. Bell and S. M. Deen",
title = "Hash Trees Versus {B}-Trees",
journal = j-COMP-J,
volume = "27",
number = "3",
pages = "218--224",
month = aug,
year = "1984",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/27.3.218",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "68P05 (68P10)",
MRnumber = "761 589",
bibdate = "Tue Dec 4 14:48:17 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/27/3.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/27/3/218.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_03/tiff/218.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_03/tiff/219.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_03/tiff/220.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_03/tiff/221.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_03/tiff/222.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_03/tiff/223.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_03/tiff/224.tif",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation)",
classification = "723",
corpsource = "School of Computer Sci., Ulster Polytech.,
Newtownabbey, UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "B-trees method; data processing; DBMS; distribution;
external hashing; file organisation; hash trees; hash
trees method; indexing technique; primary key; trees
(mathematics); {B}-trees",
treatment = "P Practical",
}
Related entries
- 68P05,
29(1)36,
29(2)171,
31(4)358,
31(6)490,
32(5)470
- 68P10,
26(4)293,
27(3)270,
28(1)54,
28(4)417,
28(4)426,
29(1)52,
29(5)436,
30(6)565,
31(6)490,
31(6)553,
31(6)557,
31(6)561,
32(1)68
- B-trees,
29(2)176
- Bell, D. A.,
25(4)486,
31(3)253
- 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,
28(2)170,
28(4)372,
28(4)391,
30(6)485,
31(2)99,
31(2)182,
31(6)490,
31(6)550,
31(6)570,
32(1)55,
32(1)63,
32(1)68,
32(1)90,
32(4)333
- Deen, S. M.,
23(3)201,
24(3)200,
25(4)486,
28(3)282,
30(2)157,
31(2)175
- distribution,
23(4)298,
25(1)159,
26(1)25,
27(1)27,
27(2)97,
27(4)328,
28(3)309,
28(4)426,
28(5)530,
29(1)36,
29(2)167,
31(4)296,
32(3)212,
32(4)323,
32(4)362
- external,
25(2)227,
25(3)327,
27(3)270,
32(2)162,
32(4)333
- hash,
23(2)188,
24(2)130,
24(4)383-1,
25(3)347,
25(4)486,
28(3)313,
28(4)412,
29(2)167,
29(5)430,
z(z)z
- hashing,
25(3)358,
25(4)478,
25(4)486,
28(1)54,
28(3)313,
28(3)319,
28(3)330,
29(3)277,
29(5)436,
30(6)535
- indexing,
23(3)207,
25(1)2,
26(2)188,
27(2)121,
28(3)309,
28(4)375,
29(1)17,
30(4)343,
32(3)212,
32(3)220
- key,
23(2)188,
25(3)327,
25(4)478,
25(4)486,
27(3)270,
27(4)368-1,
28(3)291,
28(3)309,
28(3)343,
29(2)176,
29(3)277,
29(4)368,
30(3)276-2,
30(6)535,
30(6)565
- mathematics,
23(2)161,
23(3)248,
23(3)256,
23(4)332,
25(1)158,
25(2)235,
25(2)239,
25(2)257,
26(2)97,
26(2)106,
26(2)188,
26(3)193,
26(3)205,
26(3)224,
27(2)178,
27(2)184,
27(3)225,
27(4)368-1,
28(1)73,
28(2)105,
28(3)313,
28(4)417,
28(4)426,
28(4)433,
28(4)439,
28(5)538,
29(1)36,
29(1)52,
29(1)76,
29(2)171,
29(2)176,
29(6)564,
30(3)268,
30(3)277,
30(3)282,
30(4)355,
30(5)433,
30(6)569,
31(1)61,
31(1)65,
31(3)269,
31(4)330,
31(4)353,
31(4)364,
31(6)557,
31(6)564,
31(6)567,
32(1)68,
32(1)76,
32(3)281,
32(4)374,
32(5)470,
32(5)474,
32(6)571
- 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)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,
31(6)570,
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
- organisation,
23(1)37,
23(3)207,
24(1)29,
24(4)290,
25(1)158,
25(2)169,
25(2)193,
25(2)239,
25(3)327,
25(3)368,
26(1)43,
26(3)196,
27(2)143,
27(3)270,
27(3)284,
27(4)321,
27(4)334,
28(1)54,
28(2)179,
28(3)203,
28(3)243,
28(3)291,
28(3)313,
28(3)319,
28(3)330,
28(4)391,
28(4)412,
28(4)414,
28(4)417,
28(4)426,
28(5)524,
29(1)52,
29(2)167,
29(3)277,
29(4)368,
29(5)436,
29(6)522,
30(1)80,
30(6)529,
30(6)535,
30(6)565,
31(1)41,
31(5)426,
31(6)490,
31(6)517,
31(6)531,
31(6)540,
31(6)565,
32(1)63,
32(1)68,
32(3)212,
32(3)228,
32(4)323,
32(4)351,
32(6)494
- primary,
23(3)207,
25(4)478,
28(3)291,
28(4)398,
28(5)518,
32(6)494
- Trees, {B}-,
29(2)176
- trees, {B}-,
29(2)176
- versus,
25(2)227,
31(5)457
- {B}-Trees,
24(4)367,
29(2)176
- {B}-trees,
28(4)417,
29(2)176