1. 毕业设计(论文)的内容和要求
1、毕业设计内容: 如今,对于一些关系简单,但读写频繁的数据存储,例如:弹幕、评论、点赞等,使用大型关系型数据库或是noSQL已经不再合适,随即产生对高性能的分布式kv数据库的需求。
目前,为满足上述需求,大部分厂商都采用自研的kv数据库,但开源项目极少,且通用性差。
本课题将开发一个高性能、高可用的分布式键值对数据库,支持多种存储引擎,支持强一致性策略保证数据一致性,支持水平扩容,在线升级,且支持set/get/delete/scan几种常见操作。
2. 参考文献
[1] A. Acharya, M. Uysal, and J. Saltz. Active disks: Programming model, algorithms and evalaution. In Proc. of the 8th Conference on Architectural Support for Programming Languages and Operating Systems, October 1998.[2] A. Adya, W. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. Douceur, J. Howell, J. Lorch, M. Theimer, and R. Wattenhofer. Farsite: Federated, available, and reliable storage for an incompletely trusted environment. In Proc. of OSDI, 2002.[3] T. Anderson, L. Peterson, S. Shenker, and J. Turner. Overcoming the Internet impasse through virtualization. IEEE Computer, 38(4), April 2005.[4] A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: Supporting scalable multi-attribute range queries. In Proc. of SIGCOMM, 2004.[5] E. Sit and R. Morris. Security considerations for peer-to-peer distributed hash tables. In Proc. of IPTPS, 2002.[6] V. Ramasubramanian and E. G. Sirer. Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays. In Proc. of NSDI, Berkeley, CA, USA, 2004. USENIX Association.[7] H. V. Madhyastha, T. Isdal, M. Piatek, C. Dixon, T. Anderson, A. Krishnamurthy, and A. Venkataramani. iPlane: An Information Plane for Distributed Services. In OSDI, 2006.[8] N. A. Lynch, D. Malkhi, and D. Ratajczak. Atomic Data Access in Distributed Hash Tables. In Proc. of IPTPS, 2001.[9] K. Hildrum and J. Kubiatowicz. Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-peer Networks. In Proc. of International Symposium on Distributed Computing, 2004.[10] 盖九宇,张忠能,肖鹤.分布式数据库数据复制技术的分析与应用[J].计算机应用与软件,2005,7:36-38.[11] 丁鲲,严浩,刁兴春.分布式数据库数据同步技术研究[J].海军工程大学学报,2004,5:100-104.[12] 胡枫,陶世群.一种分布式数据库多元连接查询优化算法及改进[J].计算机工程与应用,2001,16:125-127.
以上是毕业论文任务书,课题毕业论文、开题报告、外文翻译、程序设计、图纸设计等资料可联系客服协助查找。