###sequnece 介绍

http://www.dba-oracle.com/t_rac_tuning_sequence_order_parameter.htm

order by 可能会影响性能,但是对确认时间戳 比较重要

order子句保证序列的下一个值是行中的下一个值,不管接收请求的实例是什么。
为了举例说明,假设一个序列定义为cache=20。实例1的缓存中有序列值1到20。实例2的缓存中有序列值21到40。
通常,并发会话可能按以下顺序生成序列值:1、2、21、3、22、4、23和24。在本例中,可以很容易地确定在哪个实例中生成了哪些值。
每个序列值都大于该实例中它前面的值。但是,当按时间顺序检查时,这些值不是按顺序排列的。

如果序列的目的是生成唯一的值,就像通常对合成主键所做的那样,那么当随着时间的推移查看这些值时,这些值跳来跳去的事实就不那么重要了。
然而,有些应用需要序列来表示时间顺序,即序列值为11的序列值发生在序列值为12的记录之前的某个时间。在这些情况下,
oracle rac应用程序必须使用order子句来保证序列的值是按顺序生成的,无论下一个值是哪个实例生成的。
下面是这样一个序列的例子。

Sequence order parameter

Worse than not caching values of a sequence in Oracle RAC is using the order clause when creating a sequence database object. For the discussion in this section, the example sequence is dropped and recreated with the order clause.

SQL> drop sequence

2     cache_example_sequence;

Sequence dropped.

SQL> create sequence

2     cache_example_sequence

3     start with 1

4     increment by 1

5     order;

Sequence created.

Many people have never seen the order clause when used in conjunction with a sequence database object. The reason why this clause is rarely used is because the clause only has relevance for Oracle RAC databases, and even then, it is normally a bad idea to use the clause, as will be shown in this section.

The order clause guarantees that the sequence's next value is the next one in line, no matter the instance that received the request. To illustrate, assume a sequence defined with cache=20. Instance 1 has sequence values 1 through 20 in its cache. Instance 2 has sequence values 21 through 40 in its cache.  Normally, concurrent sessions might generate sequence values in this order: 1, 2, 21, 3, 22, 4, 23, and 24. It can easily be determined which values were generated in which instance in this example. Each sequence value is larger than the one that preceded it only in that instance. However, when examined chronologically, the values are not in order.

If the purpose of the sequence is to generate unique values, as is often done for synthetic primary keys, the fact that the values jump around when viewed over time is of little concern. Yet some applications need the sequences to denote time ordering, i.e. a sequence value of 11 occurred some time prior to the record with the sequence value of 12. In those cases, Oracle RAC applications must use the order clause to guarantee the sequence's values are generated in order, no matter which instance the next value was generated. An example of such a sequence is seen next.

SQL> create sequence

2     example_order_seq

3     start with 1

4     increment by 1

5     cache 20

6     order;

Sequence created.

Notice in the example above that the sequence is defined with cache=20 and order. Now let's look at sessions in two instances generating some next set of values from this sequence.

SQL> select

2     instance_name,

3     example_order_seq.nextval

4  from

5     v$instance;

INSTANCE_NAME       NEXTVAL

---------------- ----------

orcl1                     1

SQL> select

2     instance_name,

3     example_order_seq.nextval

4  from

5     v$instance;

INSTANCE_NAME       NEXTVAL

---------------- ----------

orcl2                     2

SQL> select

2     instance_name,

3     example_order_seq.nextval

4  from

5  v$instance;

INSTANCE_NAME       NEXTVAL

---------------- ----------

orcl1                     3

SQL> select

2     instance_name,

3     example_order_seq.nextval

4  from

5     v$instance;

INSTANCE_NAME       NEXTVAL

---------------- ----------

orcl2                     4

Even though the sequence was denoted to cache sequence values and those values were selected from one instance, then the next and so on, the order clause ensured each subsequent value would be in numerical order. The order clause effectively makes the sequence have a nocache setting.

Similar to examining the performance of a sequence in the previous section, the performance of the sequence using the order clause can be easily determined. To do this, the sequence is dropped and then recreated.

SQL> drop sequence

2     cache_example_sequence;

Sequence dropped.

SQL> create sequence

2     cache_example_sequence

3     start with 1

4     increment by 1

5     nocache

6     order;

Sequence created.

Now that the sequence has been created, the same PL/SQL block as before is executed in two sessions connected to the two instances of the RAC cluster.

