Sciweavers

54 search results - page 9 / 11
» Testing database transactions with AGENDA
Sort
View
AISS
2010
146views more  AISS 2010»
13 years 24 days ago
Zatara, the Plug-in-able Eventually Consistent Distributed Database
With the proliferation of the computer Cloud, new software delivery methods were created. In order to build software to fit into one of these models, a scalable, easy to deploy st...
Bogdan Carstoiu, Dorin Carstoiu
MSS
2005
IEEE
64views Hardware» more  MSS 2005»
13 years 11 months ago
STORAGEDB: Enhancing the Storage Sub-System with DBMS Functionalities
This paper proposes STORAGEDB: a paradigm for implementing storage virtualation using databases. It describes details for storing the logical-to-physical mapping information as ta...
Lin Qiao, Balakrishna R. Iyer, Divyakant Agrawal, ...
ADC
2003
Springer
182views Database» more  ADC 2003»
13 years 11 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 6 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
APPINF
2003
13 years 7 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo