dblp.uni-trier.de www.dagstuhl.de www.uni-trier.de

A Reliable Backend Using Multiattribute Clustering and Select-Join Operator.

Jean-Pierre Cheiney, Pascal Faudemay, Rodolphe Michel, Jean-Marc Thévenin: A Reliable Backend Using Multiattribute Clustering and Select-Join Operator. VLDB 1986: 220-227
@inproceedings{DBLP:conf/vldb/CheineyFMT86,
  author    = {Jean-Pierre Cheiney and
               Pascal Faudemay and
               Rodolphe Michel and
               Jean-Marc Th{\'e}venin},
  editor    = {Wesley W. Chu and
               Georges Gardarin and
               Setsuo Ohsuga and
               Yahiko Kambayashi},
  title     = {A Reliable Backend Using Multiattribute Clustering and Select-Join
               Operator},
  booktitle = {VLDB'86 Twelfth International Conference on Very Large Data Bases,
               August 25-28, 1986, Kyoto, Japan, Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1986},
  isbn      = {0-934613-18-4},
  pages     = {220-227},
  ee        = {db/conf/vldb/CheineyFMT86.html},
  crossref  = {DBLP:conf/vldb/86},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

An access method based upon multi-attribute clustering allows the database administrator to define multiply partitioned relalions. For each attribute in the clustering, we can consider the set of subrelations as a relation view. Such a method has been implemented in SABRE. It relies on multi-attribute digital hashing and a linearly growing directory. Using this method, we show that it is possible to improve the multiprocessor hashing join algorithms by a ratio of 3 to 5, with the same hardware configurarion. According to our evaluation, the memory requirements are approximately the same as with the hashing algorithms, and the common bus used for disk accesses does not saturate. Any configuration can be linearly extended by adding or removing a disk or a processor, and reliabilily is guaranteed by a simple management of multiple copies. In case of a disk breakdown, the continuation of operation is possible with minimum loss of speed.

Copyright © 1986 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.


Online Paper

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Printed Edition

Wesley W. Chu, Georges Gardarin, Setsuo Ohsuga, Yahiko Kambayashi (Eds.): VLDB'86 Twelfth International Conference on Very Large Data Bases, August 25-28, 1986, Kyoto, Japan, Proceedings. Morgan Kaufmann 1986, ISBN 0-934613-18-4
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

References

[BITT83]
Dina Bitton, David J. DeWitt, Carolyn Turbyfill: Benchmarking Database Systems A Systematic Approach. VLDB 1983: 8-19 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[CHEI86]
Jean-Pierre Cheiney, Pascal Faudemay, Rodolphe Michel: An Extension of Access Paths to Improve Joins and Selections. ICDE 1986: 270-280 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[DEWI84]
David J. DeWitt, Randy H. Katz, Frank Olken, Leonard D. Shapiro, Michael Stonebraker, David A. Wood: Implementation Techniques for Main Memory Database Systems. SIGMOD Conference 1984: 1-8 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[DEWI85]
David J. DeWitt, Robert H. Gerber: Multiprocessor Hash-Based Join Algorithms. VLDB 1985: 151-164 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[GARD84]
Georges Gardarin, Patrick Valduriez, Yann Viémont: Predicate Trees: An Approach to Optimize Relational Query Operations. ICDE 1984: 439-444 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[GARD86]
...
[GOOD81]
...
[HSIA85]
Steven A. Demurjian, David K. Hsiao: Benchmarking Database Systems in Multiple Systems in Multiple Backend Configurations. IEEE Database Eng. Bull. 8(1): 29-39(1985) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[KITS83]
Masaru Kitsuregawa, Hidehiko Tanaka, Tohru Moto-Oka: Application of Hash to Data Base Machine and Its Architecture. New Generation Comput. 1(1): 63-74(1983) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[MOTO82]
...
[OZKA85]
Esen A. Ozkarahan, Aris M. Ouksel: Dynamic and Order Preserving Data Partitioning for Database Machines. VLDB 1985: 358-368 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[VALD84]
Patrick Valduriez, Georges Gardarin: Join and Semijoin Algorithms for a Multiprocessor Database Machine. ACM Trans. Database Syst. 9(1): 133-161(1984) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[VALD84b]
Patrick Valduriez, Yann Viémont: A Multikey Hashing Scheme Using Predicate Trees. SIGMOD Conference 1984: 107-114 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Referenced by

  1. Ludger Becker, Klaus Hinrichs, Ulrich Finke: A New Algorithm for Computing Joins with Grid Files. ICDE 1993: 190-197
  2. Jean-Pierre Cheiney, Christophe de Maindreville: A Parallel Strategy for Transitive Closure usind Double Hash-Based Clustering. VLDB 1990: 347-358
  3. Christos Faloutsos, Shari Roseman: Fractals for Secondary Key Retrieval. PODS 1989: 247-252
  4. Masaru Kitsuregawa, Lilian Harada, Mikio Takagi: Join Strategies on KB-Tree Indexed Relations. ICDE 1989: 85-93
  5. Jean-Pierre Cheiney, Christophe de Maindreville: Relational Storage and Efficient Retrieval of Rules in a Deductive DBMS. ICDE 1989: 644-651
  6. Serge Abiteboul, Michel Scholl, Georges Gardarin, Eric Simon: Towards DBMSs for Supporting New Applications. VLDB 1986: 423-435

Last update Fri Sep 14 17:38:07 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page