Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away the intermediateâ€¦ (More)

We consider the problem of doing fast and reliable estimation of the number z of non-zero entries in a sparse boolean matrix product. This problem has applications in databases and computer algebra.â€¦ (More)

Set intersection is the core in a variety of problems, e.g. frequent item set mining and sparse boolean matrix multiplication. It is well-known that large speed gains can, for some computationalâ€¦ (More)

2010 IEEE 26th International Conference on Dataâ€¦

2010

A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number of irrelevantâ€¦ (More)

The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while satisfying theâ€¦ (More)

The d-dimensional bin packing problem (OBPP-d) is the problem of finding the minimum number of containers needed to contain a set of orthogonally packed d-dimensional rectangular boxes. In OBPP-dâ€¦ (More)