An improvement of an approach for representation of tree structures in relational tables

ABSTRACT

The paper introduces an improvement of an approach for tree representation in relational tables. Tree structures are widely used in the area of the computer systems. Often is needed to store trees in relational databases. But the relational model does not supports datatypes for such an objects. The conventional methods to store trees suffer from the limitations of the relational model. The present paper offers some modifications of an existing method - path enumeration model. A number of experiments were conducted and the results show improvement in manipulation time of the trees.

REFERENCES

• 1: Daniel Brandon, Recursive database structures, Journal of Computing Sciences in Colleges, v.21 n.2, p.295-304, December 2005
• 2: Celko, J., Trees and Hierarchies in SQL for Smarties, Morgan Kaufmann, 2004, ISBN 1-55860-920-2
• 3: Thomas H. Cormen , Clifford Stein , Ronald L. Rivest , Charles E. Leiserson, Introduction to Algorithms, McGraw-Hill Higher Education, 2001
• 4: Ramez Elmasri , Shamkant B. Navathe, Fundamentals of database systems, Benjamin-Cummings Publishing Co., Inc., Redwood City, CA, 1989
• 5: IA-32 Intel Architecture Software Developer's Manual Volume 3: System Programming Guide, 2003, www.intel.com
• 6: H F Korth, Database system concepts, McGraw-Hill, Inc., New York, NY, 1986
• 7: Sedgewick R., Algorithms in Java: Parts 1-4, Third Edition, Addison Wesley, 2002, ISBN 0-201-36120-5
• 8: Windows NT/2000 Application Programming Inteface, Borland C++ Builder Help

INDEX TERMS

Keywords:
SQL, hierarchies, path enumeration model, relational databases, relational tables, trees