Very large database systems require distributed storage, which means that they need distributed search structures for fast and efficient access to the data. In this paper, we present an approach to maintaining distributed data structures that uses lazy updates, which take advantage of the semantics

between the two seemingly incomparable frameworks. We define a new operation ffl as a variant of the standard update that we call lazy update. We prove the correspondence between lazy updates and (transitively relational, well behaved) AGM revisions when a given fixed theory is considered (Theorem 3

serialization bottlenecks. Designing distributed and replicated search structures is made difficult by the complex interaction of the search structure concurrency control and the replica coherency algorithms. In this paper, we present an approach to maintaining distributed data structures that uses lazy updates

algorithm that performs lazy updates to the parameter vector and show that its performance is competitive with reasonable strategies which have the benefit of hindsight. We demonstrate the effectiveness of our algorithm in the online portfolio selection domain where a trader has to pay proportional

of the traditional B+-tree algorithm. In this paper, we propose a new indexing method, called lazy-update B+-tree, to overcome the limitations of flash memory. The basic idea is to defer the time of committing update requests to the B+-tree by buffering them in a segment of main memory. They are later committed

Lazy update protocols have proven to have an undesirable behavior in respect to the abortion rate in scenarios with high degree of access conflicts. In this paper, we present the problem of the abortion rate in such protocols from the statistical perspective, in order to provide an expression

Abstract Lazy update protocols have proven to have an undesirable behavior in respect to theabortion rate in scenarios with high degree of access conflicts. In this paper, we present the problem of the abortion rate in such protocols from the statistical perspective, inorder to provide

With the rapid advances of wireless communications and positioning techniques, tracking the positions of moving objects is becoming increasingly feasible and necessary. Traditional spatial index structures are not suitable for storing these positions because of numerous update operations. To reduce

related to frequent location updates from moving objects often results in poor performance. The most advanced existing techniques use the concept of simple geometric safe regions to delay or avoid location updates. We introduce a Partition-based Lazy Update (PLU) algorithm that elevates this idea further

Current object database management systems support user-defined conversion functions to update the database once the schema has been modified. In this paper, we show that the database state after the execution of conversion functions implemented as an immediate database transformation does