A Bloom-filter-based semijoin algorithm for distributed database systems is presented. This
algorithm reduces communications costs to process a distributed natural join as much as …

This note deals with a paper by Gremillion demonstrating the simulation approach to the design
of a Bloom filter. It is shown that an analytical approach can yield insights into competing …

This paper shows how to esimtate the size of the natural join of two relations. Such an
estimate is valuable in query optimization as joins constitute the bulk of the work required in …

A highly compressed index for a collection of variable-sized documents is described. Arrays
of small Bloom filters are used to efficiently locate documents where the search probe …

A hashing method is presented where the amount of storage required for a file can expand
and shrink by very large factors. The performance of this method as measured by lookup time…

This paper describes three spelling checkers implemented at the University of Western
Ontario. The first is interesting for its functionality and high compression of its dictionary; the …

We describe and analyse a dynamic hashing method called ‘Spiral Storage’. Dynamic
hashing methods extend the power of conventional hashing methods by avoiding the need to …

… For instance, faced with a steep decline in men’s basketball attendance, Arizona State
hired the Aspire Group, led by coauthor Bernie Mullin, to boost sales in four ticketed sports. As …

The ability to describe array expressions in terms of the shapes of their arguments and the
symbolic verification of n-dimensional array expressions has been an open area of research …

Molecular color centers with S= 1 ground states are promising candidates for quantum sensing
of electric fields. These molecules have an electronic structure similar to solid state color …