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

  • Philippe Puchmeral
  • Jean-Marc Thevenin
Esprit Projects
Part of the Lecture Notes in Computer Science book series (LNCS, volume 368)


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 and indices are integrated in a unique data structure 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 the DBGraph structure. Performance 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.


Main Memory Transitive Closure Relational Algebra Temporary Result Inverted List 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Amma85]
    Ammann A. C., Hanrahan M. B., and Krishnamurthy R., "Design of a Memory Resident DBMS", Proc. of IEEE COMPCON 1985.Google Scholar
  2. [Banc86]
    Bancilhon F.: "An Amateur's Introduction to Recursive Query Processing Strategies", ACM SIGMOD Proc., May 1986, Austin, Texas.Google Scholar
  3. [Baye77]
    Bayer R., Schkolnick M., "Concurrency of Operations on B-Trees", Acta Informatica, 9, 1977.Google Scholar
  4. [Bem87]
    Bernstein P.A., Hadlacos, Goodman N., "Concurrency Control and Recovery in Database Systems", Addison-Wesley Ed., 1987.Google Scholar
  5. [Bitt83]
    Bitton D., DeWitt D. J., Turbyfill C., "Benchmarking Database Systems: a Systematic Approach", Proc. of the 9th int. Conf. on VLDB, Florence, Nov. 1983.Google Scholar
  6. [Bitt86]
    Bitton D., Turbyfill C., "Performance Evaluation of Main Memory Database Systems", Cornell University, TR 86-731.Google Scholar
  7. [Dewi84]
    DeWitt D., Katz R., Olken F., Shapiro L., Stonebraker M., Wodd D., "Implementation Techniques for Main Memory Database Systems", Proc. of SIGMOD, Boston, June 1984.Google Scholar
  8. [Eich87]
    Eich M. H., "MARS: The Design of a Main Memory Database Machine", 5th IWDM Proc., Karuizawa, Oct. 1987.Google Scholar
  9. [Eswa76]
    Eswaran K. P., Gray J. N., Lorie R., Traiger L. L., "The Notion of Consistency and Predicate Locks in a Database System", Proc. of ACM, V19, No 11, Nov 1976.Google Scholar
  10. [Garc84]
    Garcia Molina H., Lipton R.J., Valdes J. "A Massive Memory Machine", Proc. IEEE COMPCON 1984.Google Scholar
  11. [Gard86]
    Gardarin G., de Maindreville C.: "Evaluation of Database Recursive Programs as Recurrent Function Series", ACM SIGMOD Proc., Austin, May 1986.Google Scholar
  12. [Gibb85]
    Gibbons A., "Algorithmic graph theory", book, Cambridge University Press, 1985.Google Scholar
  13. [Haerd78]
    Haerder T., "Implementing a Generalised Access Path Structure for a Relational Database", Proc. of ACM TODS, Vol. 3, No 3, Sept 1978.Google Scholar
  14. [Hamm79]
    Hammer M., Niamir B., "A Heuristic approach to attribute partitioning", Proc. of ACM SIGMOD, 1979.Google Scholar
  15. [Han85]
    Han J., Lu H., "Some Performance Results on Recursive Query Processing in Relational Database Systems", Proc. Data Engineering Conf., Los Angeles, February 1986.Google Scholar
  16. [Hens84]
    Henschen L.J., Naqvi S.A., "On compiling queries in recursive first-order databases", JACM, Vol. 31, No 1, Jan. 1984.Google Scholar
  17. [Ioan86]
    Ioannidis Y. E., "On the Computation of the Transitive Closure of Relational Operators", Proc. of 12th int. Conf. on VLDB, Kyoto, August 1986.Google Scholar
  18. [Lehm86a]
    Lehman T. J., Carey M.J., "A Study of Index Structure for Main Memory Database Management Systems", Proc. of 12th int. Conf. on VLDB, Kyoto, August 1986.Google Scholar
  19. [Lehm86b]
    Lehman T. J., Carey M.J., "Query Processing in Main Memory Database Management Systems", ACM SIGMOD Proc., Austin, May 1986.Google Scholar
  20. [Lehm87]
    Lehman T. J., Carey M.J., "A Recovery Algorithm for a High-Performance Memory-Resident Database System", Proc. of ACM SIGMOD, San Francisco, May 1987.Google Scholar
  21. [Miss82]
    Missikov M., "A Domain Based Internal Schema for Relational Database Machines", ACM SIGMOD Proc., New-York, June 1982.Google Scholar
  22. [Naka87]
    Nakano R., Kiyama M., "MACH: Much Faster Associative Machine", 5th IWDM Proc., Karuizawa, Oct. 1987.Google Scholar
  23. [Rose86]
    Rosenthal A., Heiler S., Dayal U., Manola F., "Traversal Recursion: A Practical Approach to Supporting Recursive Applications", ACM SIGMOD Proc., Austin, May 1986.Google Scholar
  24. [Sedg84]
    Sedgewick R.: "Algorithms", Book, Addison-Wesley Pub., 1984.Google Scholar
  25. [Seli79]
    Selinger P. G., Astrahan M. M., Chamberlin D. D., Lorie P. A., Price T. G., "Access Path Selection in a Relational Database Management System", Proc. of ACM SIGMOD, Boston, 1979.Google Scholar
  26. [Vald86]
    Valduriez P., Boral H., "Evaluation of Recursive Queries Using Join Indices",Proc. 1st International Conference on Expert Database Systems, Charleston, 1986.Google Scholar
  27. [Vald87]
    Valduriez P., "Join Indices", Proc. of ACM TODS, Vol. 12, No 2, June 87.Google Scholar
  28. [Weik84]
    Weikum G., Schek H., "Architectural Issues of Transaction Management in Multi-Layered Systems", Proc. of the 10th int. Conf. on VLDB, Singapore, Aug. 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Philippe Puchmeral
    • 1
  • Jean-Marc Thevenin
    • 2
  1. 1.Laboratoire MASIUniversité Paris 6ParisFrance
  2. 2.INRIA FranceLe ChesnayFrance

Personalised recommendations