Skip to Main Content
Distributed Main Memory Database is the combination of Distributed Database and Main Memory Database. It realizes effective database operation, and meanwhile it solves the problems of Central Database such as high spending on communication, easy to become the bottleneck of the system and so on. The article studies routing algorithm of structured p2p overlay and proposes an improved routing algorithm which assures the average lookup times are not more than 2 when the overlay is steady. The improved routing algorithm and FastDB that is an open source Main Memory Database are applied to construct a Distributed Main Memory Database. The method has been improved to be effective in the end and basically it realizes load equalization.