Sciweavers

631 search results - page 106 / 127
» Composable memory transactions
Sort
View
ICDM
2002
IEEE
167views Data Mining» more  ICDM 2002»
15 years 2 months ago
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns
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...
Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu
ITCC
2002
IEEE
15 years 2 months ago
The Object Behavior of Java Object-Oriented Database Management Systems
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...
Chia-Tien Dan Lo, J. Morris Chang, Ophir Frieder, ...
95
Voted
CIKM
1994
Springer
15 years 1 months ago
TID Hash Joins
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...
Robert Marek, Erhard Rahm
C3S2E
2009
ACM
15 years 1 months ago
The promise of solid state disks: increasing efficiency and reducing cost of DBMS processing
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...
Karsten Schmidt 0002, Yi Ou, Theo Härder
HOTOS
2007
IEEE
15 years 1 months ago
Is the Optimism in Optimistic Concurrency Warranted?
Optimistic synchronization allows concurrent execution of critical sections while performing dynamic conflict detection and recovery. Optimistic synchronization will increase perf...
Donald E. Porter, Owen S. Hofmann, Emmett Witchel