针对高度请求的队列的Firebase优化

时间:2016-12-16 22:34:26

标签: node.js performance firebase firebase-realtime-database firebase-queue

基于firebase的游戏,其中每个用户都在相同的waitingList上推送请求,以便nodeJS服务器分别为每两个等待的玩家准备一个圆形游戏。我在nodeJS上使用Firebase JS v3:

    var ref = firebase.database().ref();

//this is where we populate rounds
var gamesRef = ref.child('games');

//users path
var usersRef = ref.child('users');

//waiting queue
var waitingRef = ref.child('waitingList');

//listen for each new queued user
waitingRef.on('child_added', function(snap){ 
  waitingRef.transaction(function(waitingList){
    if(waitingList !== null){
      var keys = Object.keys(waitingList);
      //take two players
      if(keys.length >= 2){
        //prepare a new round for users
        var round = prepareNewRound(waitingList[keys[0]], waitingList[keys[1]]);

        //remove queued users from waitingList
        waitingList.child(keys[0]).remove();
        waitingList.child(keys[1]).remove();

        //create new game
        var roundKey = gamesRef.push(round).key;

        //notify users about the new game created
        users.child(waitingList[keys[0]]).child('current_round').set(roundKey);
        users.child(waitingList[keys[1]]).child('current_round').set(roundKey);
      }
    }
  });
});

等待名单的用户高度要求可能超过10k的实时同时用户。 这种方式的执行速度比Firebase队列快,但每5分钟重复慢一点,等待列表变得越来越长,之后变得正常。 是否可以对该概念进行任何优化?

0 个答案:

没有答案