Entry Libera:1986:UBT 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{Libera:1986:UBT,
author = "F. D. Libera and F. Gosen",
title = "Using {B}-Trees to Solve Geographic Range Queries",
journal = j-COMP-J,
volume = "29",
number = "2",
pages = "176--181",
month = apr,
year = "1986",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/29.2.176",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:20 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/29/2.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/29/2/176.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_02/tiff/176.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_02/tiff/177.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_02/tiff/178.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_02/tiff/179.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_02/tiff/180.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_02/tiff/181.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ de Padova, Padua, Italy",
affiliationaddress = "Univ de Padova, Padua, Italy",
classcodes = "C4210 (Formal logic); C4240 (Programming and algorithm
theory)",
classification = "723; 921",
corpsource = "Fac. di Sci. Stat., Padova Univ., Italy",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "algorithm; Algorithms; B-trees; computational
complexity; computer programming; concurrency control;
data processing --- Data Structures; data structure;
database systems; file system; geographic information
systems; geographic range queries; interactive
geographic information system; inverted file; logical;
mathematical techniques --- Trees; Pascal listings;
quadtree; range queries; recovery; running time; search
key; subroutines; trees (mathematics); two-level memory
environment; {B}-trees",
treatment = "T Theoretical or Mathematical",
xxpages = "176--180",
}
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(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,
31(6)570,
32(2)162,
32(4)323,
32(4)362
- B-trees,
27(3)218
- complexity,
25(1)63,
25(3)379,
26(3)224,
26(4)293,
26(4)354,
27(1)72,
27(2)135,
27(4)315,
27(4)340,
28(1)5,
28(1)78,
28(5)487,
28(5)496,
29(2)103,
29(2)161,
29(2)182,
29(4)300,
29(4)322,
29(4)330,
29(5)451,
30(1)43,
30(2)176,
30(3)201,
30(3)223,
30(3)233,
30(3)258,
30(3)282,
30(4)308,
30(4)376,
30(5)433,
31(1)56,
31(1)71,
31(1)83,
31(3)283,
31(4)289,
31(6)490,
31(6)545,
31(6)553,
31(6)561,
31(6)567,
32(4)362,
32(5)474
- computational,
23(2)123,
23(2)187,
26(2)164,
26(3)224,
26(4)293,
26(4)354,
27(1)72,
27(2)135,
27(4)315,
27(4)375,
28(3)335,
28(4)433,
28(5)496,
29(1)76,
29(2)103,
29(4)322,
29(4)330,
29(4)373,
29(5)467,
30(1)43,
30(1)87,
30(2)176,
30(3)201,
30(3)223,
30(3)233,
30(3)282,
30(4)376,
30(5)433,
31(1)56,
31(1)71,
31(1)83,
31(3)283,
31(4)289,
31(6)490,
31(6)545,
31(6)553,
31(6)561,
31(6)567,
32(1)93,
32(4)377,
32(5)453,
32(5)474
- concurrency,
24(3)243,
25(1)74,
27(1)62,
27(4)289,
28(5)449,
28(5)466,
29(2)118,
31(2)165,
31(6)570,
32(4)323
- environment,
23(1)13,
23(1)13,
23(2)115,
23(2)124,
27(1)37,
27(2)127,
28(2)148,
29(1)90,
29(2)151,
29(3)201,
29(4)289,
30(1)20,
30(2)157,
30(3)193,
31(2)165,
31(4)296,
31(4)353,
31(6)540,
32(1)55,
32(5)386,
32(6)541
- geographic,
28(1)73,
31(4)358
- interactive,
23(3)233,
24(1)62,
24(2)191,
25(3)399,
26(1)93,
26(2)187,
26(3)199,
26(3)235,
27(1)8,
27(2)112,
28(1)22,
28(2)117,
28(5)474,
29(1)38,
29(3)201,
29(5)385,
29(5)396,
31(5)445,
31(5)457,
32(1)21,
32(1)86,
32(2)142,
32(2)162,
32(6)516
- inverted,
25(2)169
- key,
23(2)188,
25(3)327,
25(4)478,
25(4)486,
27(3)218,
27(3)270,
27(4)368-1,
28(3)291,
28(3)309,
28(3)343,
29(3)277,
29(4)368,
30(3)276-2,
30(6)535,
30(6)565
- level, two-,
25(1)63,
26(2)134,
28(3)250,
29(5)451,
32(1)36
- listing,
27(4)368-1,
27(4)373,
28(2)117,
28(3)340,
28(3)343,
30(3)277,
30(6)569,
31(6)553,
31(6)557
- logical,
23(1)41,
23(4)380,
23(4)381,
25(1)68,
27(4)301,
28(2)112,
28(2)170,
28(3)330,
29(1)12,
29(5)472,
29(6)481,
31(2)116,
31(6)510,
32(3)252
- 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(1)52,
29(2)171,
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)52,
29(1)76,
29(2)171,
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
- memory,
24(1)14,
25(1)37,
25(1)140,
25(1)159,
25(2)227,
26(1)43,
26(2)188,
27(3)254,
27(4)328,
27(4)362,
28(1)68,
28(3)291,
28(4)357,
28(4)398,
29(1)1,
29(2)127,
29(6)522,
30(2)119,
30(3)201,
30(4)308,
30(4)362,
32(3)228,
32(5)461
- Pascal,
24(2)112,
25(1)17,
25(2)176,
25(2)248,
25(3)289,
25(3)340,
25(4)496,
26(2)164,
26(2)187,
26(4)366,
27(4)348,
27(4)373,
28(2)134,
28(3)270,
28(4)391,
29(3)246,
29(3)277,
29(5)423,
30(1)52,
30(3)277,
30(4)337,
30(4)355,
30(4)372,
31(1)1,
31(1)9,
31(6)553,
31(6)557,
32(2)152
- quadtree,
26(1)83,
26(2)188,
26(4)375,
28(1)73,
29(1)60,
29(5)472,
30(1)87,
30(2)176,
30(4)355,
31(4)353,
31(4)358
- query,
24(1)56,
24(2)125,
25(1)2,
25(2)239,
26(3)239,
27(4)301,
28(2)154,
28(2)162,
28(3)282,
29(1)38,
29(1)76,
29(5)451,
30(2)157,
30(6)535,
31(1)34,
31(1)41,
31(2)133,
31(2)155,
31(4)344,
32(1)55,
32(1)90,
32(3)220
- recovery,
24(4)316,
24(4)367,
25(3)331,
26(1)15,
28(5)466,
29(5)404,
30(1)20,
31(5)474,
32(3)246,
32(4)323
- running,
25(1)45,
27(4)321,
28(4)412,
32(3)228
- 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)52,
29(1)76,
29(2)167,
29(4)368,
29(5)436,
30(6)565,
31(2)175,
32(1)68,
32(3)212,
32(6)567,
z(z)z
- solve,
31(3)243
- subroutine,
23(3)243,
23(3)262,
24(1)83,
24(1)87,
24(2)162,
24(2)167,
24(3)249,
25(4)423,
26(1)92,
26(2)184,
26(2)187,
27(2)179,
28(2)117,
28(3)340
- 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(1)52,
29(2)103,
29(2)118,
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
- Trees, {B}-,
27(3)218
- trees, {B}-,
27(3)218
- two-level,
25(1)63,
26(2)134,
28(3)250,
29(5)451,
32(1)36
- 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)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,
31(6)570,
32(2)142,
32(3)273,
32(4)341,
32(5)470
- {B}-trees,
27(3)218,
28(4)417
- {B}-Trees,
24(4)367,
27(3)218