Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ruey-Long Liou

dblp:95/5611 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1996
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Transaction processing and concurrency control · 75% Data models and query languages · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control
concurrency control
0.011996
A Multi-Granularity Locking Model for Concurrency Control in Object-Oriented Database Systems · IEEE Trans. Knowl. Data Eng. 1996
Transaction processing and concurrency control › concurrency control
locking
0.011996
A Multi-Granularity Locking Model for Concurrency Control in Object-Oriented Database Systems · IEEE Trans. Knowl. Data Eng. 1996
Transaction processing and concurrency control › concurrency control › locking
multi-granularity locking
0.011996
A Multi-Granularity Locking Model for Concurrency Control in Object-Oriented Database Systems · IEEE Trans. Knowl. Data Eng. 1996
Data models and query languages
object-oriented database
0.011996
A Multi-Granularity Locking Model for Concurrency Control in Object-Oriented Database Systems · IEEE Trans. Knowl. Data Eng. 1996

Methods — techniques the papers use, named apart from their topics

dual queue scheduling · 0.0
YearPublicationVenuePosition
1996 A Multi-Granularity Locking Model for Concurrency Control in Object-Oriented Database Systems
abstract
A locking model adopting a multi-granularity approach is proposed for concurrency control in object-oriented database systems. The model is motivated by a desire to provide high concurrency and low locking overhead in accessing objects. Locking in schemas and locking in instances are developed separately and then are integrated. Schema changes and composite objects are also taken into account. A dual queue scheme for efficient scheduling of lock requests is developed. The model consists of a rich set of lock modes, a compatibility matrix, and a locking protocol. Characteristic query examples on single class, class lattice, and composite objects are used to illustrate the comparison between the ORION model and the proposed model. It is shown that our locking model has indeed made some improvements and is suitable for concurrency control in object-oriented databases.
Suh-Yin Lee, Ruey-Long Liou
IEEE Trans. Knowl. Data Eng.2