Filters








784 Hits in 7.7 sec

Execution Models [chapter]

2006 Service-Oriented Computing  
A consequence of autonomy is that updates can occur only under local control. In other words, you can request another party to do something, but you cannot force them to do it.  ...  This is a so-called optimistic approach, because it works well when the transactions yield a schedule that is in fact serializable; otherwise, a lot of work may be lost.  ...  You can think of it as the metadata for the document. It is a formal specification of the rules of an XML document, including a definition for the data types that can appear in the document.  ... 
doi:10.1002/0470091509.ch10 fatcat:2jdemglma5gtre5xkxtzck45am

Using metalevel techniques in a flexible toolkit for CSCW applications

Paul Dourish
1998 ACM Transactions on Computer-Human Interaction  
However, the nature of CSCW applications and the mechanics of group interaction present a problem.  ...  in Prospero, and illustrates how Prospero can be used to create a range of collaborative applications.  ...  Acknowledgments This work was conducted while I was employed at the Xerox Research Centre Europe (Cambridge Lab, formerly EuroPARC) and studying in the Department of Computer Science at University College  ... 
doi:10.1145/287675.287676 fatcat:zqgtkg5yufhprjg6p7ifx4iebe

A Survey on Data and Transaction Management in Mobile Databases

D Roselin Selvarani
2012 International Journal of Database Management Systems  
The survey focuses on the complete study on the various types of Architectures used in Mobile databases and Mobile Transaction Models.  ...  In this paper a survey is presented on data and Transaction management in Mobile Databases from the year 2000 onwards.  ...  This model divides the synchronization process of a mobile transaction into 2 parts namely preferred and deferred parts by exploiting the hoardset fragmentability of data objects which the mobile transaction  ... 
doi:10.5121/ijdms.2012.4501 fatcat:hz6dj72yrzev3cvfdqkphlmmci

Transactional memory

James Larus, Christos Kozyrakis
2008 Communications of the ACM  
A more complete overview is available elsewhere. 18 ost TM systems of both types implement optimistic concurrency control in which a transaction executes under the assumption that it will not conflict  ...  DSTM is an object-granularity, deferred-update STM system, which means that a transaction modifies a private copy of an object and only makes its changes visible to other transactions when it commits.  ... 
doi:10.1145/1364782.1364800 fatcat:pkf2oqgqffgjjejbicvko4cw34

A Survey of Mobile Transactions

Patricia Serrano-Alvarado, Claudia Roncancio, Michel Adiba
2004 Distributed and parallel databases  
Several models for mobile transactions have been proposed but it is difficult to have an overview of all of them. This paper analyzes and compares several contributions to mobile transactions.  ...  The analysis distinguishes two groups of models. The first group includes proposals where transactions are completely or partially executed on mobile hosts.  ...  We also thank A. Moran, N. Adiba and B. Raffin for their help in reading this paper.  ... 
doi:10.1023/b:dapd.0000028552.69032.f9 fatcat:tohlptorcrbsxkgizqcnilsj6a

A FaaS File System for Serverless Computing [article]

Johann Schleier-Smith and Leonhard Holz and Nathan Pemberton and Joseph M. Hellerstein
2020 arXiv   pre-print
We take advantage of the function-grained fault tolerance model of cloud functions to proceed optimistically using local state, safe in the knowledge that we can restart if cache reads or lock activity  ...  The boundaries of cloud functions provide implicit commit and rollback points, giving us the flexibility to use transaction processing techniques without changing the programming model or API.  ...  We defer exploration of other isolation models in FaaSFS to future work.  ... 
arXiv:2009.09845v1 fatcat:qytxnxecybd27dj4zpixf4l6gu

Adapting Persistent Data Structures for Concurrency and Speculation [article]

Thomas Dickerson
2020 arXiv   pre-print
with low contention and an efficient snapshot operation to support speculative execution models.  ...  technique to yield a novel algorithm for concurrent execution of so-called "smart contracts" (specialized programs which manipulate the state of blockchain ledgers).  ...  This approach is optimistic in the sense that conflict detection/locking is deferred, and requires white-box access to the ADT implementation.  ... 
arXiv:2003.07395v1 fatcat:aad7ireyebbhrec77vafywhm6q

Towards elastic transactional cloud storage with range query support

Hoang Tam Vo, Chun Chen, Beng Chin Ooi
2010 Proceedings of the VLDB Endowment  
Furthermore, a multi-version optimistic concurrency control scheme matches well with the characteristics of data in cloud storages.  ...  In ec-Store, data objects are distributed and replicated in a cluster of commodity computer nodes located in the cloud.  ...  Since optimistic concurrency control defers update effect until commit time, we can piggy-back its concurrency control information for validation phase on the messages of the commit protocol as illustrated  ... 
doi:10.14778/1920841.1920907 fatcat:igcu5btk35eino33rsa64dppy4

