A case for fractured mirrors
暂无分享,去创建一个
[1] Tom W. Keller,et al. Data placement in Bubba , 1988, SIGMOD '88.
[2] Martin L. Kersten,et al. Flattening an object algebra to provide performance , 1998, Proceedings 14th International Conference on Data Engineering.
[3] Cyril U. Orji,et al. Doubly distorted mirrors , 1993, SIGMOD '93.
[4] Miron Livny,et al. Multi-disk management algorithms , 1987, SIGMETRICS '87.
[5] Goetz Graefe,et al. The five-minute rule ten years later, and other computer storage rules of thumb , 1997, SGMD.
[6] Yannis E. Ioannidis,et al. Query optimization , 1996, CSUR.
[7] David J. DeWitt,et al. Weaving Relations for Cache Performance , 2001, VLDB.
[8] Patrick E. O'Neil,et al. Improved query performance with variant indexes , 1997, SIGMOD '97.
[9] David J. DeWitt,et al. Shoring up persistent applications , 1994, SIGMOD '94.
[10] Patrick Valduriez,et al. A query processing strategy for the decomposed storage model , 1987, 1987 IEEE Third International Conference on Data Engineering.
[11] Stephen Todd,et al. The Peterlee Relational Test Vehicle - A System Overview , 1976, IBM Syst. J..
[12] Raghu Ramakrishnan,et al. Database Management Systems , 1976 .
[13] Guy M. Lohman,et al. Differential files: their application to the maintenance of large databases , 1976, TODS.
[14] Goetz Graefe,et al. Experiences building the open OODB query optimizer , 1993, SIGMOD Conference.
[15] Cyril U. Orji,et al. Write-only disk caches , 1990, SIGMOD '90.
[16] Dina Bitton,et al. Disk Shadowing , 1988, VLDB.
[17] Setrag Khoshafian,et al. A decomposition storage model , 1985, SIGMOD Conference.