三种数据分页方法的效率分析  

Efficiency Analysis of Three Kinds of Data Pagination Methods

作　　者：甘群文[1] 林颖明 

机构地区：[1]广西中医学院图书馆信息技术部,广西南宁530001 [2]广西教育厅资助办,广西南宁530021

出　　处：《现代电子技术》2009年第10期45-47,54,共4页Modern Electronics Technique

基　　金：广西科学研究与技术开发资助项目(桂科能0537027)

摘　　要：对三种存储过程分页算法的响应速度进行比较。采用WAST1.1测试工具,对每种算法分别以5个不同级别的记录数进行测试,并记下满足查询条件的记录数首页、末页的第一个字节到达客户端的时间(即TTFB)。对于小数据量,三种算法中首页、末页的TTFB相差不大;对于大数据量,算法Ⅰ和算法Ⅱ的首页、末页的TTFB相差较大,而算法Ⅲ却相差无几。在海量数据下,算法Ⅲ是三者中效率最高的分页算法。To compare the response rates of three storage process pagination algorithms. Using the WAST1. 1 test tool, testing each algorithm with five levels＇records,and taking down the Total Time to First Byte （TTFB） of first page and the last page in the records which meet the query criteria. In small data sets,there is slight difference between TTFB of the first page and the last page. In large amount data,the difference of the TTFB between the first page and the last page in algorithms I and algorithms II is big, but there is hardly any difference in algorithm III. In mass data, the algorithm III is the most efficient pagination one in the three algorithms.

关 键 词：SQL 存储过程 分页算法 测试 效率分析 

分 类 号：TP392[自动化与计算机技术—计算机应用技术]