Rodolphe Michel

Learn More
An access method based upon muhi-afiribure clustering allows fhe database administrafor to define muhiply parlilioned relalions. For each attribute in the clusrering, we can consider the set of subrelations as a relarion view. Such a method has been implemented in SABRE. II relies on muhi-a~tribute digital hashing and a linearly growing directory. Using(More)
A new access method, based upon predicate-tree and previously presented in [GARD 83b, VALD 84, GARD 85], presents major possibilities of applications. The basic method which is implemented, allows the clustering of tuples from a relation when they satisfy some predicate. The aim of this paper, is to show the flexibility of this method and the numerous(More)
  • 1