#### Filter Results:

- Full text PDF available (15)

#### Publication Year

1971

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Jack A. Orenstein, T. H. Merrett
- PODS
- 1984

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)

- Ekow J. Otoo, T. H. Merrett
- Computing
- 1983

Conventional methods of storing aK-dimensional array allow easy extension only along one dimension. We present a technique of allocating a linear sequence of contiguous storage locations for aK-dimensional extendible array by adjoining blocks of (K−1)-dimensional subarrays. Element access is by determination of the block header location and then the… (More)

- T. H. Merrett, Yahiko Kambayashi, H. Yasuura
- VLDB
- 1981

- Heping Shang, T. H. Merrett
- IEEE Trans. Knowl. Data Eng.
- 1996

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)

- T. H. Merrett
- JCDKB
- 1978

- T. H. Merrett, Ekow J. Otoo
- JCDKB
- 1982

- T. H. Merrett, Ekow J. Otoo
- Fifth International Conference on Very Large Data…
- 1979

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)

- T. H. Merrett, Heping Shang
- FODO
- 1993

- T. H. Merrett
- SIGMOD Record
- 1983

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)

- T. H. Merrett
- Inf. Process. Lett.
- 1977