#### Filter Results:

#### Publication Year

1977

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

By interleaving the bits of the binary representations of the attribute values in a tuple, an integer corresponding to the tuple is created. A set of these integers represents a relation. The usual ordering of these integers corresponds to an ordering of multidimensional data that allows the use of conventional file organizations, such as Btrees, in the… (More)

Tries ooer text searches with costs which are independent of the size of the document being searched, and so are important for large documents requiring spelling checkers), case insensitivity, and limited approximate regular secondary storage. Approximate searches, in which the search pattern diiers from the document by k substitutions , transpositions,… (More)

We show how relations can be modelled in fast memory by a distribution of tuples in a multidimensional space. Given distributions for operand relations we derive distributions for the relations that result from applying the relational algebra. We apply the result for the natural join to optimize the evaluation of an expression involving two joins. We… (More)

To join two relations efficiently, they must not only be clustered but <i>mutually clustered</i>. Sorting is the only known way to achieve mutual clustering. Once the relations are sorted, merging is the obvious way to implement the join. If the relations are known to be sorted appropriately, the most costly part of the process can be omitted. To know that… (More)