Sciweavers

2703 search results - page 60 / 541
» Optimizing memory transactions
Sort
View
DAWAK
2008
Springer
13 years 10 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
DASFAA
2009
IEEE
123views Database» more  DASFAA 2009»
14 years 3 months ago
A Reprocessing Model Based on Continuous Queries for Writing Data to RFID Tag Memory
This paper investigates the problem of writing data to passive RFID tag memory and proposes a reprocessing model for assuring the atomicity and durability of writing transactions i...
Wooseok Ryu, Bonghee Hong
ICPADS
1996
IEEE
14 years 27 days ago
An optimal deadlock resolution algorithm in multidatabase systems
In this paper, we propose a novel deadlock resolution algorithm. In the presence of global deadlocks in a multidatabase system, this algorithm always selects an optimal set of vic...
Xuemin Lin, Jian Chen
VLDB
1993
ACM
98views Database» more  VLDB 1993»
14 years 24 days 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
PLDI
2009
ACM
14 years 1 months ago
A study of memory management for web-based applications on multicore processors
More and more server workloads are becoming Web-based. In these Web-based workloads, most of the memory objects are used only during one transaction. We study the effect of the me...
Hiroshi Inoue, Hideaki Komatsu, Toshio Nakatani