Optimal bucket size for multiattribute retrieval in partitioned files

https://doi.org/10.1016/0306-4379(87)90029-9Get rights and content

Abstract

The problem of optimal bucket size for multiattribute retrieval in partitioned files is considered. The query types considered include exact match queries, range queries, partial match queries, and best match (including nearest neighbor) queries. The similarities among formulas which have been derived in several different contexts are examined.

References (23)

  • C.C. Chang

    Optimal information retrieval when queries are not random

    Inform. Sci.

    (1984)
  • D. Avis

    Nonpartitionable point sets

    Inform. Process. Lett.

    (October, 1984)
  • C.M. Eastman

    Optimal bucket size for nearest neighbor searching in k-d trees

    Inform. Process. Lett.

    (August, 1981)
  • J. Nievergelt et al.

    The grid file: an adaptable, symmetric multikey file structure

    ACM Trans. Database Systems

    (March, 1984)
  • W.C. Lin et al.

    Common properties of some multiattribute file systems

    IEEE Trans. Software Engng

    (March, 1979)
  • A.V. Aho et al.

    Optimal partial-match retrieval when fields are independently specified

    ACM Trans. Database Systems

    (June, 1979)
  • A. Bolour

    Optimality properties of multiple-key hashing functions

    J. ACM

    (April, 1979)
  • J.W. Lloyd

    Optimal partial-match retrieval

    BIT

    (1980)
  • S. Moran

    On the complexity of designing optimal partial-match retrieval systems

    ACM Trans. Database Systems

    (December, 1983)
  • T.H. Merrett

    Relational Information Systems

    (1984)
  • K. Hinricks

    Implementation of the grid file: design concepts and experience

    BIT

    (1985)

    • Cited by (0)

    View full text
    Copyright © 1987 Published by Elsevier Ltd.