PM_LOG
/**查询所有网元的所有粒度**/
SELECT
EMS_PM_LOG_ID,
SUBNET_ID,
AMOID,
NE_TYPE,
PO_ID,
PO_TABLE,
GP_BEGIN_TIME,
LOG_TYPE,
MIN(LOG_TIME) MIN_END_TIME,
LOG_TIME,
MAX(LOG_TIME) MAX_END_TIME,
TIMESTAMPDIFF(MINUTE,GP_BEGIN_TIME,MAX(LOG_TIME))-15 DELAY_TIME,
COUNT(*) num
FROM
EMS_PM_LOG
GROUP BY
AMOID,
GP_BEGIN_TIME,
LOG_TYPE
ORDER BY
GP_BEGIN_TIME,AMOID DESC; /**查询一个网元的所有粒度**/
SELECT
AMOID,
GP_BEGIN_TIME,
LOG_TYPE,
MIN(LOG_TIME) min_end_time,
MAX(LOG_TIME) max_end_time,
COUNT(*) num
FROM
EMS_PM_LOG
WHERE
AMOID = 'iw5y99gk-3'
AND LOG_TYPE = 'download'
GROUP BY
AMOID,
GP_BEGIN_TIME; /**查询一个粒度的所有网元**/
SELECT
AMOID,
GP_BEGIN_TIME,
LOG_TYPE,
MIN(LOG_TIME) min_end_time,
MAX(LOG_TIME) max_end_time
FROM
EMS_PM_LOG
WHERE
LOG_TYPE = 'transform'
AND GP_BEGIN_TIME = '2017-02-13 09:15:00'
GROUP BY
AMOID; /*查询一个网元,一个粒度*****/
SELECT
AMOID,
GP_BEGIN_TIME,
LOG_TIME
FROM
EMS_PM_LOG
WHERE
AMOID = 'iw5y99gk-3'
AND LOG_TYPE = 'download'
AND GP_BEGIN_TIME = '2017-02-13 09:15:00'
ORDER BY
LOG_TIME DESC; SELECT
AMOID,
GP_BEGIN_TIME,
LOG_TIME
FROM
EMS_PM_LOG
WHERE
AMOID = 'iwbodzuq-2'
AND LOG_TYPE = 'transform'
AND GP_BEGIN_TIME = '2017-02-13 09:15:00'
ORDER BY
LOG_TIME DESC; SELECT
AMOID,
GP_BEGIN_TIME,
LOG_TIME
FROM
EMS_PM_LOG
WHERE
AMOID = 'iwbodzuq-2'
AND LOG_TYPE = 'transform'
AND GP_BEGIN_TIME = '2017-02-13 09:15:00'
ORDER BY
LOG_TIME DESC; ###-- 某个LOG_TYPE【download、transform、create zdc】相对于粒度结束时间的入库延迟,单位是秒
SELECT
EMS_PM_LOG_ID,
SUBNET_ID,
NE_TYPE,
PO_ID,
PO_TABLE,
LOG_TYPE,
AMOID,
GP_BEGIN_TIME,
LOG_TIME,
MAX(LOG_TIME) MAX_END_TIME,
TIMESTAMPDIFF(
MINUTE,
GP_BEGIN_TIME,
MAX(LOG_TIME)
) - 15 PM_STORAGE_DELAY_TIME
FROM
EMS_PM_LOG
WHERE
1 = 1
GROUP BY
AMOID,
GP_BEGIN_TIME,
LOG_TYPE
ORDER BY
PM_STORAGE_DELAY_TIME DESC;
PM_LOG的更多相关文章
随机推荐
- RocketMQ logback使用实践
logback_broker.xml <?xml version="1.0" encoding="UTF-8"?> <!-- Licensed ...
- postgresql共享内存的三个结构体
本文原创为freas_1990,转载请标明出处:http://blog.csdn.net/freas_1990/article/details/16105797 postgresql的共享内存维护主要 ...
- Unique Binary Search Trees leetcode java
题目: Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For e ...
- 探索Javascript异步编程
异步编程带来的问题在客户端Javascript中并不明显,但随着服务器端Javascript越来越广的被使用,大量的异步IO操作使得该问题变得明显.许多不同的方法都可以解决这个问题,本文讨论了一些方法 ...
- Double-Array Trie分词词典简述
http://www.xuebuyuan.com/1991441.html 一.TRIE树简介(以下简称T树) TRIE树用于确定词条的快速检索,对于给定的一个字符串a1,a2,a3,…an,则采用T ...
- JAVA-jar包下载地址
spring mvc常用jar包 commons-logging:http://commons.apache.org/proper/commons-logging/download_logging.c ...
- rpcserver不可用
今天用打印机.电脑一直弹出rpcserver不可用.如图: 解决的方法:将例如以下服务启动就可以解决,如图:
- GLFW_KEY_KP_ADD和GLFW_KEY_KP_SUBTRACT
这两个键的代码分别为: GLFW_KEY_KP_ADD(334) GLFW_KEY_KP_SUBTRACT(333) 对应的是键盘右侧数字面板上的+ -键.
- [Algorithm] Powerset Problem
By given an array [1,2,3]: Return all possible combinations. for example: [[], [1], [2], [3], [1, 2] ...
- ZH奶酪:利用CSS将checkbox选项放大
在Hybrid App开发过程中,html中默认的checkbox选项在手机屏幕上显得比较小,app不能像web page那样放大缩小,所以要通过CSS将checkbox选项放大: 例如HTML代码: ...