This queston came up on the Oracle newsgroup a few days ago:

这个问题在Oracle的新闻中心被提出了一段时间:

I have a table (call it policy) with three columns a, b and c. The table has two rows, with column c having value zero for both rows. I run the following query

有个表(表名是Policy),有三个字段:a、b、c,这个表有两行,c列中的数据始终为0,我运行一下的sql语句

select * from policy order by c;

As both the rows have a value of zero, the result should be sorted ascending by rowid, but I see the opposite;  viz. the result set is sorted descending by rowid.

照理说,结果应该按照rowid来升序排序,但是相反的是,结果却按照rowid降序排序。

Is that an issue with the version of 10g server, I am using or is it some settings of the Oracle server?

这个是10g的问题,还是我使用的问题,或者还是设置的问题?

Various people replied to say that you should never assume any ordering beyond the order you explicitly state in the order by clause. But the question does raise a couple of interesting points.

其他的人说,最好是显式的声明排序的条件,比如rowid desc。但是这个问题引发了一个有趣的观点。

Let’s start by running the test (it’s not hard to write up a test case, so why not do so when you ask the question). The following is good enough – and I’ve appended the output of the query when running on 10.2.0.1:

当你遇到问题的时候,最好写一个测试的例子,例如下面的例子,运行在10.2.0.1上:

drop table t1;
create table t1 (a number, b number, c number); insert into t1 values(1,1,0);
insert into t1 values(1,1,0); commit; select t1.*, t1.rowid from t1 order by c; A B C ROWID
---------- ---------- ---------- ------------------
1 1 0 AAATncAAGAAABSKAAB
1 1 0 AAATncAAGAAABSKAAA

2 rows selected. Sure enough, the results are in the “wrong” order.

两行数据被查询出来,果然数据排序错误。

So what do you do next ? The first couple of ideas are: add a third, fourth and fifth row to see if the “descending order” observation is accurate; then try running the test on a different version of Oracle.

接下来你要怎么做?第一个想法是,添加第三行、第四行、第五行数据,查看“descending order”是否准确,然后运行在不同版本的oracle中。

Here’s the output from 10.2.0.1, after adding more and more rows:

下面的结果集是在10.2.0.1中添加第三行、第四行、第五行数据,并查询的结果

         A          B          C ROWID
---------- ---------- ---------- ------------------
1 1 0 AAATncAAGAAABSKAAA
1 1 0 AAATncAAGAAABSKAAC
1 1 0 AAATncAAGAAABSKAAB A B C ROWID
---------- ---------- ---------- ------------------
1 1 0 AAATncAAGAAABSKAAA
1 1 0 AAATncAAGAAABSKAAD
1 1 0 AAATncAAGAAABSKAAC
1 1 0 AAATncAAGAAABSKAAB A B C ROWID
---------- ---------- ---------- ------------------
1 1 0 AAATncAAGAAABSKAAA
1 1 0 AAATncAAGAAABSKAAB
1 1 0 AAATncAAGAAABSKAAE
1 1 0 AAATncAAGAAABSKAAD
1 1 0 AAATncAAGAAABSKAAC

The results are NOT in descending order of rowid – it just looks that way in the very first case.

结果是并没有按照rowid进行降序排序,

But here’s the output from the same test running on 9.2.0.8:

同样的测试运行在9.2.0.8:

         A          B          C ROWID
---------- ---------- ---------- ------------------
1 1 0 AAALJkAAJAAABIKAAA
1 1 0 AAALJkAAJAAABIKAAB A B C ROWID
---------- ---------- ---------- ------------------
1 1 0 AAALJkAAJAAABIKAAA
1 1 0 AAALJkAAJAAABIKAAB
1 1 0 AAALJkAAJAAABIKAAC A B C ROWID
---------- ---------- ---------- ------------------
1 1 0 AAALJkAAJAAABIKAAA
1 1 0 AAALJkAAJAAABIKAAB
1 1 0 AAALJkAAJAAABIKAAC
1 1 0 AAALJkAAJAAABIKAAD A B C ROWID
---------- ---------- ---------- ------------------
1 1 0 AAALJkAAJAAABIKAAA
1 1 0 AAALJkAAJAAABIKAAB
1 1 0 AAALJkAAJAAABIKAAC
1 1 0 AAALJkAAJAAABIKAAD
1 1 0 AAALJkAAJAAABIKAAE

