Transaction log

We formulate a dynamic discrete-continuous choice model (DDCCM) of car ownership, usage and fuel type. The framework embeds a discrete-continuous choice model (DCCM) into a dynamic programming (DP) framework to account for the forward-looking behavior of households in the context of car acquisition. More specifically, we model the of transaction type, the choice of fuel type, the ownership status (private versus company car), the choice of car state (new versus secondhand) and the annual driving distance fo

2013

A dynamic discrete-continuous choice model of car ownership, usage and fuel type

2013

Modeling car ownership and usage: a dynamic discrete-continuous choice modeling approach

In this research we specify a dynamic discrete-continuous choice model (DDCCM) of car ownership and usage. This model embeds a discrete-continuous choice model into a dynamic programming (DP) framework. The DDCCM allows to jointly model the transaction type, the annual driving distance, the fuel type, the car ownership status and the car state (i.e. the purchase of a new or second-hand car) relative to each car in a households fleet. Moreover we model these decisions at the household level and for up to two

2013

Modeling car ownership and usage: a dynamic discrete-continuous choice modeling approach

2013

Theory of Transactional Memory

Transactional memory (TM) is a promising paradigm for concurrent programming, in which threads of an application communicate, and synchronize their actions, via inmemory transactions. Each transaction can perform any number of operations on shared data, an ...

EPFL2010

How Live Can a Transactional Memory Be?

Rodrigo Malta Schmidt, Fernando Pedone

This paper asks how much liveness a transactional memory (TM) implementation can guarantee. We first devise a formal framework for reasoning about liveness properties of TMs. Then, we prove that the strongest liveness property that a TM can ensure in an asynchronous system with transaction crashes is a property that we call "global progress". This property is analogous to lock-freedom for shared-memory objects and is indeed guaranteed by certain TM implementations, e.g., OSTM. We also prove that the presenc

2009

Toward a Theory of Input Acceptance for Transactional Memories

As opposed to database transactional systems, transactional memory (TM) systems are constrained by real-time while treating their input workload. Nevertheless, there is no clear formalization of how a TM should react regarding to a specific input. While TM performance is often measured in terms of throughput, i.e., commit-rate (by time unit), we consider the commit-abort ratio of a TM for a given input, as the number of transactions this TM commits over the total number of input transactions. Building onto

2008

Consistent Main-Memory Database Federations under Deferred Disk Writes

Current cluster architectures provide the ideal environment to run federations of main-memory database systems (FMMDBs). In FMMDBs, data resides in the main memory of the federation servers. FMMDBs significantly improve performance by avoiding I/O during the execution of read operations. To maximize the performance of update transactions as well, some applications recur to deferred disk writes. This means that update transactions commit before their modifications are written on stable storage and durability

2005

Consistent Main-Memory Database Federations under Deferred Disk Writes

2005

The Database State Machine Approach

Rachid Guerraoui, Martin Odersky

Database replication protocols have historically been built on top of distributed database systems, and have consequently been designed and implemented using distributed transactional mechanisms, such as atomic commitment. We present the Database State Machine approach, a new way to deal with database replication in a cluster of servers. This approach relies on a powerful atomic broadcast primitive to propagate transactions between database servers, and alleviates the need for atomic commitment. Transaction

2003

An Equational Theory for Transactions

Martin Odersky

Transactions are commonly described as being ACID: All-or-nothing, Consistent, Isolated and Durable. However, although these words convey a powerful intuition, the ACID properties have never been given a precise semantics in a way that disentangles each property from the others. Among the benefits of such a semantics would be the ability to trade-off the value of a property against the cost of its implementation. This paper gives a sound equational semantics for the transaction properties. We define three c

2003

An Equational Theory for Transactions

2003

Implementing E-transactions with asynchronous replication

André Schiper, Fernando Pedone

