Sciweavers

584 search results - page 84 / 117
» Perspectives on Transactional Memory
Sort
View
ADC
2008
Springer
156views Database» more  ADC 2008»
14 years 1 months ago
Interactive Mining of Frequent Itemsets over Arbitrary Time Intervals in a Data Stream
Mining frequent patterns in a data stream is very challenging for the high complexity of managing patterns with bounded memory against the unbounded data. While many approaches as...
Ming-Yen Lin, Sue-Chen Hsueh, Sheng-Kun Hwang
PDP
2005
IEEE
14 years 1 months ago
FOBr: A Version-Based Recovery Protocol For Replicated Databases
Within the field of databases that are deployed in distributed environments there is a need to guarantee consistency among replicas and availability among nodes despite of networ...
Francisco Castro-Company, Luis Irún-Briz, F...
VLDB
2005
ACM
122views Database» more  VLDB 2005»
14 years 1 months ago
C-Store: A Column-oriented DBMS
This paper presents the design of a read-optimized relational DBMS that contrasts sharply with most current systems, which are write-optimized. Among the many differences in its d...
Michael Stonebraker, Daniel J. Abadi, Adam Batkin,...
RTSS
1994
IEEE
13 years 11 months ago
Timeliness via Speculation for Real-Time Databases
Various concurrency control algorithms di er in the time when con icts are detected, and in the way they are resolved. In that respect, the Pessimistic and Optimistic Concurrency ...
Azer Bestavros, Spyridon Braoudakis
FTCS
1998
91views more  FTCS 1998»
13 years 9 months ago
How Fail-Stop are Faulty Programs?
Most fault-tolerant systems are designed to stop faulty programs before they write permanent data or communicate with other processes. This property (halt-on-failure) forms the co...
Subhachandra Chandra, Peter M. Chen