584 search results - page 101 / 117 » Perspectives on Transactional Memory |
CIKM
1994
Springer
13 years 11 months ago
1994
Springer
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...
C3S2E
2009
ACM
13 years 11 months ago
2009
ACM
Most database systems (DBMSs) today are operating on servers equipped with magnetic disks. In our contribution, we want to motivate the use of two emerging and striking technologi...
HOTOS
2007
IEEE
13 years 11 months ago
2007
IEEE
We propose a new concurrent programming model, Automatic Mutual Exclusion (AME). In contrast to lock-based programming, and to other programming models built over software transac...
HOTOS
2007
IEEE
13 years 11 months ago
2007
IEEE
Optimistic synchronization allows concurrent execution of critical sections while performing dynamic conflict detection and recovery. Optimistic synchronization will increase perf...
ISCA
1998
IEEE
13 years 11 months ago
1998
IEEE
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...