An e-Transaction is one that executes exactly-once despite failures. This paper describes a distributed protocol that implements the abstraction of e-Transactionsin three-tier architectures. Three-tier architectures are typically Internet-oriented architectures, where the end-user interacts with front-end clients (e.g., browsers) that invoke middle-tier application servers (e.g., web servers) to access back-end databases. We implement the e-Transaction abstraction using an asynchronous replication scheme th

2001

A Systematic Classification of Replicated Database Protocols based on Atomic Broadcast

Database replication protocols based on group communication primitives have recently emerged as a promising technology to improve database fault-tolerance and performance. Roughly speaking, this approach consists in exploiting the order and atomicity properties provided by group communication primitives or, more specifically atomic broadcast, to guarantee transaction properties. This paper proposes a systematic classification of non voting database replication algorithms based on atomic broadcast.

1999

The Database State Machine Approach

Database replication protocols have historically been built on top of distributed database systems, and have consequently been designed and implemented using distributed transactional mechanisms, such as atomic commitment. We present the database state machine approach, a new way to deal with database replication in a cluster of servers. This approach relies on a powerful atomic broadcast primitive to propagate transactions between database servers, and no atomic commitment is necessary. Transaction commit

1999

The database state machine and group communication issues

Fernando Pedone

Distributed computing is reshaping the way people think about and do daily life activities. On-line ticket reservation, electronic commerce, and telebanking are examples of services that would be hardly imaginable without distributed computing. Nevertheless, widespread use of computers has some implications. As we become more depend on computers, computer malfunction increases in importance. Until recently, discussions about fault tolerant computer systems were restricted to very specific contexts, but this

EPFL1999

Database Integration: an Overview of Issues and Approaches

Stefano Spaccapietra

In many large companies the widespread usage of computers has led a number of different application-specific databases to be installed. As company structures evolve, boundaries between departments move, creating new business units. Their new applications will use existing data from various data stores, rather than new data entering the organization. Henceforth, the ability to make data stores interoperable becomes a crucial factor for the development of new information systems. Data interoperability may com

1998

On Spatial Database Integration

Stefano Spaccapietra

This paper investigates the problems that arise when application requirements command that autonomous spatial databases be integrated into a federated one. The paper focuses on the most critical issues raised by the integration of databases of different scales. A short presentation of approaches to interoperability and of the main steps composing the integration process is given first. Next, a general format is proposed for precisely defining correspondences between objects of two databases. The format can

1998

Transaction Reordering in Replicated Databases

Transaction Reordering in Replicated Databases F.Pedone, R.Guerraoui and A.Schiper This paper presents a fault-tolerant lazy replication protocol that ensures 1-copy serializability at a relatively low cost. Unlike eager replication approaches, our protocol enables local transaction execution and does not lead to any deadlock situation. Compared to previous lazy replication approaches, we significantly reduce the abort rate of transactions and we do not require any reconciliation procedure. Our protocol fir

1997

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Related publications (20)

Accounting for expectations about the future: a dynamic discrete-continuous choice model (DDCCM) of car ownership, usage and fuel type

2013

A dynamic discrete-continuous choice model of car ownership, usage and fuel type

2013

A dynamic discrete-continuous choice model of car ownership, usage and fuel type

2013

Modeling car ownership and usage: a dynamic discrete-continuous choice modeling approach

2013

Modeling car ownership and usage: a dynamic discrete-continuous choice modeling approach

2013

Theory of Transactional Memory

EPFL2010

How Live Can a Transactional Memory Be?

Rodrigo Malta Schmidt, Fernando Pedone

2009

Toward a Theory of Input Acceptance for Transactional Memories

2008

Consistent Main-Memory Database Federations under Deferred Disk Writes

2005

Consistent Main-Memory Database Federations under Deferred Disk Writes

2005

The Database State Machine Approach

Rachid Guerraoui, Martin Odersky

2003

An Equational Theory for Transactions

Martin Odersky

2003

An Equational Theory for Transactions

2003

Implementing E-transactions with asynchronous replication

André Schiper, Fernando Pedone

2001

A Systematic Classification of Replicated Database Protocols based on Atomic Broadcast

1999

The Database State Machine Approach