DROP VIEW DMS.V_AQ_INSURANCECLAIMS;
CREATE VIEW DMS.V_AQ_INSURANCECLAIMS AS
SELECT * FROM (SELECT
T1.FRAMENO AS 车架号,
T1.LICENSENO AS 车牌号,
T10.CARMODELNAME AS 车型,
T7.CUSTOMERNAME AS 客户名称,
T7.MOBILEPHONE AS 联系电话,
T1.REPAIRNO AS 作业单号,
--维修类型
VARCHAR(T11.DELIVEREDDATE) AS 交车日期,
T3.COMMONNAME AS 保险公司,
VARCHAR(T1.FIXEDDATE) AS 定损日期,
T6.FULLNAME AS 理赔顾问,
T9.COMMONNAME AS 事故类型,
CASE WHEN T1.ISPROXY = 'Y' THEN '是' WHEN T1.ISPROXY = 'N' THEN '否' END AS 是否代交案,
T1.WORKFEE AS 工时定损金额,
T1.PARTFEE AS 配件定损金额,
T1.OTHERFEE AS 其他定损金额,
T1.TOTALFEE AS 定损金额合计,
VARCHAR(T1.SUBMITDATE) AS 交案时间,
T1.NOTE AS 备注 FROM RT_INSURANCECLAIMS T1
LEFT JOIN CM_COMMONCODE T2 ON T1.STATUS = T2.COMMONCODE AND T2.CODETYPE = 'CR29'
LEFT JOIN CM_COMMONCODE T3 ON T1.COMPANYCODE = T3.COMMONCODE AND T3.CODETYPE = 'CC12'
LEFT JOIN CM_STAFF T6 ON T1.CLAIMSID = T6.STAFFPKID
LEFT JOIN UM_CUSTOMER T7 ON T1.CUSTOMERNO = T7.CUSTOMERCODE
LEFT JOIN VM_CARINFO T8 ON T1.FRAMENO = T8.FRAMENO
LEFT JOIN VM_CARMODEL T10 ON T8.CARMODELPKID = T10.CARMODELPKID
LEFT JOIN CM_COMMONCODE T9 ON T1.ACCIDENTTYPE = T9.COMMONCODE AND T9.CODETYPE = 'CR42'
LEFT JOIN RT_REPAIRPROCESS T11 ON T1.REPAIRNO = T11.REPAIRNO ) T

最新文章

  1. .net中xml文件的导入使用(包括创建xml和导入xml)
  2. strcpy 库函数 拷贝函数
  3. Tips For Your Maya Plugin Development
  4. 解决Windows Server2008 R2中IE开网页时弹出阻止框(Windows Server2008网页无法打开的问题)
  5. cocos2dx-3.x 导出自定义类到 lua 过程详解
  6. ReactiveCocoa 和 MVVM 入门 (转)
  7. 设置结点的ID为固定ID
  8. js split str.split(" "); split使用方法 在某处截字符串
  9. .NET多线程同步方法详解
  10. 界面信息获取库的封装,记有爱UI助手的诞生
  11. DataTable 无法转换的错误
  12. go语言 strconv.ParseInt 的例子
  13. swift设置textfield边框颜色
  14. TOMCAT 优化设置
  15. Hibernate配置过程可能发生的问题及解决方法
  16. 五:用JAVA写一个阿里云VPC Open API调用程序
  17. java各种数据类型的数组元素的默认值
  18. Day047--JS BOM介绍, jQuery介绍和使用
  19. Ionic 2.0 相关资料
  20. leetcode56:合并区间

热门文章

  1. hdu 5146 Sequence
  2. iOS学习之UIScrollView
  3. 条款38:通过聚合设计has-a或者is-implemented-in-terms-of
  4. php捕获网络页面
  5. 以Lockbits的方式访问bitmap
  6. mysql 创建一个用户,指定一个数据库
  7. Objective-C面向对象(三)
  8. Taxes
  9. 【Python】Eclipse和pydev搭建Python开发环境
  10. HDU 2196 求树上所有点能到达的最远距离