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.

Vladimir Lanin

dblp:89/333 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1989
—ORCID · none

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

Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1 · 1 first-author

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Databases, data mining, and information retrieval
2 papers
Transaction processing and concurrency control · 100%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control
concurrency control
0.021989
Concurrent Set Manipulation without Locking · PODS 1988
On Distributing JASMIN's Optimistic Multiversioning Page Manager · IEEE Trans. Software Eng. 1989
Distributed systems
distributed database
0.011989
On Distributing JASMIN's Optimistic Multiversioning Page Manager · IEEE Trans. Software Eng. 1989
Distributed systems › distributed database
distributed transactions
0.011989
On Distributing JASMIN's Optimistic Multiversioning Page Manager · IEEE Trans. Software Eng. 1989
Distributed systems › concurrency control
multi-version concurrency control
0.011989
On Distributing JASMIN's Optimistic Multiversioning Page Manager · IEEE Trans. Software Eng. 1989
Distributed systems › concurrency control
optimistic concurrency control
0.011989
On Distributing JASMIN's Optimistic Multiversioning Page Manager · IEEE Trans. Software Eng. 1989
Transaction processing and concurrency control › synchronization
lock-free algorithms
0.011988
Concurrent Set Manipulation without Locking · PODS 1988
Transaction processing and concurrency control
serializability
0.011988
Concurrent Set Manipulation without Locking · PODS 1988
Transaction processing and concurrency control › concurrency control
optimistic concurrency control
0.011989
On Distributing JASMIN's Optimistic Multiversioning Page Manager · IEEE Trans. Software Eng. 1989

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

process cloning · 0.0message passing · 0.0atomic read-modify-write · 0.0
YearPublicationVenuePosition
1989 On Distributing JASMIN's Optimistic Multiversioning Page Manager
abstract
JASMIN is a functionally distributed database system running on multiple microcomputers that communicate with each other by message passing. The software modules in JASMIN can be cloned and distributed across computer boundaries. One important module is the intelligent store, a page manager that includes transaction-management facilities. It provides an optimistic, multiversioning concurrency control scheme. This scheme allows read-only transactions to run almost without conflict checking; this is important in some real-time database applications like telephone switching and routing services. The initial implementation of the intelligent store deals with centralized database only. Experiences in modifying the JASMIN intelligent store module to handle distributed databases are described. Design principles and system implementation techniques in the following areas are explored; process structure, data structures and synchronization on data structures. The process structure is aimed to provide high throughput and the data structures are designed to facilitate fast response time.>
Ming-Yee Lai, Kevin Wilkinson, Vladimir Lanin
IEEE Trans. Software Eng.3
1988 Concurrent Set Manipulation without Locking
abstract
Set manipulation consists of the actions insert, delete, and member on keys. We propose a concurrent set manipulation algorithm that uses no locking at all and requires no aborts, relying instead on atomic read-modify-write operations on single (data) locations. The algorithm satisfies order-preserving serializability through conditions that are strictly looser than existing algorithms
Vladimir Lanin, Dennis E. Shasha
PODS1