zoukankan      html  css  js  c++  java
  • 记录之前工作用到费劲sql

    表为单独表,树结构 layer共有4层, 此sql为通过id list 查询出 layer = 2 的 id 个数

      id , parent_id, layer

    SELECT
      COUNT(DISTINCT ID) AS count
    FROM
    (
      SELECT
        DISTINCT parent_geography_id AS ID
      FROM
        core_master_db.geography
      WHERE
        (
          geography_id IN (49887, 49888, 49886, 1775, 1)
          OR
          geography_id IN

          (
            SELECT
              DISTINCT parent_geography_id
            FROM
              core_master_db.geography
            WHERE
              geography_id IN (49887, 49888, 49886, 1775, 1)
            AND

              layer = 4
          )
        )
      AND layer = 3
      UNION ALL
      SELECT
        DISTINCT geography_id AS ID
      FROM
        core_master_db.geography
      WHERE
        geography_id IN (49887, 49888, 49886, 1775, 1)
      AND
        layer = 2
    )   geography

  • 相关阅读:
    [leetCode]剑指 Offer 43. 1~n整数中1出现的次数
    [leetCode]剑指 Offer 42. 连续子数组的最大和
    HDU
    HDU
    HDU
    HDU
    HDU
    HDU
    POJ
    POJ
  • 原文地址:https://www.cnblogs.com/lixuchun/p/8708008.html
Copyright © 2011-2022 走看看