首页
学习
活动
专区
工具
TVP
发布
精选内容/技术社群/优惠产品,尽在小程序
立即前往
  • 您找到你想要的搜索结果了吗?
    是的
    没有找到

    从trc查找死锁的问题

    *** 2013-09-29 01:03:47.762 *** SERVICE NAME:(SYS$USERS) 2013-09-29 01:03:47.744 *** SESSION ID:(997.178) 2013-09-29 01:03:47.744 DEADLOCK DETECTED ( ORA-00060 ) [Transaction Deadlock] The following deadlock is not an ORACLE error. It is a deadlock due to user error in the design of an application or from issuing incorrect ad-hoc SQL. The following information may aid in determining the deadlock: Deadlock graph:                        ---------Blocker(s)--------  ---------Waiter(s)--------- Resource Name          process session holds waits  process session holds waits TX-005d002f-000046dd       113     997     X            182     786           X TX-004d0026-00009b4e       182     786     X            113     997           X session 997: DID 0001-0071-00000006 session 786: DID 0001-00B6-0000064E session 786: DID 0001-00B6-0000064E session 997: DID 0001-0071-00000006 Rows waited on: Session 786: obj - rowid = 0002D33A - AAAtM6AAdAAAJ9BABO   (dictionary objn - 185146, file - 29, block - 40769, slot - 78) Session 997: obj - rowid = 000527D6 - AABSfWAAdAACmKAAAe   (dictionary objn - 337878, file - 29, block - 680576, slot - 30) Information on the OTHER waiting sessions: Session 786:   pid=182 serial=10783 audsid=64898626 user: 96/GALT   O/S info: user: batch, term: , ospid: 23674, machine: v490c1-app             program: sqlplus@v490c1-app (TNS V1-V3)   application name: SQL*Plus, hash value=3669949024   Current SQL Statement:   DELETE FROM ANA A WHERE EXISTS (SELECT 1 FROM (SELECT LOCATOR_ID FROM (SELECT T.LOCATOR_ID,ROWNUM RN FROM TEMP T ) WHERE RN > :B2 AND RN <= :B1 ) B WHERE A.LOCATOR_ID = B.LOCATOR_ID) End of information on OTHER waiting sessions. Current SQL statement for this session: update ana_seg set    SEGMENT_ID = :1, SEAT_STATUS = :2, SEGMENT_CLASS = :3, SEGMENT_SHARE_CLASS = :4, SEG_SEAT_NO = :5, SEG_CREATION_NUM= :6, SEG_CREATION_TIME = :7 where locator_id = :8 and SEG_ORDER_ID = :9

    02

    怎么提高开车技术_全日行车计划

    现在有n个城市,每个城市有它的高度 Hi H_i,保证每个 Hi H_i互不相同。我们定义两个城市之间的距离 disi,j=|Hi−Hj| dis_{i,j}=|H_i-H_j|,并且只能从编号小的城市去到编号大的城市。现在有两个人,小A和小B要开车(雾)去旅行。小A先开一天,小B再开一天。每一天都可以从一个开到另一个城市。小A会选择去离当前城市第二近的城市,小B会选择去离当前城市最近的那个城市。如果他们行驶的总路程将会超过给定的X就会不继续开车(∩_∩),结束旅行。求: 1:给定一个X,求从哪一个城市出发,小A行驶的路程/小B行驶的路程最小。(认为一个数/0=∞)。若有多个城市相等,选择高度最高的那个。 2:给出m个询问,每次询问从S出发,限制为X,小A走的路程和小B走的路程。

    02
    领券