2703 search results - page 261 / 541 » Optimizing memory transactions |
159
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
The current literature offers two extremes of nonblocking software synchronization support for concurrent data structure design: intricate designs of specific structures based o...
180
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
207
click to vote
ITCC
2002
IEEE
15 years 11 months ago
2002
IEEE
Due to its portability and popularity for Internet applications, Java has become one of the major programming languages. The similar syntax inherited from the C language and the p...
212
click to vote
CIKM
1994
Springer
15 years 10 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...
175
click to vote
HOTOS
2007
IEEE
15 years 10 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...