拿游戏服务器为例,每个session代表一个用户连接,常规方案中,对于世界聊天以及私聊等工作,都普遍采用遍历session集合方式,发送或者查找对应玩家的方式实现,严格意义上,其效率及对服务器性能形象并不大,但,考虑到量级以及分布式查询等,这种完全依靠遍历的方式并不合适。
以下面例子为实例对比传统遍历方式以及分层存储在存储,查询效率及性能上的对比。
package t;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Set;
import java.util.UUID;
/**
*
* @author Vicky.H
*/
public final class SetTest {
static final int maxuserid = 500000; // 游戏有50万个帐号
static final int user_online = 50000; // 实际在线5万个帐号
public static void TEST01(int id, String name,Set<User> users) {
users.add(new User(id, name));
int i = 0;
long time0 = System.currentTimeMillis();
for (User user : users) {
i++;
if (user.getId() == id) {
System.out.println("found " + i);
break;
}
}
long time1 = System.currentTimeMillis();
System.out.println(time1 - time0);
}
/**
* 查询写入时间更快,适用与分布式
* @param id
* @param name
* @param sessionManager
*/
public static void TEST02(int id, String name, SessionManager sessionManager) {
sessionManager.addUser(new User(id, name));
long time0 = System.currentTimeMillis();
sessionManager.findUser(id);
long time1 = System.currentTimeMillis();
System.out.println(time1 - time0);
}
public static void main(String args[]) {
// Set<User> users = new HashSet<User>();
// for (int i = 0; i < user_online; i++) {
// users.add(new User(i, UUID.randomUUID().toString()));
// }
// long time0 = System.currentTimeMillis();
// for (int i = 50000; i < 55000; i++) { // 60%的CPU消耗
// TEST01(i, "Vicky" ,users);
// }
// long time1 = System.currentTimeMillis();
// System.out.println("time1 - time0 = " + (time1 - time0)); // 19312 19235 19266
int prepare = 7 * 50000; // 预留7天X每天注册5万
SessionManager sessionManager = new SessionManager(maxuserid, prepare, 20);
for (int i = 0; i < user_online; i++) {
sessionManager.addUser(new User(i * 10, UUID.randomUUID().toString()));
}
long time0 = System.currentTimeMillis();
for (int i = 0; i < 5000; i++) { // 80%的CPU消耗
TEST02(i * 10, "Vicky" ,sessionManager);
}
long time1 = System.currentTimeMillis();
System.out.println("time1 - time0 = " + (time1 - time0)); // 2109 2000 1969
/*
int prepare = 7 * 50000; // 预留7天X每天注册5万
SessionManager sessionManager = new SessionManager(maxuserid, prepare, 100);
for (int i = 0; i < user_online; i++) {
sessionManager.addUser(new User(i * 10, UUID.randomUUID().toString()));
}
TEST02(33001, "Vicky", sessionManager);
TEST02(122001, "Jack", sessionManager);
TEST02(78, "Jack", sessionManager);
TEST02(272001, "Jack", sessionManager);
TEST02(392001, "Jack", sessionManager);
TEST02(422001, "Jack", sessionManager);
TEST02(49901, "Jack", sessionManager);
TEST02(149901, "Jack", sessionManager);
TEST02(249901, "Jack", sessionManager);
TEST02(349901, "Jack", sessionManager);
TEST02(449901, "Jack", sessionManager);
TEST02(429901, "Jack", sessionManager);
TEST02(419901, "Jack", sessionManager);
TEST02(309901, "Jack", sessionManager);
TEST02(254901, "Jack", sessionManager);
TEST02(123901, "Jack", sessionManager);
System.out.println("----------");
TEST02(sessionManager.getNum() - 1, "Jack", sessionManager);
TEST02(sessionManager.getNum(), "Jack", sessionManager);
TEST02(sessionManager.getNum() + 1, "Jack", sessionManager);
TEST02(sessionManager.getNum() * 20 - 1, "Jack", sessionManager);
TEST02(sessionManager.getNum() * 20, "Jack", sessionManager);
TEST02(sessionManager.getNum() * 20 + 1, "Jack", sessionManager);
TEST02(sessionManager.getNum() * 21 - 1, "Jack", sessionManager);
TEST02(sessionManager.getNum() * 21, "Jack", sessionManager);
TEST02(sessionManager.getNum() * 21 + 1, "Jack", sessionManager);
TEST02(sessionManager.getNum() * 49 - 1, "Jack", sessionManager);
TEST02(sessionManager.getNum() * 49, "Jack", sessionManager);
TEST02(sessionManager.getNum() * 49 + 1, "Jack", sessionManager);
*/
}
}
final class User {
private int id;
private String username;
public User(int id, String username) {
this.id = id;
this.username = username;
}
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getUsername() {
return username;
}
public void setUsername(String username) {
this.username = username;
}
}
class SessionManager {
private ArrayList<HashSet<User>> userss = new ArrayList<HashSet<User>>();
private int num;
/**
* @param maxuserid 数据库中最大的帐号ID
* @param prepare 预备注册数量
* @param step 分层数量
*/
public SessionManager(int maxuserid, int prepare, int step) {
for (int i = 0; i < step; i++) {
userss.add(new HashSet<User>());
}
num = (maxuserid + prepare) / step; // 总用户加上预留
}
public void addUser(User user) {
userss.get(getIndex(user)).add(user);
}
public int getIndex(User user) {
return user.getId() / num;
}
public void findUser(int id) {
int index = id / num;
System.out.println("index = " + index);
Set<User> users = userss.get(index);
int i = 0;
for (User user : users) {
i++;
if (user.getId() == id) {
System.out.println("found " + i);
break;
}
}
}
public int getNum() {
return num;
}
}
通过这样的方式,对于世界聊天等内容,也可以分层发送,虽然层次之间牺牲掉了数据的及时性,但却对网络带宽及性能上更好,并且在分布式应用中加快了查询速度。