Entry Suraweera:1986:UDC 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{Suraweera:1986:UDC,
author = "F. Suraweera",
title = "Use of Doubly Chained Tree Structures in File
Organisation for Optimal Searching",
journal = j-COMP-J,
volume = "29",
number = "1",
pages = "52--59",
month = feb,
year = "1986",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/29.1.52",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "68P10",
MRnumber = "829 330",
bibdate = "Tue Dec 4 14:48:20 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/29/1.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/29/1/52.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_01/tiff/52.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_01/tiff/53.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_01/tiff/54.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_01/tiff/55.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_01/tiff/56.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_01/tiff/57.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_01/tiff/58.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_01/tiff/59.tif",
acknowledgement = ack-nhfb,
affiliation = "Kuwait Univ, Mathematics Dep, Kuwait",
affiliationaddress = "Kuwait Univ, Mathematics Dep, Kuwait",
classcodes = "C1160 (Combinatorial mathematics); C4250 (Database
theory); C6120 (File organisation)",
classification = "723; 921",
corpsource = "Dept. of Math., Kuwait Univ., Kuwait",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "computer programming --- Algorithms; data processing;
data structure; data structures; database theory;
doubly chained tree structures; dynamic data structure;
file maintenance; file organisation; File Organization;
information retrieval; mathematical techniques ---
Trees; minimisation; optimal searching; search time
minimisation; static; tree structure; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
Related entries
- 68P10,
26(4)293,
27(3)218,
27(3)270,
28(1)54,
28(4)417,
28(4)426,
29(5)436,
30(6)565,
31(6)490,
31(6)553,
31(6)557,
31(6)561,
32(1)68
- chained,
28(3)330,
31(1)41
- dynamic,
23(1)53,
23(2)115,
23(2)147,
23(4)298,
24(4)383-1,
25(1)63,
25(2)199,
25(3)358,
25(3)388,
25(4)478,
26(1)25,
27(1)87,
27(2)135,
27(2)143,
27(3)284,
27(3)284-1,
27(4)328,
28(2)170,
28(3)250,
28(3)330,
29(2)127,
29(2)182,
29(2)189,
29(2)189-1,
30(2)119,
30(3)258,
30(6)541,
31(4)296,
31(5)457,
31(6)531,
32(1)16,
32(3)194,
32(3)241
- maintenance,
25(1)126,
25(2)169,
26(2)124,
27(2)97,
29(1)20,
29(4)322,
31(2)165,
31(3)229
- mathematical,
24(2)177,
24(2)180,
24(2)184,
25(1)7,
25(1)56,
25(4)478,
26(1)6,
26(2)97,
26(2)106,
26(3)193,
27(2)165,
27(4)368-1,
28(1)5,
28(1)78,
28(1)89,
28(2)142,
28(2)179,
28(4)414,
28(4)417,
28(4)426,
28(5)498,
28(5)524,
28(5)530,
28(5)538,
29(1)36,
29(2)171,
29(2)176,
29(2)182,
29(4)378,
29(5)416,
29(6)553,
30(1)16,
30(1)20,
30(1)70,
30(2)128,
30(2)189,
30(3)258,
30(3)268,
30(3)282,
30(4)298,
30(5)458,
30(6)498,
30(6)569,
31(1)61,
31(1)71,
31(1)76,
31(2)155,
31(3)229,
31(3)243,
31(3)283,
31(4)364,
31(6)490,
31(6)545,
31(6)557,
31(6)564,
31(6)567,
32(1)45,
32(1)68,
32(1)76,
32(1)86,
32(1)93,
32(2)175,
32(4)351,
32(4)374,
32(4)377
- 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)218,
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)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
- minimisation,
23(1)90
- optimal,
23(4)347,
25(1)32,
25(1)93,
25(2)183,
25(2)239,
25(3)338,
27(4)321,
28(1)5,
28(1)17,
28(5)524,
29(2)161,
29(2)182,
30(4)298,
30(5)433,
31(4)344,
32(3)194,
32(3)246
- 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)218,
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(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
- organization,
25(1)158,
25(2)169,
25(2)207,
25(3)327,
25(3)368,
27(2)143,
27(3)284,
27(3)284-1,
27(4)321,
28(3)313,
28(3)319,
28(3)330,
28(4)414,
28(5)524,
29(3)277,
29(4)368,
30(1)80,
30(4)343,
30(6)529,
30(6)535,
31(1)41,
31(3)253,
31(6)565,
32(3)262
- retrieval,
23(1)37,
23(2)131,
23(2)131-1,
24(4)312,
25(1)2,
25(1)158,
25(4)478,
26(2)106,
26(3)239,
26(4)336,
27(2)121,
28(1)54,
28(3)264,
28(3)319,
29(3)277,
29(5)460,
29(5)467,
29(6)481,
30(4)343,
30(5)420,
30(6)485,
31(1)41,
31(2)147,
31(6)550,
32(3)212,
32(3)220,
32(3)228,
32(4)333
- search,
23(3)248,
23(3)256,
24(1)29,
25(1)2,
25(1)126,
25(1)158,
25(2)199,
25(3)353,
26(2)106,
26(2)154,
27(4)373,
28(2)105,
28(2)179,
28(3)264,
28(3)313,
28(3)319,
29(1)17,
29(1)36,
29(1)76,
29(2)167,
29(2)176,
29(4)368,
29(5)436,
30(6)565,
31(2)175,
32(1)68,
32(3)212,
32(6)567,
z(z)z
- searching,
26(4)354,
28(3)264,
29(4)368,
29(5)430,
30(5)420,
30(6)565,
32(3)212
- static,
23(2)115,
25(1)17,
25(1)87,
27(3)201,
28(3)250
- Suraweera, F.,
31(6)561
- time,
23(1)34,
23(2)147,
23(2)153,
23(3)262,
23(4)290,
24(1)85,
24(2)156,
25(1)32,
25(1)45,
25(2)193,
25(4)429,
26(2)154,
26(3)224,
26(4)293,
26(4)320,
27(1)27,
27(3)201,
27(3)246,
27(3)254,
27(4)368-1,
28(1)9,
28(1)54,
28(1)78,
28(2)105,
28(3)309,
28(4)409,
28(4)412,
29(1)47,
29(2)103,
29(2)118,
29(2)176,
29(3)229,
29(3)269,
29(5)390,
29(5)396,
29(5)436,
30(3)249,
30(4)362,
30(4)372,
30(4)376,
30(5)475,
30(6)519,
30(6)535,
31(3)243,
31(3)279,
31(3)283,
31(6)496,
31(6)545,
31(6)553,
32(3)212,
32(3)228,
32(3)241,
32(4)374,
32(5)474
- use,
23(2)107,
24(1)95,
25(2)218,
26(1)93,
26(3)235,
28(2)162,
28(3)203,
29(2)167,
29(4)289,
29(5)430,
30(1)80,
30(3)214,
30(4)362,
30(5)437,
30(5)451,
31(3)243,
31(4)289,
31(5)420,
32(2)122,
32(2)152,
32(4)333,
z(z)z