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.

Dean S. Thompson

dblp:57/3190 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1987
—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.

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

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control › recovery
transaction recovery
0.011987
Distributed Logging for Transaction Processing · SIGMOD Conference 1987
Distributed systems
fault tolerance
0.011987
Distributed Logging for Transaction Processing · SIGMOD Conference 1987
Storage systems
non-volatile memory storage
0.011987
Distributed Logging for Transaction Processing · SIGMOD Conference 1987
YearPublicationVenuePosition
1987 Distributed Logging for Transaction Processing
abstract
Increased interest in using workstations and small processors for distributed transaction processing raises the question of how to implement the logs needed for transaction recovery. Although logs can be implemented with data written to duplexed disks on each processing node, this paper argues there are advantages if log data is written to multiple log server nodes. A simple analysis of expected logging loads leads to the conclusion that a high performance, microprocessor based processing node can support a log server if it uses efficient communication protocols and low latency, non volatile storage to buffer log data. The buffer is needed to reduce the processing time per log record and to increase throughput to the logging disk. An interface to the log servers using simple, robust, and efficient protocols is presented. Also described are the disk data structures that the log servers use. This paper concludes with a brief discussion of remaining design issues, the status of a prototype implementation, and plans for its completion.
Dean S. Daniels, Alfred Z. Spector, Dean S. Thompson
SIGMOD Conference3