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

Andrew Deacon

dblp:39/4828 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · unresolved

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

Databases, 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 · 70% Distributed and cloud data management · 30%

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

TopicWeightPapersLastEvidence papers
Distributed and cloud data management
federated database
0.011994
Semantics-Based Multilevel Transaction Management in Federated Systems · ICDE 1994
Transaction processing and concurrency control › distributed transaction processing
global transaction scheduling
0.011994
Semantics-Based Multilevel Transaction Management in Federated Systems · ICDE 1994
Transaction processing and concurrency control › nested transactions
multilevel transactions
0.011994
Semantics-Based Multilevel Transaction Management in Federated Systems · ICDE 1994
Transaction processing and concurrency control
concurrency control
0.011994
Semantics-Based Multilevel Transaction Management in Federated Systems · ICDE 1994

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

semantics-based scheduling · 0.0multilevel nested transaction model · 0.0
YearPublicationVenuePosition
1994 Semantics-Based Multilevel Transaction Management in Federated Systems
abstract
A federated database management system (FDBMS) is a special type of distributed database system that enables existing local databases, in a heterogeneous environment, to maintain a high degree of autonomy. One of the key problems in this setting is the coexistence of local transactions and global transactions, where the latter access and manipulate data of multiple local databases. In modeling FDBMS transaction executions the authors propose a more realistic model than the traditional read/write model; in their model a local database exports high-level operations which are the only operations distributed global transactions can execute to access data in the shared local databases. Such restrictions are not unusual in practice as, for example, no airline or bank would ever permit foreign users to execute ad hoc queries against their databases for fear of compromising autonomy. The proposed architecture can be elegantly modeled using the multilevel nested transaction model for which a sound theoretical foundation exists to prove concurrent executions correct. A multilevel scheduler that is able to exploit the semantics of exported operations can significantly increase concurrency by ignoring pseudo conflicts. A practical scheduling mechanism for FDBMSs is described that offers the potential for greater performance and more flexibility than previous approaches based on the read/write model.>
Andrew Deacon, Hans-Jörg Schek, Gerhard Weikum
ICDE1