Entry Larson:1985:PAS 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{Larson:1985:PAS,
author = "Per-{\AA}ke Larson",
title = "Performance Analysis of a Single-File Version of
Linear Hashing",
journal = j-COMP-J,
volume = "28",
number = "3",
pages = "319--329",
month = jul,
year = "1985",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/28.3.319",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:18 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/28/3.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/28/3/319.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/319.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/320.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/321.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/322.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/323.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/324.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/325.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/326.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/327.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/328.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/329.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of Waterloo, Dep of Computer Science, Waterloo,
Ont, Can",
affiliationaddress = "Univ of Waterloo, Dep of Computer Science,
Waterloo, Ont, Can",
classcodes = "C4240 (Programming and algorithm theory); C6120 (File
organisation)",
classification = "723",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "cost of insertions; data processing; file
organisation; File Organization; length search; linear
hashing; linear hashing with partial expansions;
overflow chains; overflows; partial expansions;
performance; performance analysis; performance
evaluation; programming; retrieval; single-file version
of linear hashing; storage area; theory",
treatment = "T Theoretical or Mathematical",
}
Related entries
- area,
23(2)189,
24(1)52,
24(4)320,
24(4)367,
26(4)375,
28(3)231,
28(3)243,
30(3)193,
30(4)295,
31(3)209,
31(4)296,
32(3)252,
32(6)554
- chain,
26(1)10,
26(2)113,
27(2)135,
30(3)201,
30(6)529,
30(6)541,
31(2)141,
31(6)545
- cost,
25(3)368,
27(1)8,
27(2)143,
30(5)458,
31(6)570,
32(1)93,
32(2)98
- evaluation,
23(2)142,
23(2)187-1,
24(3)288,
25(2)183,
25(2)188,
25(2)239,
25(4)493,
26(2)134,
27(1)87,
27(3)201,
28(2)128,
28(2)142,
28(3)223,
28(3)309,
28(4)409,
28(4)426,
29(4)380,
29(4)380-1,
29(5)390,
29(5)396,
30(3)214,
30(3)228,
30(4)289,
30(4)362,
30(4)376,
30(5)437,
30(6)481,
30(6)519,
31(1)12,
31(3)220,
31(4)304,
31(5)409,
31(5)437,
31(6)565,
32(1)36,
32(2)98,
32(2)142,
32(2)162,
32(5)437,
32(5)461
- expansion,
25(1)114,
26(3)239
- hashing,
25(3)358,
25(4)478,
25(4)486,
27(3)218,
28(1)54,
28(3)313,
28(3)330,
29(3)277,
29(5)436,
30(6)535
- insertion,
23(1)61,
25(1)158,
27(4)368-1,
28(2)179,
28(4)417,
28(4)426,
29(3)282,
29(5)436,
30(6)529
- Larson, Per-Åke,
25(3)347
- length,
23(1)37,
23(2)161,
25(1)116,
25(3)368,
28(3)291,
28(4)379,
29(2)167,
31(3)248,
32(1)68,
32(3)246,
z(z)z
- linear,
23(1)78,
24(2)156,
25(1)56,
25(3)347,
27(4)373,
28(1)73,
28(1)78,
28(2)142,
28(4)412,
30(2)176,
30(4)372,
31(3)279,
31(6)567,
32(3)228,
32(4)362,
32(6)571
- 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)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
- 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)330,
28(4)414,
28(5)524,
29(1)52,
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
- overflow,
23(2)153,
25(3)347,
28(3)330,
29(2)167,
29(5)416,
30(6)529,
z(z)z
- partial,
23(1)37,
23(2)153,
24(1)83,
25(1)2,
28(5)449,
30(3)268,
30(6)535,
31(2)147,
31(6)510
- performance,
24(2)132,
24(4)343,
24(4)347,
24(4)384-2,
25(1)74,
25(2)169,
25(2)188,
25(2)193,
25(2)227,
25(3)347,
25(4)486,
26(1)93,
26(2)113,
27(1)27,
27(2)143,
27(2)165,
27(3)201,
27(3)238,
27(3)270,
28(2)142,
28(2)179,
28(3)231,
28(3)309,
28(3)330,
28(4)409,
28(4)426,
28(5)501,
29(1)47,
29(2)118,
29(4)289,
29(5)390,
29(5)396,
29(5)451,
30(4)289,
30(4)362,
30(6)519,
30(6)535,
31(1)12,
31(3)276,
31(4)304,
31(5)409,
31(5)437,
31(5)445,
31(6)490,
31(6)565,
32(1)16,
32(2)142,
32(2)152,
32(3)228,
32(3)252,
32(4)333,
32(5)437,
32(5)453
- 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,
29(1)52,
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,
29(1)17,
29(1)36,
29(1)52,
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
- version,
25(1)93,
29(6)527,
30(1)70,
31(3)276,
32(5)386