Database partitioning in a cluster of processors (1985)
by
Domenico Sacca
| Venue: | ACM TODS |
| Citations: | 21 - 1 self |
BibTeX
@ARTICLE{Sacca85databasepartitioning,
author = {Domenico Sacca},
title = {Database partitioning in a cluster of processors},
journal = {ACM TODS},
year = {1985},
volume = {10},
pages = {29--56}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Citations
| 317 | Some simplified NP-complete graph problems, Theoret - Garey, Johnson, et al. - 1976 |
| 17 | Optimal program and data locations in computer networks - Morgan, Levin - 1977 |
| 7 | et al., R : An Overview of the Architecture - Williams |
| 5 | Approximation Algorithms for - Johnson - 1974 |
| 2 | Optimal File Allocation in a Multicomputer Information System - Chu - 1968 |
| 2 | Computers andlntractability: A Guide to the Theory of NP-Completeness - Garey, Johnson - 1979 |
| 1 | Oplimal Design of Dislribuled Dalabases; Stanford Univ., CA, CS Itcport No.S’l’AN-CS-81-884, Dec.1981. (CODl>SO] Codd,E.F. : “Extending the Database Relational Model to Capture More Meaning - Cc, S, et al. |
| 1 | Worst-case pcrfor.mance bounds for simple one-dimensional packing algorithms - Johnson, Demers, et al. |
| 1 | Database Design, second edition - Wicderhold - 1983 |
