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

Claire Morpain

dblp:13/3111 · DBLP profile ↗
← Back
1ranked-venue papers
1as 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 · 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%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control
consistency
0.011996
Maintaining Database Consistency in Presence of Value Dependencies in Multidatabase Systems · SIGMOD Conference 1996
Transaction processing and concurrency control › serializability
global serializability
0.011996
Maintaining Database Consistency in Presence of Value Dependencies in Multidatabase Systems · SIGMOD Conference 1996
Transaction processing and concurrency control › distributed transaction management
multidatabase transaction management
0.011996
Maintaining Database Consistency in Presence of Value Dependencies in Multidatabase Systems · SIGMOD Conference 1996

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

value dependency management · 0.0
YearPublicationVenuePosition
1996 Maintaining Database Consistency in Presence of Value Dependencies in Multidatabase Systems
abstract
The emergence of new criteria specifically adapted to multidatabase systems, in response to constraints imposed by global serializability, leads to restrictive hypotheses in order to ensure correctness of executions. This is the case with the two level serializability presented in [6], that ensures strongly correct executions if transaction programs are Local Database Preserving (LDP). The main drawback of the LDP hypothesis is that it relies on rigorous programming. The principal objective of this paper has been to suppress this drawback while conserving the strong correctness of 2LSR executions We propose defining precisely the notion of value dependencies, and managing them so as not to impose the LDP property.
Claire Morpain, Michèle Cart, Jean Ferrié, Jean-François Pons
SIGMOD Conference1