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{Segev:1987:OTW,
author = "A. Segev",
title = "Optimising Two-Way Joins in Horizontally Partitioned
Database Systems",
journal = j-COMP-J,
volume = "30",
number = "5",
pages = "458--468",
month = oct,
year = "1987",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/30.5.458",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "68P15",
MRnumber = "88i:68020",
bibdate = "Tue Dec 4 14:48:23 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/5.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/",
URL = "http://comjnl.oxfordjournals.org/content/30/5/458.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/458.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/459.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/460.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/461.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/462.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/463.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/464.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/465.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/466.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/467.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/468.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of California, Berkeley, CA, USA",
affiliationaddress = "Univ of California, Berkeley, CA, USA",
classcodes = "C1180 (Optimisation techniques); C4250 (Database
theory); C6160B (Distributed DBMS)",
classification = "723; 921",
corpsource = "Sch. of Bus. Adm., California Univ., Berkeley, CA,
USA",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "communication cost savings; database systems; database
theory; distributed database; distributed databases;
fragmented database; heuristic procedures; horizontally
partitioned database systems; mathematical model;
Mathematical Models; mathematical techniques --- Trees;
NP-complete; optimisation; semi-join strategy; systems
science and cybernetics --- Heuristic Programming;
tree-based formulation; two-way joins; two-way joins
optimization",
treatment = "T Theoretical or Mathematical",
}
Related entries
- 68P15,
27(4)315,
28(2)162
- communication, 23-3-255b-255,
23(4)369,
24(1)25,
24(1)78,
25(1)22,
25(1)87,
25(2)161,
25(4)410,
25(4)494,
26(3)247,
28(1)5,
28(3)200,
29(2)109,
29(6)506,
30(3)254,
30(5)437,
31(2)175,
31(4)289,
31(4)296,
32(3)252,
32(3)262,
32(3)267,
32(4)362,
32(5)461
- complete;, NP-,
28(2)105
- cost,
25(3)368,
27(1)8,
27(2)143,
28(3)319,
31(6)570,
32(1)93,
32(2)98
- cybernetics,
23(2)98,
24(3)278,
26(1)1,
26(3)255,
28(2)112,
28(4)375,
29(2)161,
30(5)413,
31(5)445
- formulation,
24(3)271,
29(2)182
- heuristic,
23(4)338,
24(1)85,
25(3)353,
27(4)301,
27(4)315,
29(1)47,
29(2)135,
31(3)253,
32(2)98,
32(3)228
- join,
29(4)378,
29(4)378,
29(5)451,
31(2)141
- 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)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(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
- NP-complete,
28(2)105,
28(4)406,
32(5)474
- optimisation,
23(1)89,
23(4)338,
28(5)518,
29(2)118,
30(4)308,
30(5)475,
31(2)99,
32(3)228,
32(3)273,
32(4)374
- optimising,
30(5)475,
32(2)152
- optimization,
23(4)338,
25(2)188,
25(3)340,
26(2)154,
27(4)301,
28(5)518,
29(2)118,
29(2)182,
29(6)495,
31(1)71,
31(2)99,
31(4)344,
32(2)152
- partitioned,
26(3)218
- procedure,
23(2)107,
23(2)115,
23(2)142,
23(2)187-1,
23(3)212,
23(3)230,
23(3)233,
23(4)382,
24(1)29,
25(2)199,
25(2)207,
25(3)331,
26(4)354,
29(6)531,
30(5)451,
31(1)12,
31(1)51,
31(1)65,
31(2)110
- saving,
23(2)165,
27(4)368-1
- science,
23(2)98,
23(2)114-1,
23(2)146-1,
23(4)377,
24(1)91,
24(3)278,
25(1)2,
25(1)135,
25(2)183,
25(3)307,
26(1)1,
26(1)79,
26(2)142,
26(3)255,
26(3)270,
28(1)82,
28(2)112,
28(3)195,
28(3)200,
28(3)203,
28(3)206,
28(3)211,
28(4)375,
29(1)83,
29(1)90,
29(2)161,
29(2)189,
29(2)189-1,
29(3)212,
29(3)277,
29(5)460,
29(5)467,
29(6)481,
30(1)52,
30(3)239,
30(4)343,
30(5)413,
30(5)469,
30(6)485,
31(1)1,
31(2)182,
31(3)248,
31(5)386,
31(5)391,
31(5)398,
31(5)409,
31(5)420,
31(5)426,
31(5)431,
31(5)437,
31(5)445,
31(5)457,
31(5)465,
31(6)525,
31(6)531,
32(2)108,
32(3)262,
32(6)516
- strategy,
23(4)347,
24(4)290,
25(1)2,
25(1)52,
25(1)135,
27(1)80,
27(3)193,
27(4)328,
27(4)340,
28(3)309,
28(4)439,
29(2)161,
30(4)376,
30(5)386,
31(2)175,
31(4)344,
31(5)445,
32(3)220