5,249 Hits in 3.4 sec

Lazy evaluation of transactions in database systems

Jose M. Faleiro, Alexander Thomson, Daniel J. Abadi
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
Existing database systems employ an eager transaction processing scheme-that is, upon receiving a transaction request, the system executes all the operations entailed in running the transaction (which  ...  We introduce a lazy transaction execution engine, in which a transaction may be considered durably completed after only partial execution, while the bulk of its operations (notably all reads from the database  ...  Since the stickification of a transaction in a lazy database is much less expensive than evaluating a transaction in a conventional system, a lazy database deals with an increased rate of traffic without  ... 
doi:10.1145/2588555.2610529 dblp:conf/sigmod/FaleiroTA14 fatcat:rcqea7ptcbf75bi4u4anc62wvy

Lazy Evaluation for Concurrent OLTP and Bulk Transactions

Lesley Wevers, Marieke Huisman, Maurice van Keulen
2016 Proceedings of the 20th International Database Engineering & Applications Symposium on - IDEAS '16  
This allows readers to prioritize evaluation of those operations in which they are interested, without loss of atomicity of transactions.  ...  In this paper we present an abstract lazy index structure for lazy transactions, and show how transactions can be encoded to effectively use this data structure.  ...  Implementations of this index can be used for primary and secondary indexes in lazy database systems.  ... 
doi:10.1145/2938503.2938555 dblp:conf/ideas/WeversHK16 fatcat:mjywwxsvbzfizokrfyatzal23y

Strongly consistent replication for a bargain

Konstantinos Krikellas, Sameh Elnikety, Zografoula Vagena, Orion Hodson
2010 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)  
Strong consistency is an important correctness property for replicated databases. It ensures that each transaction accesses the latest committed database state as provided in centralized databases.  ...  We propose two scalable techniques that exploit lazy update propagation and workload information to guarantee strong consistency by delaying transaction start.  ...  ACKNOWLEDGMENTS We thank Antony Rowstron (Microsoft Research), Alan Fekete (University of Sydney), and Fernando Pedone (University of Lugano) for their insightful suggestions and valuable feedback.  ... 
doi:10.1109/icde.2010.5447893 dblp:conf/icde/KrikellasEVH10 fatcat:aur6rpqnyvcyvnw3yz7adfw5ty

An Evaluation Framework of Replication Protocols in Mobile Environment

Archana Sharma, Vineet Kansal
2013 International Journal of Database Management Systems  
Conventional data sharing systems are based on presumption that connections are reliable, and a faulty operation will be considered in case of losing a connection.  ...  The availability, reliability and adaptability have been the three main criteria which have been considered for evaluation.  ...  This is the level of reliability that is used in database systems. In general, only excellent reliability is acceptable.  ... 
doi:10.5121/ijdms.2013.5104 fatcat:foo2xcy7y5atbc32qqpcpgtoye

The cost of increased transactional correctness and durability in distributed databases

Aspen Olmsted, Csilla Farkas
2012 2012 IEEE 13th International Conference on Information Reuse & Integration (IRI)  
In this paper we investigate the problem of providing durability for Web Service transactions in the presence of system failures.  ...  We show that the popular lazy replica update propagation method is vulnerable to loss of transactional updates in the presence of hardware failures.  ...  Analysis of the Buddy System In this section we study a specific aspect of our proposed system. First, we evaluate the performance of our system in high-volume scenarios.  ... 
doi:10.1109/iri.2012.6303042 dblp:conf/iri/OlmstedF12 fatcat:wb6nhfyixrbibczohhboyoy7jy

Service Constraint Guarantees

Aspen Olmsted, RoxAnn Stalvey
2014 International Journal of Intelligent Computing Research  
In this paper we investigate the problem of providing consistency, availability and durability for Web Service transactions.  ...  In our previous work, we proposed a replica update propagation method, called the Buddy System, which guaranteed durability and increased availability of web services.  ...  We tested insert timings of loads of concurrent transactions in blocks of 100 with the constraint implemented in the SQL Server with lazy replication and the Buddy System implementing the constraint with  ... 
doi:10.20533/ijicr.2042.4655.2014.0055 fatcat:327gkfdcsrbcjitjqzjzyvbdkq

Comparison of database replication techniques based on total order broadcast

M. Wiesmann, A. Schiper
2005 IEEE Transactions on Knowledge and Data Engineering  
This hides the complexity of the group communication subsystem and ignores the interactions between the communication system and database system  ...  In this paper, we present a performance comparison of database replication techniques based on total order broadcast.  ...  Client Module The clients of the replicated database system were also modeled. Clients are simple sources of transactions.  ... 
doi:10.1109/tkde.2005.54 fatcat:uxyblbcbkrfvpjcl3tyekhuuae

Lazy Database Access with Persistent Predicates

Sebastian Fischer
2007 Electronical Notes in Theoretical Computer Science  
We extend previous work on persistent predicates for Curry by lazy database access. Results of a database query are only read as much as they are demanded by the application program.  ...  We also present a typeoriented approach to convert between database and Curry values which is used to implement lazy access to persistent predicates based on a low level lazy database interface.  ...  Whether this is a performance penalty depends on the implementation of transactions in the involved database systems.  ... 
doi:10.1016/j.entcs.2007.01.024 fatcat:3ygiohqbobbsneatzh56vwe7uy

STAMP: Stanford Transactional Applications for Multi-Processing

Chi Cao Minh, JaeWoong Chung, Christos Kozyrakis, Kunle Olukotun
2008 2008 IEEE International Symposium on Workload Characterization  
We introduce the Stanford Transactional Application for Multi-Processing (STAMP), a comprehensive benchmark suite for evaluating TM systems.  ...  Most TM systems have been evaluated using microbenchmarks, which may not be representative of any real-world behavior, or individual applications, which do not stress a wide range of execution scenarios  ...  It is our hope that STAMP will help address a great need in the TM research community by providing a comprehensive tool to help people design and evaluate TM systems.  ... 
doi:10.1109/iiswc.2008.4636089 dblp:conf/iiswc/MinhCKO08 fatcat:ygykkfjasvdotnbdlkcfcistj4

Enhancing Edge Computing with Database Replication

Yi Lin, Bettina Kemme, Marta Patino-Martinez, Ricardo Jimenez-Peris
2007 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)  
Our extensive evaluations in a real wide area network using TPC-W show promising results.  ...  Our approach lies in a wide area data replication protocol that enables the delivery of dynamic content with full consistency guarantees and with all the benefits of edge computing, such as low latency  ...  Performance evaluation System description In our evaluation, we compare SEQ and HYBRID against lazy primary copy replication (LP1Msg and LPn-Msg).  ... 
doi:10.1109/srds.2007.10 dblp:conf/srds/LinKPJ07 fatcat:fpf56rrvw5f6to2tphf2wa7ewy