So is seems more likely that there is a sorting effect (possibly accidental) on rowids in 9.2.0.8.

在9.2.0.8中,是按照rowid进行了升序排序

The Answer

Oracle introduced a new sorting algorithm (sometimes known as the Version 2 sort, which is how it is labelled in the 10032 trace) in 10.2.

答案

Oracle 10.2引入了一个新的排序算法,称为版本2。

The previous algorithm was effectively building an in-memory index on the incoming data using a balanced binary tree and seeking to the righ (i.e. optimised towards data that appeared in the correct order and keeping such data in the order of appearance - hence the apparent sorting of rowids in our example in 9i).

前面的例子有效的构建一个内存中索引输入数据使用平衡二叉树和(即优化对数据出现在正确的顺序和保持这些数据出现的顺序,明显的例子就是9i的查询结果)

The CPU and memory overheads for this algorithm are a bit fierce for large sorts, so the new algorithm does something completely different (possibly based on a variant of the heapsort, though it isn’t actually a heapsort) which is more efficient on memory and CPU. It has the side-effect though, of re-ordering incoming rows even when the data is not arriving out of order.

这个算法的cpu和内存开销有点大,所以新的算法做了一些改变。类似于堆排序的一种变体,但不是堆排序。它也有副作用,就是重新排序行

Someone who knew their sorting algorithms really well might even be able to infer the algorithm Oracle was using by extending the test case and watching the rowids re-ordering themselves as the result set grows. But I’m not going to volunteer for that task.

人们知道他们的排序算法很好,但是我不愿意做小白鼠。

If you want to disable the new sorting mechanism, there is a hidden parameter to affect it. As usual, you shouldn’t use hidden parameters without first receiving confirmation from Oracle support that you need to, but the relevant parameter is: _newsort_enabled, which defaults to true in 10g.

如果你想禁用新的排序机制,有个隐藏的参数“_newsort_enabled”,默认为true。

原文出处:http://jonathanlewis.wordpress.com/2007/06/03/sorting/

参考资料:http://blog.sina.com.cn/s/blog_6ff05a2c0100mlco.html

Oracle中排序列中值相同引发的问题(译)的更多相关文章

  1. opencv-11-中值滤波及自适应中值滤波

    开始之前 在上一篇我们实现了读取噪声图像, 然后 进行三种形式的均值滤波得到结果, 由于我们自己写的均值滤波未作边缘处理, 所以效果有一定的下降, 但是总体来说, 我们得到的结果能够说明我们的算法执行 ...

  2. oracle 序列中cache 有什么用途

    create sequence name increment by x //x为增长间隔 start with x //x为初始值 maxvalue x //x为最大值 minvalue x //x为 ...

  3. Oracle 修改序列的初始值

    Oracle 序列(Sequence)主要用于生成主键.但是,有时需要修改序列初始值(START WITH)时,好多人凭感觉认为:Alter Sequence SequenceName Start W ...

  4. oracle序列中cache和nocache

    首先我这篇博客的内容是我不知道oracle里的 cache 是什么,结果越查越多... "序列的cache通常为 20,但在需要依据序列值判断创建的先后顺序时必须是 NOCACHE" ...

  5. Oracle修改序列(Sequence)起始值问题

    Oracle 序列(Sequence)主要用于生成流水号,在应用中经常会用到,特别是作为ID值,拿来做表主键使用较多. 但是,有时需要修改序列初始值(START WITH)时,有同仁使用这个语句来修改 ...

  6. ORACLE PL/SQL 中序列(sequence)的简易使用方法介绍

    如果我是C罗 原文 ORACLE PL/SQL 中序列(sequence)的简易使用方法介绍 sequence在ORACLE中应用十分广泛,就是序列号的意思,会自动增加指定变数,如逐次增加1或者2或者 ...

  7. 快速排序 之添加复合插入排序和原始序列取中值左pivot

    quicksort中,当n小于一定值时,排序效率就比直接插入排序底了,所以,此时就不要再递归下去了,直接插入排序好了:快速的原理就是因为折半递归,所以初始pivot应该有个好一点的选择,这里在原序列左 ...

  8. 通过oracle闪回查看表中值的变更履历信息

    http://www.oracle.com/technetwork/cn/articles/week1-10gdba-093837-zhs.html 得到电影而不是图片:闪回版本查询 不需要设置,立即 ...

  9. HDU 6464.免费送气球-动态开点-权值线段树(序列中第first小至第second小的数值之和)(感觉就是只有一个状态的主席树) (“字节跳动-文远知行杯”广东工业大学第十四届程序设计竞赛)

    免费送气球 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submi ...

