Last update: Fri Mar 2 02:06:23 MST 2018
Top |
Symbols |
Numbers |
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{Zait:1996:BDP,
author = "Mohamed Za{\"\i}t and Daniela Florescu and Patrick
Valduriez",
title = "Benchmarking the {DBS3 Parallel Query Optimizer}",
journal = j-IEEE-PAR-DIST-TECH,
volume = "4",
number = "2",
pages = "26--40",
month = "Summer",
year = "1996",
CODEN = "IPDTEX",
DOI = "https://doi.org/10.1109/88.494602",
ISSN = "1063-6552 (print), 1558-1861 (electronic)",
ISSN-L = "1063-6552",
bibdate = "Mon Jun 7 07:52:29 MDT 1999",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/ieeepardisttech.bib",
URL = "http://dlib.computer.org/pd/books/pd1996/pdf/p2026.pdf;
http://www.computer.org/concurrency/pd1996/p2026abs.htm",
acknowledgement = ack-nhfb,
affiliation = "IBM Almaden Research Cent",
affiliationaddress = "Redwood Shores, CA, USA",
classification = "722.1; 722.4; 723.1; 723.3; 911.1; 921.5; C1160
(Combinatorial mathematics); C6110P (Parallel
programming); C6160B (Distributed databases)C6150C
(Compilers, interpreters and other processors)",
corpsource = "IBM Almaden Res. Center, San Jose, CA, USA",
journalabr = "IEEE Parallel Distrib Technol",
keywords = "Algebra; benchmarking; bushy trees; Cost estimation;
Cost model; cost model; cost modeling; Costs; Data
storage equipment; Database systems; DBS3 parallel
query optimizer; distributed databases; Distributed
memory architectures; Error analysis; Execution plan;
execution plan formats; Language for extended
relational algebra; Machine oriented languages;
optimising compilers; Optimization; parallel; Parallel
processing systems; performance evaluation; pipeline
processing; pipelining; problems; Processing trees;
Program compilers; programming; Query languages; query
processing; rich execution model; Shared memory
architectures; software; trees (mathematics); zigzag
trees",
treatment = "P Practical",
}
Related entries
- algebra,
1(1)17,
2(3)37
- analysis,
1(3)12,
2(1)32,
2(2)50,
2(3)16,
2(3)37,
2(3)48,
2(3)73,
2(4)9,
3(2)40,
3(2)52,
3(3)4,
3(3)20,
3(3)33,
3(3)63,
3(4)21,
3(4)34,
3(4)44,
3(4)61,
3(4)72,
4(2)49,
4(2)89,
4(3)15,
4(4)12
- architecture,
1(1)6,
1(1)9,
1(2)49,
1(2)62,
1(2)73,
1(3)12,
1(3)81,
2(1)9,
2(1)32,
2(1)51,
2(2)17,
2(2)30,
2(2)37,
2(2)57,
2(3)7,
2(3)8,
2(3)13,
2(3)48,
2(3)59,
2(4)73,
3(1)37,
3(1)51,
3(1)61,
3(1)75,
3(2)4,
3(3)4,
3(3)20,
3(3)33,
3(3)63,
3(4)14,
3(4)34,
3(4)61,
3(4)72,
4(1)25,
4(1)74,
4(2)15,
4(2)63,
4(3)12,
4(3)15,
4(3)25,
4(3)45,
4(4)8,
4(4)10,
4(4)23,
4(4)36,
4(4)50
- benchmarking,
3(4)72
- C1160,
3(1)75,
3(2)52,
3(3)50
- C6110P,
1(2)62,
1(3)22,
1(3)51,
1(3)85,
1(4)23,
1(4)32,
2(1)9,
2(1)26,
2(1)32,
2(1)40,
2(1)64,
2(2)8,
2(2)17,
2(2)30,
2(2)50,
2(3)5,
2(3)8,
2(3)16,
2(3)27,
2(3)37,
2(3)48,
2(3)59,
2(3)71,
2(3)72,
2(3)73,
2(3)76,
2(4)20,
2(4)73,
3(1)4,
3(1)12,
3(1)25,
3(1)37,
3(1)75,
3(2)52,
3(4)3,
3(4)21,
3(4)44,
3(4)72,
4(1)57,
4(2)15,
4(2)63,
4(2)89,
4(3)15,
4(3)36,
4(4)36,
4(4)50
- Combinatorial,
3(1)75,
3(2)52,
3(3)50
- compiler,
1(1)43,
2(1)32,
2(1)64,
2(3)8,
2(3)13,
2(3)16,
2(3)27,
2(3)37,
2(3)48,
2(3)71,
2(3)72,
2(3)73,
2(3)74,
2(3)75,
2(3)76,
3(1)12,
3(1)25,
3(1)75,
4(1)57,
4(4)23,
4(4)36,
4(4)50
- cost,
2(1)9,
2(1)26,
2(2)5,
2(2)57,
3(2)52,
4(2)49
- database,
1(1)6,
1(2)16,
3(4)3,
3(4)34,
4(2)15,
4(3)36,
4(4)4
- equipment,
3(1)12,
3(2)29,
3(2)40,
3(3)20,
4(2)15,
4(2)63,
4(4)8
- error,
1(4)41,
2(3)16,
2(3)48,
2(4)61
- evaluation,
1(2)33,
1(2)73,
1(3)12,
1(3)33,
1(3)51,
2(1)9,
2(2)5,
2(2)37,
2(2)57,
2(2)62,
2(3)37,
2(4)20,
3(1)25,
3(1)51,
3(3)20,
3(4)14,
3(4)21,
3(4)44,
3(4)61,
3(4)72,
4(1)9,
4(1)25,
4(1)43,
4(1)57,
4(1)74,
4(3)12,
4(3)15,
4(3)25,
4(3)36,
4(3)45,
4(4)12,
4(4)36
- execution,
1(2)62,
1(3)71,
2(1)40,
2(1)51,
2(2)37,
2(2)50,
2(4)32,
4(4)12,
4(4)23,
4(4)36
- extended,
1(2)49
- interpreters,
2(1)32,
2(1)64,
2(3)16,
2(3)37,
2(3)71,
2(3)72,
2(3)73,
2(3)74,
2(3)75,
2(3)76,
3(1)12,
3(1)25,
4(1)57,
4(4)23
- language,
1(1)6,
1(1)25,
1(2)3,
1(2)21,
1(2)49,
1(3)22,
2(1)32,
2(1)64,
2(2)37,
2(3)13,
2(3)16,
2(3)27,
2(3)37,
2(3)48,
2(3)59,
2(3)71,
2(3)72,
2(3)74,
2(3)75,
2(3)76,
2(4)9,
3(1)4,
3(1)12,
3(1)37,
3(1)75,
3(2)52,
3(3)50,
3(4)14,
4(1)6,
4(1)57,
4(2)49,
4(3)36
- machine,
1(1)25,
1(1)43,
1(2)62,
1(2)73,
2(1)26,
2(1)64,
2(2)17,
2(2)37,
2(2)50,
2(3)2,
2(3)5,
2(3)7,
2(3)8,
2(3)16,
2(3)76,
3(1)4,
3(1)37,
3(2)14,
3(3)20,
3(4)3,
3(4)34,
4(1)9,
4(1)43,
4(1)74,
4(1)84,
4(2)9,
4(2)12,
4(2)49,
4(3)15,
4(3)25,
4(3)36,
4(3)45,
4(3)63,
4(4)12,
4(4)36,
4(4)50
- mathematics,
1(1)17,
3(1)75,
3(2)52,
3(3)50,
4(3)15
- memory,
1(1)9,
1(3)83,
2(1)51,
2(1)64,
2(2)8,
2(2)17,
2(2)30,
2(2)37,
2(3)7,
2(3)8,
2(3)72,
3(2)40,
3(4)34,
4(1)25,
4(1)74,
4(2)15,
4(2)63,
4(4)12,
4(4)23,
4(4)36,
4(4)50
- model,
1(1)25,
1(2)3,
1(2)33,
1(3)85,
1(4)16,
2(1)26,
2(1)40,
2(2)17,
2(2)37,
2(2)57,
2(3)27,
2(4)9,
2(4)32,
2(4)61,
3(1)37,
3(2)14,
3(2)22,
3(4)12,
3(4)14,
3(4)44,
4(2)63,
4(2)89,
4(3)25,
4(3)36,
4(4)50
- modeling,
3(2)14,
3(2)52,
3(4)14,
3(4)21,
4(1)9
- optimising,
4(4)23
- optimization,
1(4)23,
2(1)32,
2(2)62,
3(4)14,
4(1)9
- oriented,
1(2)16,
1(2)21,
1(2)33,
1(2)49,
2(3)48,
3(1)75,
3(2)22,
3(2)52
- other,
2(1)32,
2(1)64,
2(2)5,
2(2)30,
2(3)16,
2(3)37,
2(3)71,
2(3)72,
2(3)73,
2(3)74,
2(3)75,
2(3)76,
3(1)12,
3(1)25,
3(2)14,
3(2)29,
3(3)50,
4(1)57,
4(4)4,
4(4)8,
4(4)23
- pipeline,
1(3)85,
2(3)48
- plan,
2(3)76
- problem,
1(2)21,
1(4)23,
1(4)72,
2(3)5,
2(3)59,
3(1)12,
4(2)15,
4(2)49,
4(2)89,
4(3)15,
4(3)36,
4(4)36
- processor,
1(1)25,
1(2)21,
1(2)49,
1(2)73,
1(3)51,
1(4)23,
2(1)32,
2(1)64,
2(2)30,
2(2)37,
2(2)62,
2(3)8,
2(3)16,
2(3)37,
2(3)59,
2(3)71,
2(3)72,
2(3)73,
2(3)74,
2(3)75,
2(3)76,
2(4)20,
2(4)49,
3(1)12,
3(1)25,
3(2)40,
4(1)9,
4(1)57,
4(2)49,
4(4)23,
4(4)36,
4(4)50
- query,
3(4)3
- relational,
1(2)16
- shared,
1(3)83,
1(4)58,
2(1)51,
2(2)30,
2(3)7,
2(3)8,
2(3)72,
4(1)25,
4(1)74,
4(2)15,
4(2)63,
4(3)36,
4(4)8,
4(4)23,
4(4)36
- storage,
1(4)16,
2(1)26,
2(2)30,
3(1)12,
3(1)51,
3(2)29,
3(3)33,
3(4)12,
4(2)15,
4(2)41,
4(2)63,
4(4)23,
4(4)36,
4(4)50,
4(4)65
- tree,
3(4)21