Efficient Main Memory Data Management Using the DBGraph Storage Model.
Philippe Pucheral, Jean-Marc Thévenin, Patrick Valduriez:
Efficient Main Memory Data Management Using the DBGraph Storage Model.
VLDB 1990: 683-695@inproceedings{DBLP:conf/vldb/PucheralTV90,
author = {Philippe Pucheral and
Jean-Marc Th{\'e}venin and
Patrick Valduriez},
editor = {Dennis McLeod and
Ron Sacks-Davis and
Hans-J{\"o}rg Schek},
title = {Efficient Main Memory Data Management Using the DBGraph Storage
Model},
booktitle = {16th International Conference on Very Large Data Bases, August
13-16, 1990, Brisbane, Queensland, Australia, Proceedings},
publisher = {Morgan Kaufmann},
year = {1990},
isbn = {1-55860-149-X},
pages = {683-695},
ee = {db/conf/vldb/PucheralTV90.html},
crossref = {DBLP:conf/vldb/90},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
The requirements for a main memory data storage model are both compactness and efficient processing for all database operations.
The DBGraph storage model, proposed in this paper, achieves these goals.
By representing the entire database in a unique graph-based data structure, called DBGraph, it fully exploits the direct- access capability of main memory systems.
For example, Selection, Join and Transitive closure operations over base or temporary relations are performed by a DBGraph traversal without tuple comparison and move.
Furthermore, it is decomposable so that only the useful subset of the database can be loaded from disk without format conversion.
Complex database queries can be processed by either set-oriented or pipelined mode depending on the way the graph is traversed.
Analysis shows good storage occupancy and excellent performance for both updateand retrieval operations.
Copyright © 1990 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
CDROM Version: Load the CDROM "Volume 1 Issue 5, VLDB '89-'97" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Dennis McLeod, Ron Sacks-Davis, Hans-Jörg Schek (Eds.):
16th International Conference on Very Large Data Bases, August 13-16, 1990, Brisbane, Queensland, Australia, Proceedings.
Morgan Kaufmann 1990, ISBN 1-55860-149-X
References
- [Agra89]
- Rakesh Agrawal, Alexander Borgida, H. V. Jagadish:
Efficient Management of Transitive Relationships in Large Data and Knowledge Bases.
SIGMOD Conference 1989: 253-262
- [Amma85]
- ...
- [Banc86]
- François Bancilhon, Raghu Ramakrishnan:
An Amateur's Introduction to Recursive Query Processing Strategies.
SIGMOD Conference 1986: 16-52
- [Bitt83]
- Dina Bitton, David J. DeWitt, Carolyn Turbyfill:
Benchmarking Database Systems A Systematic Approach.
VLDB 1983: 8-19
- [Bitt86]
- ...
- [Brat84]
- Kjell Bratbergsengen:
Hashing Methods and Relational Algebra Operations.
VLDB 1984: 323-333
- [Card75]
- Alfonso F. Cardenas:
Analysis and Performance of Inverted Data Base Structures.
Commun. ACM 18(5): 253-263(1975)
- [Cope85]
- George P. Copeland, Setrag Khoshafian:
A Decomposition Storage Model.
SIGMOD Conference 1985: 268-279
- [Cope86]
- George P. Copeland, Setrag Khoshafian, Marc G. Smith, Patrick Valduriez:
Buffering Schemes for Permanent Data.
ICDE 1986: 214-221
- [Cope89]
- George P. Copeland, Tom W. Keller, Ravi Krishnamurthy, Marc G. Smith:
The Case For Safe RAM.
VLDB 1989: 327-335
- [Cope90]
- George P. Copeland, Michael J. Franklin, Gerhard Weikum:
Uniform Object Management.
EDBT 1990: 253-268
- [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
- [Eich89]
- Margaret H. Eich:
Main Memory Database Research Directions.
IWDM 1989: 251-268
- [Gard88]
- ...
- [Gibb85]
- ...
- [Lehm86a]
- Tobin J. Lehman, Michael J. Carey:
A Study of Index Structures for Main Memory Database Management Systems.
VLDB 1986: 294-303
- [Lehm86b]
- Tobin J. Lehman, Michael J. Carey:
Query Processing in Main Memory Database Management Systems.
SIGMOD Conference 1986: 239-250
- [Miss82]
- Michele Missikoff:
A Domain Based Internal Schema for Relational Database Machines.
SIGMOD Conference 1982: 215-224
- [Miss83]
- Michele Missikoff, Michel Scholl:
Relational Queries in a Domain Based DBMS.
SIGMOD Conference 1983: 219-227
- [Puch89a]
- Philippe Pucheral, Jean-Marc Thévenin:
A Graph Based Data Structure for Efficient Implementation of Main Memory DBMS's.
IWDM 1989: 73-96
- [Puch89b]
- ...
- [Rose86]
- Arnon Rosenthal, Sandra Heiler, Umeshwar Dayal, Frank Manola:
Traversal Recursion: A Practical Approach to Supporting Recursive Applications.
SIGMOD Conference 1986: 166-176
- [Sedg84]
- ...
- [Shek90]
- Eugene J. Shekita, Michael J. Carey:
A Performance Evaluation of Pointer-Based Joins.
SIGMOD Conference 1990: 300-311
- [Thev89]
- ...
- [Ullm82]
- Jeffrey D. Ullman:
Principles of Database Systems, 2nd Edition.
Computer Science Press 1982, ISBN 0-914894-36-6
- [Vald86a]
- Patrick Valduriez, Setrag Khoshafian, George P. Copeland:
Implementation Techniques of Complex Objects.
VLDB 1986: 101-110
- [Vald86b]
- Patrick Valduriez, Haran Boral:
Evaluation of Recursive Queries Using Join Indices.
Expert Database Conf. 1986: 271-293
- [Vald87]
- Patrick Valduriez:
Join Indices.
ACM Trans. Database Syst. 12(2): 218-246(1987)
Copyright © Tue Mar 16 02:22:01 2010
by Michael Ley (ley@uni-trier.de)
