Sciweavers

434 search results - page 77 / 87
» Transactional memory for smalltalk
Sort
View
SIGMOD
2000
ACM
133views Database» more  SIGMOD 2000»
15 years 1 months ago
Data Mining on an OLTP System (Nearly) for Free
This paper proposes a scheme for scheduling disk requests that takes advantage of the ability of high-level functions to operate directly at individual disk drives. We show that s...
Erik Riedel, Christos Faloutsos, Gregory R. Ganger...
78
Voted
CIKM
2001
Springer
15 years 1 months ago
Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining
We explore in this paper an effective sliding-window filtering (abbreviatedly as SWF) algorithm for incremental mining of association rules. In essence, by partitioning a transact...
Chang-Hung Lee, Cheng-Ru Lin, Ming-Syan Chen
DTJ
1998
171views more  DTJ 1998»
14 years 9 months ago
Measurement and Analysis of C and C++ Performance
ir increasing use of abstraction, modularity, delayed binding, polymorphism, and source reuse, especially when these attributes are used in combination. Modern processor architectu...
Hemant G. Rotithor, Kevin W. Harris, Mark W. Davis
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
12 years 12 months ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
OSDI
2008
ACM
15 years 9 months ago
Gadara: Dynamic Deadlock Avoidance for Multithreaded Programs
Deadlock is an increasingly pressing concern as the multicore revolution forces parallel programming upon the average programmer. Existing approaches to deadlock impose onerous bu...
Manjunath Kudlur, Scott A. Mahlke, Stéphane...