Index structures for multiple sets can be classified into those that group entries according to their key values and those that group entries according to their set membership. Th...
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
In order to maximize systemperformancein environments with fluctuating memory contention, memory-intensive algorithms such as hash join must gracefully adapt to variations in avai...
In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we presen...
Object-oriented database OODB users bring with them large quantities of legacy data megabytes and even gigabytes. In addition, scienti c OODB users continually generate new data. ...