Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction association, which consider only relationship among the item in the same transaction. However, intra-transaction association rules are not a suitable for trend prediction. Therefore, inter-transaction association is ...

A variety of extensions to the traditional (ACID) transaction model have resulted in a plethora of extended transaction models (ETMs). Many of these ETMs are application-specific, i.e., they are designed to provide correctness guarantees adequate for a particular application, but not others. Similarly, an application-specific ETM may impose restrictions that are unacceptable in one application,...

Activities of advanced applications can be modeled by interrelated transactions. These relations can be described by diierent kinds of transaction dependencies. The notion of transaction closure is a generalization of nested transactions providing means to describe complex activities such as transactional workkows. In this paper, our main focus lies on execution dependencies for describing cert...

In this paper, we introduce and describe directed dependency graph-based transaction and concurrency control (DCC) for persistent (stable, single-level) object-based bulk data management systems. The new technique is optimistic and applicable across a wide range of store sizes, transaction sizes and multi-programming levels. It is also has potential for use in management of transactions in othe...

In this paper, we present the results of the parallel Czech coreference and bridging annotation in the Prague Dependency Treebank 2.0. The annotation is carried out on dependency trees (on the tectogrammatical layer). We describe the inter-annotator agreement measurement, classify and analyse the most common types of annotators’ disagreement. On two selected long texts, we asked the annotators ...

Most parallel databases exploit two types of parallelism: intra-query parallelism and inter-transaction concurrency. Between these two cases lies another type of parallelism: inter-query parallelism within a transaction or application. Exploiting inter-query parallelism requires either compiler support to automatically parallelize the existing embedded query programs, or programming support to ...

Dependency injection is a hot topic among industrial developers using component frameworks. This paper first mentions that dependency injection and aspect-oriented programming share the same goal, which is to reduce dependency among components for better reusability. However, existing aspect-oriented programming languages/ frameworks, in particular, AspectJ, are not perfectly suitable for expre...

There is a fundamental di erence between rule R and the other rules The classical association rules express the associations among items purchased by one customer or share price movement within a day i e associations among items within the same transaction record We call them intra transaction association rules Sequential pattern discovery is also intra transaction mining in nature because each...