Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an effic...
Ashok Savasere, Edward Omiecinski, Shamkant B. Nav...
With the emergence of cooperative applications it turned out that traditional transaction concepts are not suitable for these scenarios. Isolation of transactions, as guaranteed b...
Marek Rusinkiewicz, Wolfgang Klas, Thomas Tesch, J...
Parallel database systems have to support the effective parallelization of complex queries in multi-user mode, i.e. in combination with inter-query/inter-transaction parallelism. ...
RAID5 disk arrays provide high performance and high reliability for reasonable cost. However RAID5 suffers a performance penalty during block updates. In order to overcome this pr...
Abstract: Intra-operator(or partitioned) parallelism is a well-established mechanism for achieving high performance in parallel database systems. However, the problem of how to exp...
Traditionally, optimizers are “programmed” to optimize queries following a set of buildin procedures. However, optimizers should be robust to its changing environment to gener...
Classification, which involves finding rules that partition a given da.ta set into disjoint groups, is one class of data mining problems. Approaches proposed so far for mining cla...
: This paper defines a framework for explaining redo recovery after a system crash. In this framework, an installation graph explains the order in which operations must be install...