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

Lory D. Molesky

dblp:m/LoryDMolesky · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1995
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorDatabases, 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.

Databases, data mining, and information retrieval
1 paper
Transaction processing and concurrency control · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 50% Parallel and multicore computing · 50%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control › recovery
crash recovery
0.011995
Recovery Protocols for Shared Memory Database Systems · SIGMOD Conference 1995
Transaction processing and concurrency control › distributed transaction management
multidatabase transaction management
0.011995
Recovery Protocols for Shared Memory Database Systems · SIGMOD Conference 1995
Memory systems
cache coherence
0.011995
Recovery Protocols for Shared Memory Database Systems · SIGMOD Conference 1995
Parallel and multicore computing › multiprocessor system
shared-memory multiprocessor
0.011995
Recovery Protocols for Shared Memory Database Systems · SIGMOD Conference 1995

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

crash recovery protocol · 0.0
YearPublicationVenuePosition
1995 Recovery Protocols for Shared Memory Database Systems
abstract
Significant performance advantages can be gained by implementing a database system on a cache-coherent shared memory multiprocessor. However, problems arise when failures occur. A single node (where a node refers to a processor/memory pair) crash may require a reboot of the entire shared memory system. Fortunately, shared memory multiprocessors that isolate individual node failures are currently being developed. Even with these, because of the side effects of the cache coherency protocol, a transaction executing strictly on a single node may become dependent on the validity of the memory of many nodes thereby inducing unnecessary transaction aborts. This happens when database objects, such as records, and database support structures, such as index structures and shared lock tables, are stored in shared memory. In this paper, we propose crash recovery protocols for shared memory database systems which avoid the unnecessary transaction aborts induced by the failure dependencies that occu...
Lory D. Molesky, Krithi Ramamritham
SIGMOD Conference1
1990 Predictable Synchronization Mechanisms for Multiprocessor Real-Time Systems
Lory D. Molesky, Chia Shen, Goran Zlokapa
Real Time Syst.1