Lazy State Determination: More concurrency for contending linearizable transactions [article]

Tiago M. Vale, João Leitão, Nuno Preguiça, Rodrigo Rodrigues, Ricardo J. Dias, João M. Lourenço
2020 arXiv   pre-print
The concurrency control algorithms in transactional systems limits concurrency to provide strong semantics, which leads to poor performance under high contention.  ...  To this end, we introduce the lazy state determination API to easily expose the semantics of application transactions to the database, and propose new optimistic and pessimistic concurrency control algorithms  ...  By allowing transactions to execute their logic over an abstract state and specifying their intent more clearly to the database, the concurrency control protocol can make more informed.  ... 
arXiv:2007.09733v1 fatcat:zvfniayo3zefraxo7gnpv34aie

Composing Multidatabase Applications using Flexible Transactions

Yungho Leu
1991 IEEE Data Engineering Bulletin  
By allowing more than one acceptable execution path for a single transaction and typed subtransactions, this model relaxes both the atomicity and isolation properties in a way that facilitates transaction  ...  The first paper by Dayal, Hsu and Ladin presents an extended transaction model for long lived transactions and ac tive databases.  ...  Acknowledgments Yoelle Maarek, Bill Schell and Bulent Yener worked with us on the implementation of INFUSE. We would also like to thank Andrea Skarra for her comments on a draft of this paper.  ... 
dblp:journals/debu/Leu91 fatcat:kgjcdpivf5anzet4xfugxxx2t4

Practical Database Replication [chapter]

Alfrânio Correia, José Pereira, Luís Rodrigues, Nuno Carvalho, Rui Oliveira
2010 Lecture Notes in Computer Science  
Primary-Backup Overview In the primary-backup approach to replication, also called passive replication [98] , update transactions are executed at a single master site under the control of a local concurrency  ...  Write operations are managed by the first-updater-wins rule, which means that a transaction trying to update an object must block and abort whenever a concurrent transaction updates the same object and  ...  : Lifecycle Events Mechanisms to observe and control the life-cycle of a DBMS site, namely, when a site is started, recover from logs and put on-line to clients.  ... 
doi:10.1007/978-3-642-11294-2_13 fatcat:oxlujsinxzdwdplq46dxje4lhm

Letter from the Editor

C. Mohan
1985 IEEE Data Engineering Bulletin  
Opinions expressed in contributions are those of the indi vidual author rather than the official position of the TC on Database Engineering, the IEEE Computer Society, or orga nizations with which the  ...  Its scope of interest includes: data structures and models, access strategies, access control techniques, database architecture, database machines, intelligent front ends, mass storage tor very large databases  ...  Schwarz who have contributed to the TABS  ... 
dblp:journals/debu/Mohan85 fatcat:vvtgkwww5nadhjbhfav6ioulwu

Disconnected operation in the Coda File System

James J. Kistler, M. Satyanarayanan
1992 ACM Transactions on Computer Systems  
An important, though not exclusive, application of disconnected operation is in supporting portable computers.  ...  The central idea behind our work is that caching of data, now widely used for performance, can also be exploited to improve availability.  ...  A disconnected client with shared control of an object would force the rest of the system to defer all updates until it reconnected.  ... 
doi:10.1145/146941.146942 fatcat:7e7evjr3ybcfzpgjbxeku2ijse

Disconnected operation in the Coda file system

James J. Kistler, M. Satyanarayanan
1991 Proceedings of the thirteenth ACM symposium on Operating systems principles - SOSP '91  
An important, though not exclusive, application of disconnected operation is in supporting portable computers.  ...  The central idea behind our work is that caching of data, now widely used for performance, can also be exploited to improve availability.  ...  A disconnected client with shared control of an object would force the rest of the system to defer all updates until it reconnected.  ... 
doi:10.1145/121132.121166 dblp:conf/sosp/KistlerS91 fatcat:7i4xxovainambjrnb46krp5eve

Disconnected operation in the Coda file system

James J. Kistler, M. Satyanarayanan
1991 ACM SIGOPS Operating Systems Review  
An important, though not exclusive, application of disconnected operation is in supporting portable computers.  ...  The central idea behind our work is that caching of data, now widely used for performance, can also be exploited to improve availability.  ...  A disconnected client with shared control of an object would force the rest of the system to defer all updates until it reconnected.  ... 
doi:10.1145/121133.121166 fatcat:yozggmkzinb37dat74kn54dr7m
« Previous Showing results 1 — 15 out of 784 results