Abstract: A content management system is provided including a plurality of tables forming a tree-based storage hierarchy. The system includes a library server having a stored procedure which creates a hierarchical tree-based storage structure having any number of child components horizontally and any number of component types vertically thus specifying a tree topology. Advantageously, a single invocation of the stored procedure will create the specified tree-based data storage structure which is stored in the library server.

Abstract: A content management system is provided including a plurality of tables forming a tree-based hierarchy for storing information such as item information. An information retrieval interface is provided to facilitate retrieval of information from the tree-based table hierarchy. The number of cursors employed for retrieving information is dynamically variable with the number of tables in the hierarchy. Advantageously, the content management system permits tables to be added or appended to the initial tree-based table hierarchy after the database is created. The number of cursors is dynamically varied to accommodate the additional cursors needed to query the additional table or tables.

Abstract: A content management system is provided including a plurality of tables forming a tree-based storage hierarchy. The system includes a stored procedure which enables information to be retrieved from different arbitrary locations throughout the storage hierarchy. Advantageously, the system retrieves information from both simple and complex tree-based storage hierarchies.

Abstract: An improved method for routing interconnect lines in a VLSI chip using repeaters. First, an optimal virtual assignment of the repeater locations is determined according to a suitable method. The "virtual" assignment is the ideal location irrespective of where logic blocks which could form a repeater cell might located. Next, repeaters are assigned to physical locations close to the optimal virtual locations. Finally, an optimal global routing is done using the physical locations of the repeaters. The optimal global routing revises the original global routing upon which the original optimal virtual assignment of repeaters was done. Preferably, blocks of circuitry and routing channels are identified first. Instead of simply routing the interconnect lines through the channels, a portion of the interconnect lines are routed through available spaces in the blocks themselves. This will reduce the number of turns required both through the channels and to reach a repeater.