Sciweavers

6181 search results - page 72 / 1237
» Transactional Cluster Computing
Sort
View
FIMI
2004
239views Data Mining» more  FIMI 2004»
13 years 9 months ago
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
SOSP
2007
ACM
14 years 5 months ago
Sinfonia: a new paradigm for building scalable distributed systems
We propose a new paradigm for building scalable distributed systems. Our approach does not require dealing with message-passing protocols—a major complication in existing distri...
Marcos Kawazoe Aguilera, Arif Merchant, Mehul A. S...
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 2 months ago
Dynamic Micro Targeting: Fitness-Based Approach to Predicting Individual Preferences
It is crucial to segment customers intelligently in order to offer more targeted and personalized products and services. Traditionally, customer segmentation is achieved using sta...
Tianyi Jiang, Alexander Tuzhilin
WIESS
2000
13 years 9 months ago
Operational Information Systems: An Example from the Airline Industry
Our research is motivated by the scaleability, availability, and extensibility challenges in deploying open systems based, enterprise operational applications. We present Delta�...
Van Oleson, Karsten Schwan, Greg Eisenhauer, Beth ...
SIGMOD
2008
ACM
190views Database» more  SIGMOD 2008»
14 years 8 months ago
OLTP through the looking glass, and what we found there
Online Transaction Processing (OLTP) databases include a suite of features -- disk-resident B-trees and heap files, locking-based concurrency control, support for multi-threading ...
Stavros Harizopoulos, Daniel J. Abadi, Samuel Madd...