SQL> set timing on

SQL> declare

2     curr_val number;

3     cnt       number;

4  begin

5     cnt := 0;

6     while cnt <= 100000

7     loop

8        select cache_example_sequence.nextval

9           into curr_val

10        from

11           dual;

12        cnt := cnt + 1;

13     end loop;

14  end;

15  /

PL/SQL procedure successfully completed.

Elapsed: 00:18:54.95

The PL/SQL block took about 19 minutes to complete in the first instance. The same block took almost the same identical time to complete in the second instance. These results are similar to the nocache example seen previously.  The tests will be repeated for cache values of 20, 100, and 1000 as was previously performed. The following table shows the cache values and the effect with the order clause compared to the earlier tests without explicit ordering of the sequence values.

 

NOORDER

ORDER

Cache Value

Node 1

Node 2

Node 1

Node 2

None

19:59.61

20:43.22

18:54.95

18:55.34

20

00:41.19

00:49.18

01:17.34

01:19.75

100

00:10.98

00:11.57

00:33.41

00:32.45

1000

00:01.06

00:02.62

00:29.30

00:28.74

Table 3.2 Sequence Runtimes With Caching and ORDER

From the results in the table above, it is easy to see that with no caching of sequence values, the order clause had slightly better results. As the cache value increased slightly, requiring a specific order to the sequence values started to have a negative effect. Instead of running in less than fifty seconds, the order clause made the sequence run in less than eighty seconds. When the cache value was set to 100, the ordered sequence performed three times worse than with no order. Most significantly was when the caching was increased to 1000, great improvement occurred with noorder, but no improvement with order.

Next, let's examine the top wait events for one of these sessions.

SQL> @current_session_top5_waits.sql

EVENT                          TOTAL_WAITS TIME_WAITED

------------------------------ ----------- -----------

gc cr block 2-way                    66167        7710

gc cr block busy                     31606        5130

gc cr block lost                         1          28

db file sequential read                 12           1

Disk file operations I/O                 3           0

Surprisingly, the row cache lock wait event is not seen here. Instead, the top wait events are Cache Fusion related.

The Data Dictionary can be queried to easily find those sequences that are defined to order the values.

select

sequence_owner,

sequence_name

from

dba_sequences

where

order_flag='Y'

order by

sequence_owner,

sequence_name;

The query above will return a number of sequences owned by SYS and SYSTEM. With one exception that will be discussed in the next section, the database administrator should not modify the sequences that are part of the Data Dictionary.

For those sequences returned from the above query that belong to application owners, the database administrator needs to determine if the ordering of sequence values is truly necessary. If the order clause is not a business requirement, it should be removed.

In this section, a simple example showed how using the order clause quickly negates any benefits of caching sequence values. This should be no surprise as the clause serializes access to the sequence's next values across all instances. As such, the orderclause should only be used for those sequences that have specific business requirements stating that the sequence's values are to denote a time ordering. The absence of such a requirement would negate the need for the order clause. It is a good practice to use the order clause sparingly and only when completely necessary.

###sample 监控

需要监控数据库的序列,在达到最大值前,进行告警。特别是mysql,往往因为字段的定义和auto incremental的定义不同,导致各自的上限不同。

https://oracleblog.org/working-case/monitor-sequence/

Oracle:

 
 
1
2
3
4
5
6
7
8
9
10
11
SELECT
x.*,
CASE WHEN increment_by<0
THEN round(last_number/min_value*100,4)
WHEN increment_by>0
  THEN round(last_number/max_value*100,4)
ELSE 0
  END
AS percent_usage
from DBA_SEQUENCES x  WHERE cycle_flag='N'
ORDER BY percent_usage DESC;

