TOPN和SETROWCOUNTN哪个更快？_PHP教程

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了TOPN和SETROWCOUNTN哪个更快？_PHP教程，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1515字，纯文字阅读大概需要3分钟。

内容图文

懒得翻译了，大意：
在有合适的索引的时候，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.

http://www.bkjia.com/PHPjc/631148.htmlwww.bkjia.comtruehttp://www.bkjia.com/PHPjc/631148.htmlTechArticle懒得翻译了，大意： 在有合适的索引的时候，Top n和set rowcount n是一样快的。但是对于一个无序堆来说，top n更快。 原理自己看英文去。 Q...

内容总结

以上是互联网集市为您收集整理的TOPN和SETROWCOUNTN哪个更快？_PHP教程全部内容，希望文章能够帮你解决TOPN和SETROWCOUNTN哪个更快？_PHP教程所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端

---