A data base management system is disclosed in which data entities are records representing nodes in an entity-relationship directed graph. The body of each node represents one of the physical entities to be utilized while the edges of each node represent relationships between that physical entity and other physical entities. Some of the edges are hyperedges to permit the identification of simultaneous relationships with more than one other node. An application of this system to the assignment of telephone outside plant equipment to telephone subscribers is also described.
A data model for an information repository (10) models data as objects (12), the relationships (14) or interdependencies between the data, their physical storage or access information (18) and rules or methods of accessing the data (16).
A data base management system according to the invention stores, retrieves, and modifies data records within a digital computer data base, permitting access to related data records through partnerships joining record pairs. Partnership sets are employed to relate data records on a one-to-one, one-to-many, and a many-to-many basis. The invention facilitates the modelling of real world structures and events in a data base whose logical representation closely depicts those structures and events.
A method is disclosed for increasing the number of procedural language scalar instructions which may be executed on a vector SIMD machine. The method, operative in the compiling of the source-to-object code, utilizes a mapping representation of the source code statements onto a dependence graph and noting that the innermost sensitive level n and loop-independent edges of the program mapped onto the graph can be vectorized if every level n dependence can be reordered to operate as an innermost loop and if there are no cycles after the reordering. This indicates that the code can be vectorized at level n.
A user interface for a database management system uses an interactive display to display information selected from the database in magnitude ordered rows comprising a set of items. Each row is an assertion consisting of a plurality of components including an entity, an attribute and a value of the attribute. The components are arranged in that fixed order in decreasing significance, respectively. In the database management system, the database is itself also stored in this format. A database engine in the database management system utilizes a B-tree index to the database and a meta accessing method for items from the database in a working cache.
Image information units, related with one another in the order of their magnitudes defined for each of a plurality of properties of each image, are prestored in an image information storage and management device. All image information units adjoiningly related by their properties with a main image being displayed on a display are read out of the image information storage and management device, and contracted images of the read-out image information units are displayed as navigators on the display screen, together with the main image.
