Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
270
Lazy Updates for Distributed Search Structures
- In SIGMOD
, 1993
"... 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 ..."
Abstract
-
Cited by 35 (1 self)
- Add to MetaCart
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
Iterated Revision in the Spirit of Update: A Lazy Update
, 1999
"... Since they were introduced, AGM revision and Katsuno and Mendelzon's update have been considered orthogonal theory change operations serving different purposes. This work provides a new presentation of AGM revision based on the update semantic apparatus establishing in such a way a bridge be ..."
Abstract
- Add to MetaCart
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
Designing Distributed Search Structures with Lazy Updates
"... Very large database systems require distributed storage for expansibility and high throughput, which means that they need distributed search structures for fast and efficient access to the data. In a highly parallel distributed search structure, parts of the index must be replicated to avoid seriali ..."
Abstract
- Add to MetaCart
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
Online Lazy Updates for Portfolio Selection with Transaction Costs
"... A major challenge for stochastic optimization is the cost of updating model parameters especially when the number of parameters is large. Updating parameters frequently can prove to be computationally or monetarily expensive. In this paper, we introduce an efficient primal-dual based online algorith ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
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
Lazy-Update B+-Tree for Flash Devices
"... Abstract — With the rapid increasing capacity of flash chips, flash-aware indexing techniques are highly desirable for flash devices. The unique features of flash memory, such as the erase-before-write constraint and the asymmetric read/write cost, severely deteriorate the performance of the traditi ..."
Abstract
- Add to MetaCart
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
COLUP: The cautious optimistic lazy update protocol
- In Actas de las XI Jornadas de Concurrencia
, 2003
"... 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 that p ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
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
COLUP: The Cautious Optimistic Lazy UpdateProtocol \Lambda
"... 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 an expression ..."
Abstract
- Add to MetaCart
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
Indexing the Current Positions of Moving Objects Using the Lazy Update R-Tree
- In Mobile Data Management, MDM
, 2002
"... 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 ..."
Abstract
-
Cited by 73 (1 self)
- Add to MetaCart
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
Partition-Based Lazy Updates for Continuous Queries over Moving Objects
"... Continuous spatial queries posted within an environment of moving objects produce as their results a time-varying set of objects. In the most ambitious case both queries and data objects are dynamic, making it very challenging to find an efficient query evaluation strategy. The significant overhead ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
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
Object Database Schema Evolution: are Lazy Updates always Equivalent to Immediate Updates?
, 1993
"... 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 not alway ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
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
Results 1 - 10
of
270