随机推荐

  1. 安装PIL库时提示python未注册错误(自定义python安装路径)

    import sys from _winreg import * # tweak as necessary version = sys.version[:3] installpath = sys.pr ...

  2. 源码-hadoop1.1.0-core-org.apache.hadoop

    按包的顺序类的顺序来吧,因为我不懂hadoop类的具体体系和类之间的联系,如果有一定知识积累的可以看下别人写的hadoop源码解读类的书,类似的有 http://pan.baidu.com/s/1i3 ...

  3. FileSystemWatcher触发多次Change事件的解决办法 .

    最近要用到FileSystemWatcher来监控某个目录中的文件是否发生改变,如果改变就执行相应的操作.但在开发过程中,发现FileSystemWatcher在文件创建或修改后,会触发多个Creat ...

  4. 重构9-Extract Interface(提取接口)

    我们来介绍一个常常被忽视的重构:提取接口.如果你发现多于一个类使用另外一个类的某些方法,引入接口解除这种依赖往往十分有用.该重构实现起来非常简单,并且能够享受到松耦合带来的好处. public cla ...

  5. 转: HHVM at Baidu

    评注: 一个项目迁移的问题考虑与实现使用.非常之详细. 转:http://lamp.baidu.com/2014/11/04/hhvm-in-baidu/ 在这之前我们介绍了我们为什么要迁移PHP到H ...

  6. TOP 10 BEST LINUX GAMES RELEASED IN 2016

    Gaming on Linux used to be a very rare phrase. But since the arrival of Steam on Linux, the Linux ga ...

  7. 博客不再更新,已转移到自己的小站iwenku.net

    博客不再更新,已转移到自己的小站iwenku.net,欢迎访问! 博客不再更新,已转移到自己的小站iwenku.net,欢迎访问! 博客不再更新,已转移到自己的小站iwenku.net,欢迎访问! 博 ...

  8. SVN Server导项目到本地库时提示"方法OPTIONS失败与无法连接到服务器"

    方法 OPTIONS 失败于 “https://xxxx/svn/xxxx”: 无法连接到服务器 (https://xxxx) 要留意  https 使用了443 端口,检查防火墙是否开放了该端口. ...

  9. kettle菜鸟学习笔记2----第一个kettle转换的建立及执行

    相关概念: Kettle数据清洗是采用元数据(Meta-data)驱动,以数据流的方式进行的,数据从数据源(数据库/文件等)在一系列相连的step之间依次向后流动,各个step完成对流经该step的数 ...

  10. 【Cocos2d入门教程三】HelloWorld之一目了然

    什么程序都是从HelloWorld先开始.同样Cocos2d-x我们先从HelloWorld进行下手.下面是HelloWorld的运行完成图: 建立好的Cocos游戏项目中会有两个比较常用接触的文件夹 ...