Sciweavers

6031 search results - page 426 / 1207
» Communicating Transaction Processes
Sort
View
SPAA
2009
ACM
16 years 1 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
WORDS
2003
IEEE
16 years 1 days ago
An Optimal Atomic Broadcast Protocol and an Implementation Framework
Atomic Broadcast (where all processes deliver broadcast messages in the same order) is a very useful group communication primitive for building fault-tolerant distributed systems....
Paul D. Ezhilchelvan, Doug Palmer, Michel Raynal
VLDB
2004
ACM
112views Database» more  VLDB 2004»
16 years 7 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
VLDB
2007
ACM
198views Database» more  VLDB 2007»
16 years 7 months ago
The End of an Architectural Era (It's Time for a Complete Rewrite)
In previous papers [SC05, SBC+07], some of us predicted the end of "one size fits all" as a commercial relational DBMS paradigm. These papers presented reasons and exper...
Michael Stonebraker, Samuel Madden, Daniel J. Abad...
SIGMOD
2007
ACM
188views Database» more  SIGMOD 2007»
16 years 7 months ago
Keyword search on relational data streams
Increasing monitoring of transactions, environmental parameters, homeland security, RFID chips and interactions of online users rapidly establishes new data sources and applicatio...
Alexander Markowetz, Yin Yang, Dimitris Papadias