skip to main content

A graph based data structure for efficient implementation of main memory DBMS's

Pucheral, Philippe ; Thevenin, Jean-Marc (1958-....)

Le Chesnay, France : Institut National de Recherche en Informatique et en Automatique, 1989

Voir les exemplaires

  • Titre:
    A graph based data structure for efficient implementation of main memory DBMS's
  • Auteur: Pucheral, Philippe
  • Autre(s) auteur(s): Thevenin, Jean-Marc (1958-....)
  • Sujets: Bases de données -- Gestion;
    Structures de données (informatique);
    Base de données;
    STRUCTURE DE DONNEES;
    H-LOGICIEL
  • Description: Abstract: "Considering that in future DBMS's it will be possible to hold the active database in main memory, a new physical database organization is proposed. This organization aims two objectives: be compact and decomposable such as the active database always fits in main memory and speed up extended relational algebra in term of CPU time. Tuples, indices and temporary results are integrated in a unique data structre called DBGraph. Tuples and values are stored separately and constitute the vertices of the DBGraph. Edges between tuples and values are maintained using OID's in order to constitute a bipartite graph. This graph precompiles selection, join and transitive closure operations
    Set oriented execution of relational algebra is generated using a breadth first traversal of this graph while pipeline execution is produced using a depth first traversal. The two strategies lead to the same temporal complexity. Storage cost evaluations demonstrate the compactness of DBGraph. Peroformance evaluations show that in a main memory context transitive closure on DBGraph outperforms transitive closure on join indices, still considered as one of the best algorithm
  • Éditeur: Le Chesnay, France : Institut National de Recherche en Informatique et en Automatique
  • Date de publication: 1989
  • Format: 22 p. : ill. ; 30 cm
  • Langue: Anglais
  • Source: Mines ParisTech (catalogue)

Recherche dans les bases de données distantes en cours. Merci de patienter.

  • Recherche
  • dansscope:(33PSL-CNSAD),scope:(33PSL-EHESS),scope:(33PSL-PSL_OMEKA),scope:(33PSL-MINES),scope:(33PSL-EFEO),scope:(33PSL-CNSMDP),scope:(33PSL-CHIMIE),scope:(33PSL),scope:("DAU"),scope:(33PSL-CDF),scope:(33PSL-ENS),scope:("33PSL-OBSERV"),scope:("33PSL-ESPCI"),scope:(33PSL-CURIE),scope:(33PSL-ENSBA),scope:("33PSL-ENC"),scope:(33PSL-PSL_STAR),scope:(33PSL-PSL_SFX),scope:("33PSL-EPHE"),scope:(33PSL-ENSAD),primo_central_multiple_fe
  • Afficher ce qui a déjà été récupéré