Abstract | ||
---|---|---|
This paper presents a locking-based concurrency control dealing with three important issues in object-oriented databases: semantics of methods, nested method invocation and referentially shared object. In the proposed scheme, locks are required for the execution of methods instead of atomic operations. This can reduce the locking overhead and deadlocks due to lock escalation. Also, a way of automating commutativity of methods is provided. In addition, concurrency is increased further by use of run-time information. A performance study is conducted by means of simulation using 007 benchmark. Through the simulation, the proposed technique is then compared with the two existing techniques. The performance studies show that the proposed scheme is superior to existing works. |
Year | DOI | Venue |
---|---|---|
2000 | 10.1016/S0950-5849(00)00104-X | Information and Software Technology |
Keywords | Field | DocType |
Object-oriented database,Concurrency Control,Simulation | Timestamp-based concurrency control,Isolation (database systems),Concurrency control,Concurrency,Lock (computer science),Computer science,Multiversion concurrency control,Distributed concurrency control,Non-lock concurrency control,Distributed computing | Journal |
Volume | Issue | ISSN |
42 | 8 | 0950-5849 |
Citations | PageRank | References |
2 | 0.42 | 1 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Woochun Jun | 1 | 94 | 34.28 |