zoukankan      html  css  js  c++  java
  • 利用缓存技术解决访问统计数据库压力

     cacheVisit cv=new cacheVisit();
                        cv.sysno=sysno;
                        cv.reurl=reurl;
                        cv.ip=GetIpV4AndV6();
                        cv.moduleclass=moduleclass;

                        if (Cache["YddVisit"] == null)
                        {
                            List<cacheVisit> cvs = new List<cacheVisit>();
                            cvs.Add(cv);
                            Cache.Insert("YddVisit", cvs);
                        }
                        else
                        {
                            List<cacheVisit> cvs = (List<cacheVisit>)Cache["YddVisit"];
                            if (cvs.Count < 10)
                            {

                                cvs.Add(cv);
                                Cache.Insert("YddVisit", cvs);
                            }
                            else
                            {
                                List<cacheVisit> cvs2 = (List<cacheVisit>)Cache["YddVisit"];

                                foreach (cacheVisit cvf in cvs2)
                                {
                                    if (cvf.reurl == "")
                                        EC.Biz.ICBC.ICBC_Product_DailyClickManager.GetInstance().Add(cvf.sysno, "", cvf.ip, cvf.moduleclass);
                                    else
                                        EC.Biz.ICBC.ICBC_Product_DailyClickManager.GetInstance().Add(cvf.sysno, cvf.reurl, cvf.ip, cvf.moduleclass);
                                }

                                Cache.Remove("YddVisit");
                            }
                        }

    每当有10条时统一更新到数据库,实际应该是拼SQL一次执行比较好些!

  • 相关阅读:
    java 基础语法 2
    hdu4570Multi-bit Trie
    poj1244Slots of Fun
    二维凸包模板
    花神的数论题(数位dp)
    poj1113Wall(凸包)
    poj1066Treasure Hunt(线段相交)
    poj1039Pipe(直线交点、叉积)
    hdu4588Count The Carries
    hdu2475Box(splay树形转线性)
  • 原文地址:https://www.cnblogs.com/assion/p/1453613.html
Copyright © 2011-2022 走看看