oracle sequnece 介绍以及 监控的更多相关文章

  1. 【体系结构】Oracle参数介绍

    [体系结构]Oracle参数介绍 1  BLOG文档结构图 2  前言部分 2.1  导读和注意事项 各位技术爱好者,看完本文后,你可以掌握如下的技能,也可以学到一些其它你所不知道的知识,~O(∩_∩ ...

  2. Oracle asm介绍和安装linux+oracle10g+asm过程

    Oracle asm介绍和安装linux5.2+oracle10g+asm过程   1)ASM(自动存储管理)的来由:   ASM是Oracle 10g R2中为了简化Oracle数据库的管理而推出来 ...

  3. Oracle Dataguard 介绍

    Oracle DataGuard介绍 一. DataGuard的基本原理 当某次事务处理对生产数据库中的数据作出更改时,Oracle数据库将在一个联机重做日志文件里记录此次更改.在DataGuard中 ...

  4. Oracle 11g实时SQL监控 v$sql_monitor

    Oracle 11g实时SQL监控: 前面提到,在Oracle Database 11g中,v$session视图增加了一些新的字段,这其中包括SQL_EXEC_START和SQL_EXEC_ID, ...

  5. [Oracle] Lob介绍

    [Oracle] Lob介绍   像Oracle这种关系型数据库,比较擅长处理结构化的数据,那么对于非结构化的数据,Oracle是怎么处理和存储的呢?Lob (Large Object)是Oracle ...

  6. oracle regexp_like介绍和例子

    oracle regexp_like介绍和例子 学习了:http://www.cnblogs.com/einyboy/archive/2012/08/01/2617606.html ORACLE中的支 ...

  7. oracle如何进行索引监控分析和优化

    在生产环境.我们会发现: ① 索引表空间 I/O 非常高     ② "db file sequential read" 等待事件也比较高   这种迹象表明.整个数据库系统.索引的 ...

  8. oracle coherence介绍及使用

    网上除了官方用户指南,关于Coherence的介绍文章资料很少,因此总结出此文,从原理到快速指南和基本最佳实践,希望对需要的人提供一个参考. 1 Coherence 概述 1.1 Coherence是 ...

  9. Oracle 备份与恢复介绍

    一.Oracle备份方式分类:Oracle有两类备份方式:(1)物理备份:是将实际组成数据库的操作系统文件从一处拷贝到另一处的备份过程,通常是从磁盘到磁带.物理备份又分为冷备份.热备份:   (2)逻 ...

随机推荐

  1. HTML&CSS基础-xHtml语法规范

    HTML&CSS基础-xHtml语法规范 作者:尹正杰 版权声明:原创作品,谢绝转载!否则将追究法律责任. 一.html源码 <!DOCTYPE html> <html> ...

  2. 猿族崛起-Alpha版本发布2

    标准开头 Q A 这个作业属于哪个课程 课程链接 这个作业要求在哪里 要求 团队名称 猿族崛起 这个作业的目标 完成alpha版本未完成的功能,并进行拓展 Sname Sno 向宏力 20173106 ...

  3. web安全漏洞相关

    1,密码输入框input应该 设置:autocompete="off" 2,设置HTTPOnly,禁止客户端修改cookie 文章:Cookie中的HttpOnly详解 3,不要展 ...

  4. WPF 控件库——带有惯性的ScrollViewer*(转)

    转:https://blog.csdn.net/ahilll/article/details/82418892 一.先看看效果 二.原理 虽然效果很简单,但是网上的一些资料涉及的代码量非常可观,而且效 ...

  5. http上传下载文件

    curl_easy_setopt curl库的方式 调用 (c++中) 短连接  一次请求 一次响应

  6. 项目Beta冲刺 - 凡事预则立

    课程: 软件工程1916|W(福州大学) 作业要求: 项目Beta冲刺 团队名称: 火鸡堂 作业目标: 尽力交付 火鸡堂 队员学号 队员姓名 博客地址 备注 221600111 彼术向 http:// ...

  7. 解读 v8 排序源码

    前言 v8 是 Chrome 的 JavaScript 引擎,其中关于数组的排序完全采用了 JavaScript 实现. 排序采用的算法跟数组的长度有关,当数组长度小于等于 10 时,采用插入排序,大 ...

  8. 题解 UVa11752

    题目大意 输出所有小于 \(2^{64}-1\) 的正整数 \(n\), 使得 \(\exists p, q, a, b\in \mathbb{N+}, p\neq q\rightarrow a^p= ...

  9. IDEA-相关插件使用

    IDEA日常开发中,整理一些用到的插件,以便后续使用起来方便. 点击File-Settings->Plugins. 1.进度条-彩虹,搜索Nyan字样,如图所示(本人已安装),点击Install ...

  10. c++中二叉树的先序中序后序遍历

    c++中二叉树的先(前)序.中序.后序遍历 讲解版 首先先看一个遍历的定义(源自度娘): 所谓遍历(Traversal),是指沿着某条搜索路线,依次对树中每个结点均做一次且仅做一次访问.访问结点所做的 ...