Beyond 1-Safety and 2-Safety for Replicated Databases: Group-Safety [chapter]

Matthias Wiesmann, André Schiper
2004 Lecture Notes in Computer Science  
In this paper, we study the safety guarantees of group communication-based database replication techniques.  ...  We show that there is a model mismatch between group communication and database, and because of this, classical group communication systems cannot be used to build 2-safe database replication.  ...  Performance evaluation show that group-safe replication compares favourably to lazy replication, while providing better guarantees in terms of the ACID properties.  ... 
doi:10.1007/978-3-540-24741-8_11 fatcat:2phjbaidovct7pbv7acodotmca

Refereeing conflicts in hardware transactional memory

Arrvindh Shriraman, Sandhya Dwarkadas
2009 Proceedings of the 23rd international conference on Conference on Supercomputing - ICS '09  
In the search for high performance, most transactional memory (TM) systems execute atomic blocks concurrently and must thus be prepared for data conflicts.  ...  In this paper, we analyze the interplay between conflict resolution time and contention management policy in the context of hardware-supported TM systems, highlighting both the implementation tradeoffs  ...  Figure 3 shows the results of our evaluation of the above policies. '-E' refers to eager systems and '-L' refers to lazy systems.  ... 
doi:10.1145/1542275.1542299 dblp:conf/ics/ShriramanD09 fatcat:375zggimkzgwdkcx2xjchjrqte

Functional programming: An angry half-dozen [chapter]

Philip Wadler
1998 Lecture Notes in Computer Science  
Lazy languages evaluate arguments on demand, and so require highly disciplined use of side effects; strict languages evaluate arguments eagerly, but make it easier to exploit side effects.  ...  Many, but not all, involve databases in a central way. Compilers This one's a freebie.  ...  The result returned from a database access is typically a list of entity indexes. Lazy evaluation processes entities one at a time, reducing the amount of store required.  ... 
doi:10.1007/3-540-64823-2_2 fatcat:w2l5t4fitbb6zpghccfea57lpq

Concurrency and Replica Control for Constraint-Based Database Caching [chapter]

Joachim Klein
2010 Lecture Notes in Computer Science  
Many database vendors have extended their systems with similar but less flexible ideas [1, 2, 21] .  ...  In contrast to Web caching only supporting ID-based queries, database caching services set-oriented requests and must, therefore, verify that the predicates used by SQL queries can be evaluated, i.e.,  ...  But in doing so, we rely on the concurrency control of the underlying database system. First, we try to realize lazy update propagation being highly desired, before we explore eager approaches.  ... 
doi:10.1007/978-3-642-15576-5_24 fatcat:ei4froitrba3hjudggv7geob7e

Buddy System: Available, Consistent, Durable Web Service Transactions

Aspen Olmsted, Csilla Farkas
2013 Journal of Internet Technology and Secured Transaction  
Our first implementation schedules fine-grained WS transactions. In these transactions each activity is a low level database operation.  ...  We show that our approach guarantees one-copy serializability, matches the performance of the lazy update propagation methods, and increases durability in the presence of hardware failures.  ...  Analysis of the buddy system In this section we evaluate the performance of our system in high-volume scenarios, and compare our approach with eager and lazy replica update propagation in the presence  ... 
doi:10.20533/jitst.2046.3723.2013.0018 fatcat:jpjbx4vu3jhlbg65265tcwjcna
« Previous Showing results 1 — 15 out of 5,249 results