The authors consider the problem of clustering two-dimensional association rules in large
databases. They present a geometric-based algorithm, BitOp, for performing the clustering …

Multidimensional access methods have shown high potential for significant performance
improvements in various application domains. However, only few approaches have made …

Data mining is the emerging science and industry of applying modern statistical and
computational technologies to the problem of finding useful patterns hidden within large …

The database query optimizer requires the estimation of the query selectivity to find the most
efficient access plan. For queries referencing multiple attributes from the same relation, we …

The authors propose a subsequence matching method, Dual Match, which exploits duality in
constructing windows and significantly improves performance. Dual Match divides data …

Matrix factorization is one of the fundamental techniques for analyzing latent relationship
between two entities. Especially, it is used for recommendation for its high accuracy. Efficient …

The generalized search tree, or GiST, defines a framework of basic interfaces required to
construct a hierarchical access method for database systems. As originally specified, GiST …

Selectivity estimation aims at estimating the number of database objects that satisfy a
selection criterion. Answering this problem accurately and efficiently is essential to many …

Learning query transformation rules is vital for the success of semantic query optimization in
domains where the user cannot provide a comprehensive set of integrity constraints. Finding …

Spatial join finds pairs of spatial objects having a specific spatial relationship in spatial
database systems. Since spatial join is a fairly expensive operation, we need an efficient …