Sciweavers

429 search results - page 51 / 86
» Transactional memory
Sort
View
DAWAK
2008
Springer
13 years 11 months ago
Efficient Approximate Mining of Frequent Patterns over Transactional Data Streams
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
Willie Ng, Manoranjan Dash
ASPLOS
1998
ACM
14 years 2 months ago
Performance of Database Workloads on Shared-Memory Systems with Out-of-Order Processors
Database applications such as online transaction processing (OLTP) and decision support systems (DSS) constitute the largest and fastest-growing segment of the market for multipro...
Parthasarathy Ranganathan, Kourosh Gharachorloo, S...
VLDB
1993
ACM
98views Database» more  VLDB 1993»
14 years 1 months ago
Memory-Adaptive External Sorting
- In real-time and goal-orienteddatabasesystems, the amountof memory assignedto queriesthat sort or join large relations may fluctuate due to contention from other higherpriority t...
HweeHwa Pang, Michael J. Carey, Miron Livny
SIGPLAN
2008
13 years 9 months ago
Single global lock semantics in a weakly atomic STM
As memory transactions have been proposed as a language-level replacement for locks, there is growing need for well-defined semantics. In contrast to database transactions, transa...
Vijay Menon, Steven Balensiefer, Tatiana Shpeisman...
VLDB
2004
ACM
126views Database» more  VLDB 2004»
14 years 3 months ago
STEPS towards Cache-resident Transaction Processing
Online transaction processing (OLTP) is a multibillion dollar industry with high-end database servers employing state-of-the-art processors to maximize performance. Unfortunately,...
Stavros Harizopoulos, Anastassia Ailamaki