Data Management on Distributed Databases |
Contents
Architecture of the System Supporting a | 12 |
Query Decomposition on a Distributed Relational Database | 23 |
Cost Reduction on the Placements of Relations on a | 33 |
Copyright | |
9 other sections not shown
Common terms and phrases
architecture associative buffers associative memory associative sequential memory assumed B₂ backend Bit-cell bit-slice branch and bound Cmax communication condition current sub-cycle data modules database machine defined distributed dynamic Figure file allocation problem file migration File Partitioning file placement free module gate delays greatest value search hardware heuristic implementation initiated issues join processor K₂ knapsack problem least value search Lemma lookahead loop memory hierarchy memory modules minimize minor cycle Mode multiple copies MWFMF Scheduling Algorithm node non-deterministic Turing machine NP-complete ordered retrieval Organization overhead parallel performance precedence graph processing module proximity search queued random requests redundancy and partitioning redundant information relation a(b request queue requirements S₁ S₂ scheduling algorithm selection sequence shown signal SIMD Simulation Results single relation solution solve storage device stored technologies theorem tuples Ui,b update cost update rate users warehouse location problem word