繁體中文当前位置: 首页 > 图文教程 > 数据库 > MSSQL > TOP N 和SET ROWCOUNT N 哪个更快？
- MSSQL
- 用SQL语句实现替换字符串
- mssql查找备注(text,ntext)类型字段为空的方法
- MSSQL数据类型及长度限制详细说明
- SQL Server下几个危险的扩展存储过程
- 一些SQL Server存储过程参数及例子
- sql高级技巧几个有用的Sql语句
- SQL语句实现SQL Server 2000及Sql Server 2005日志收缩(批量)
- 用SQL建立索引的方法步骤
- MSsql每天自动备份数据库并每天自动清除log的脚本
- mssql无数据库日志文件恢复数据库的方法
- SQL Server常用管理命令小结
- SQL SERVER性能优化综述(很好的总结,不要错过哦)
- sqlserver 游标的简单示例
- sqlserver只有MDF文件恢复数据库的方法
- 在SQL Server启动时自动执行存储过程。
- 在 SQLSERVER 中快速有条件删除海量数据
- 阿拉伯数字转大写中文_财务常用sql存储过程
- SQL Server存储过程的基础说明
- 列出SQL Server中具有默认值的所有字段的语句
- 文本、Excel、Access数据导入SQL Server2000的方法
MSSQL 中的 TOP N 和SET ROWCOUNT N 哪个更快？
出处:互联网 整理: 软晨网（RuanChen.com） 发布: 2009-10-30 浏览: 55 ::
收藏到网摘: n/a
在有合适的索引的时候，Top n和set rowcount n是一样快的。但是对于一个无序堆来说，top n更快。
原理自己看英文去。
Q. Is using the TOP N clause faster than using SET ROWCOUNT N to return a specific number of rows from a query?
A. With proper indexes, the TOP N clause and SET ROWCOUNT N statement are equally fast, but with unsorted input from a heap, TOP N is faster. With unsorted input, the TOP N operator uses a small internal sorted temporary table in which it replaces only the last row. If the input is nearly sorted, the TOP N engine must delete or insert the last row only a few times. Nearly sorted means you're dealing with a heap with ordered inserts for the initial population and without many updates, deletes, forwarding pointers, and so on afterward.
A nearly sorted heap is more efficient to sort than sorting a huge table. In a test that used TOP N to sort a table with the same number of rows but with unordered inserts, TOP N was not as efficient anymore. Usually, the I/O time is the same both with an index and without; however, without an index SQL Server must do a complete table scan. Processor time and elapsed time show the efficiency of the nearly sorted heap. The I/O time is the same because SQL Server must read all the rows either way.
评论 (0) All
