JPS59502042A - Hyperage Entity Relationship Database System - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed description of the invention] HyperEtsu Entity Relationship Database System The invention is modeled in the form of a computerized database, particularly a hypergraph. Concerning entity-relationship databases.

Background technology Databases are categorized into four general types. The first type is hierarchical data. modeled in a tree format in a database. Target, i.e. information in the database Items are related to basic items such as leaves, leaves are related by techniques, and branches are related by trunks. can be related. Although this type of database emphasizes hierarchical relationships between data items, This is not appropriate for data such as organizational charts where such relationships are essential. are doing.

Other types of databases are network-like and modeled as directed graphs. be done. Data items in the network (graph nodes or vertices) all have equal weights, or values, and are symbolized by the opposite edges of the graph. interconnected by relationships that are This type of database structure has multiple hierarchies. mutually by related databases, e.g. common suppliers and common warehouses. This is the case for linked inventory items.

A third form of database is modeled by the relational properties of data items.

In such databases, each relationship indicates that each row shares a particular relationship. It is represented by a table that lists one of the objects in the table. Virtually this All the information in a relational database, such as Form a relationship.

The fourth database model is called the entity-relationship model.

This model can also be represented as a directed graph, but the actual data is Relationships between nodes that form vertices and whose edges in a one-way graph are entities represents. Typically, a data record consists of the data item itself and other data records. This is a node that contains both a pointer to a node. The pointer is the edge of the graph, That is, it is used to represent relationships between vertices (data items). child A pointer like Contains display. In this case as well, the entity-relationship model connects the entities of data and these data. such that the relationships between the entities in ψ are specific to the real-world ψ situation being modeled. Compatible with species data. The entity relationship model is the basic model, and the other three models are Some scholars argue that it is a special case of the entity-relationship model.

The present invention addresses this last type of database, namely an entity-relational database. It is related to For one such database, R,G,G,C ate'll's International Conference Management of Data, 5anta l’1onica+ca It is in liforn, ia's 1980Proc, ACM-5IGMOD 144 ” An Entity-based DatabaseUser Inte rface” (May 14-16, 1980) .

A single relationship between two objects is common and a model of a directed graph Some relationships, however well expressed, involve more than one entity. for example,"~ In a relationship such as ``parents of'', there are - children and two parents involved.``parents of...'' This relationship cannot be completely defined unless the relationship between the two parents is determined. Parent's Even if the relationship between the three is simple (e.g., married), such a relationship is It is not essential to the relationship of “parent 1” related to a person, father, mother, and child. In theory, an edge indicating a parent points to one or more vertices at the same time, so It is called Tsuji. For hypergraphs and hyperedges, see C. Berge. Grahsand Hypergraphs” North Holland Inc., New York, 1973 text, especially on pages 389-413. Described in detail.

Because many real-world situations have multiple relationships between data objects, hypergraphs The model is eminently suited to representing data on many real-world situations.

Unfortunately, in the past, digital computers could easily process and It is difficult or difficult to represent such a database in a usable form. was impossible.

Summary of the invention According to one embodiment of the present invention, it can be easily adapted to the hypergraph model and an entity that facilitates the handling, access, and use of various data items in a database A relational database structure is provided. Specifically, each data record (no. ) is the body part that defines the entities that form the vertices of the directed graph. Contains. A data record is also a data record by which a single relationship (edge) is represented as nodes in one, two, or more database systems Contains multiple edge representations that can be used to refer to data entities.

This simple way of representing a database eliminates the digraph problem. automatically discovered, identified, and available for use. This is also a processing software information on hyperedges and a large number of information specified by these hyperedges. Make nodes accessible quickly and directly.

This can be done by exposing such hyperedge information in the database. This information avoids indirection that would otherwise be required. access to information can be made direct and efficient.

Brief description of the drawing Figure 1 is a directed graph showing a hyperedge; Figure 2 is a standard hyperedge representation. Standard representation of a database record for one of the graph nodes in Figure 1; Figure 3 is a member of the HyperEdge database for allocating equipment to equipment users. A block diagram of one application; Figure 4 is a block diagram of an external telephone Generalized block diagram of runt equipment; Figure 5 shows a typical telephone system used to provide service to a particular telephone subscriber. A graphical representation of external plant equipment; Figure 6 shows the inventory of equipment shown in Figure 5. Representation by a directed graph shown; Figure 7 is a hypergraph representation of the connections of the equipment in Figure 5; A complete graph representation of one node of a paragraph graph; Figure 9 shows a typical database record of the nodes in Figure 8 to illustrate the hyperedge representation. code: FIG. 10 is an explanatory block diagram of the database manager shown in FIG. 3.

detailed description Specifically, with reference to Figure 1, the figure shows a representation of a directed hypergraph in terms of cycles. There is. Hypergraphs are a way to represent certain relational data structures. Ru.

Such an entity relationship database is Peter Chen's 8CM Trans. .

on Data Ba5e Systems, Vol, 1. No. 1 (197 6) “The Entity-Relationship Model” "Towards a Unified View of Data" ing. The circles in Figure 1 indicate the vertices of the graph and represent the information entities in the data structure. represent. The arrows are called edges and represent relationships between the entities of the vertex. example For example, node IO is connected to node 12 by edge 16. That is, Entity 10 is related to entity 12 by relationship 16. For example, entity 10 is a part in inventory, entity 12 is the supplier of inventory, and relationship 16 is “Purchased by” It is possible to express the relationship "

Entity 10 is also associated with entity 13 by relationship 17. Entity 13 is part 10 It may be a warehouse where is stored. So far, entities 10.12 and 1 3 and relations 16 and 17 are well known from graph theory and entity relational databases.

The relationship between node 10 and node 14.15 is well known in graph theory, but it is not an entity relationship. This could not be handled efficiently in a database.

Entity 10 is related to entity 14.15 by relationship 18. Edges of the graph in Figure 1 18 represents the relationship between one vertex and two or more other vertices. Because of this, it is called “high fly, ji”. Graphs that include hyperedges are hypergraphs. It is called Fu.

The mathematical properties of such hypergraphs are well known, and C1a de Berge's Graph 1ITIa Hypergraph North Holland Published by New York, 1973, pages 389-413.

Entity 15, following the previous example, is a subassembly of which component 10 is a part. . Entity 14, on the other hand, is a tool for assembling part 10 into subassembly 15. be. According to the database structure of the conventional technology, one part of Edge 18 is Vertech. It is represented by two edges, one going to vertex 14 and one going to vertex 15. birch 7.The relationship between 10.14 and 15 can be deduced from these two relationships and relationship 22. discussed. However, similar relationships for nodes 10.13 and 14 Since 13 is simply a storage warehouse, it does not refer to the tools used for assembly. subordinate Therefore, the fact that such a relationship is indirect in the conventional technology system means that it is not efficient. and increase the time required to resolve certain problems with prior art systems. Not only that, but it also creates the possibility of incorrect inferences. For example, there is a shortage of part 10. , you just need to know which assemblies (e.g. In addition, we would like to know the remaining tools (for example, 14) that will be affected.

This information can also be obtained using conventional technology data structures that have only simple edges. However, this involves removing spurious relationships by adding data to the model. It is necessary to

Furthermore, it is also easy to change the relationship by expressing it in a hypergraph.

For example, when part 10 is no longer part of assembly 15, a single high All you have to do is erase the paetsuji, and no further processing is necessary.

This kind of hypergraph representation of data is useful when there are two or more relationships in the database. This is particularly useful in entity-relational databases that need to include relationships between entities. be. As shown above, the relationship between parts and assembly tools is like this. . A wire connected to an electrical terminal of an electrical connector is another example of such a relationship. Special Certain airline seats, storage blocks on certain magnetic storage disks are other examples.

Each of these situations, and many others like it, can be expressed by hyperedges. and the treatment according to the invention provides significant benefits.

FIG. 2 shows a portion of the hypergraph in FIG. 1, specifically used to represent node 10. It shows a typical database record.

The record of node 10 has one body (that is, entity 10 itself) and multiple records. All edges have node 10 as their starting point. Line (al) to (a4) defines the body of node 10 as a type (for example, a common name of parts) and a specific part. A specific identification number (for example, a serial number) is used for identification. simple edges 16 and 17 are represented by rows bl-b3 and cl-c3, respectively; These are the entities of each node connected to node 10 by edges 16 and 17. Contains the type and entity identification number.

One day of the hyperedge is represented by rows di-d5 in FIG. of this expression The formants are the same as used for simple edges 16 and 17.

The only difference is that one or more connected nodes are related to hyperedges. That's true. These nodes are also represented by type and identification number information. Ru.

Above, the computational simplicity, cleanliness and power of hyperedge representations are less obvious. Since this is not the case, I will discuss it below. First, hyperedge and simple edge are Looks similar to access programs and database manager programs It has become unnecessary to know whether the Accessories Only one set of programs is needed, and this program is completely different from the Edge type. It has become irrelevant. In other words, the basic instructions of a database are It is transparent to the number of nodes pointed to in the structure. This is a user-made application Indicates that the program needs to identify hypergraphs. specific records too Also, since it is specified by the user, the database manager handles all types. It is of considerable value that it has become commonplace to be able to treat edges in the same way. It becomes. These programs can be used for any different database application. can do.

The examples in Figures 1 and 2 show seven hyperedges associated with only three nodes. I want my presence to be noticed. However, even if the number exceeds 2, This allows you to handle any number of nodes. This kind of hyper-edge A simple example is an address formed from a house number, street, city, county, state, and country; Each is conveniently represented as a separate node in a hypergraph.

In particular, if you refer to Figure 3, you will see that the diagram shows a database for which hypergraph representation is useful. 1 shows a general block diagram of an application. The information processing system shown in Figure 3 is based on a magnetic disk. Database 30, data illustrated as being included in the Scpack base manager 31, application program group 32, input device 33 and output It includes a force device 33. The database manager 31 and application program 32 Both are compiled into object code by a compiler program (not shown). computer programs stored in the internal memory of general-purpose data processor 35. It is a program.

The input device 33 is an application program for services requesting information in the database 30. Make a request to Gram 32. Application program 32 satisfies the service request Determine what information is required for specific records or parts of records. form a request for the minutes and forward the request to the database controller 31. .

The application program 32 determines whether hyperedge information is to be inspected based on the user's request. It may be determined whether However, for data--the manager 31 is simply a database database. Simply search for a record or part of a record without considering the entire structure of the record. Ru. Accesses to the database are counted as request nodes and edges to the nodes. through Hypergraph for the purpose of providing requested information or services using You can navigate through the nodes by

The database manager 31's node access routine is accessed from the database 30. Desired information is retrieved and provided to the application program 32 as a value. second level If you think about the code structure, these values are from the record (or part of it) Entity type, identification number and application data for the requested body and edge It is. These values are then formatted by the application program 32 and The input device 33 provides the specific service requested. The result is the output device Transferred to 34. If the value of hyperedge is set by database manager 31 is searched, all application programs are expecting HyperEdge information. 32 provides multi-node hyperedge information in the form necessary to provide the requested service. Combine and format the information appropriately.

Device 33 is a keyboard and device 34 is a display screen, these are human The device 33 may also be an integrated terminal operated by a user of automated electrical or mechanical equipment (e.g. assembly line parts counters) ), and the device 34 is likewise an automatic device (e.g., when the inventory level gets too low, It may also be a purchase slip generator for ordering. In this case, the system in Figure 3 is simple. It is not a pure information provision system but a service provision system. This service (currently Storage management, equipment allocation, ticket issuance, etc.) depend on the availability of information in the database 30. more than that information in order to provide some kind of service to the outside world. I am learning to do things.

The database 30 is generated by a database maintenance facility 36 and kept up to date. It is maintained. Facility 36 also uses a database manager to access database 30. manager 31, which in this case generates records in database 30. , for updating. This activity corresponds to database 30 installations W33 and 34. to completely separate and distinct from use by, but at different times the same personnel may be performed using the same equipment.

Although the present invention has been generally described above with reference to FIGS. 1 to 3, the remaining drawings are Also used to explain in detail specific applications of database representation using ipagraphs. To be. This application uses a telephone to connect a subscriber's telephone to the local exchange. It is a matter of allocating physical equipment (wires, cables, terminal boxes, etc.) to subscribers. Ru.

These allocations remain constant for a relatively long period of time, but if a customer moves, equipment The allocation must be changed. At an exchange that handles hundreds of thousands of customers The allocation of such equipment becomes a large and labor-intensive task. Such an assignment Maximizing change efficiency and minimizing costs is therefore an important task for telephone companies. It is.

Referring now to Figure 4, the diagram shows the An illustration of typical equipment used is shown. All such equipment is located at the exchange 40. Because they are outside the plant, they are called external plant equipment. External plans like this The installation consists of multi-thickness cables such as cables 41 to 45, each of which is It contains a number of pairs of copper wires that are twisted together. In general, such pairs is used to provide telephone service to - customers. Cable is a telephone office For example, f1 cables 41, 42 and 43 and f2 cables cables 43, 44 and 45 are separated by interconnect terminals 46 and 47. There is.

In some regions, external plant interconnection systems have three or more levels. cables (F3, F4, etc.) are required.

Interconnect terminals 44 and 47 are devices for interconnecting pairs of electrical wires. . These are a collection of binding posts (within side set) and the other set (outside set) connecting the line pairs from the other direction (field side) ). In addition, the interconnect terminals are selected with the selected inner pair. This connects the outer pairs of the distribution cable pairs and the feeder cable pairs. have jumper wires that make the physical interconnections between them. The cable and pair are on the switching center side. There is an end on the field side and an end on the field side.

At selected points on cables 41-45 there are distribution terminals 48.

These distribution terminals also connect the cable pairs to those connected to customer homes 51 and 52. Bypass to connect to customer service lines such as drop line 49 or 5o, respectively. has a landing post.

Distribution terminals are typically located at a concentration point in a subscriber's home, either on the sidewalk or on the customer's It will be installed on a utility pole within the premises.

The allocation problem in providing telephone service to telephone subscribers' homes is based on database data. A complete uninterrupted electrical circuit (local local area) between the subscriber's telephone center and the wires, terminals, binding posts and customer service This is a problem of allocating screw wires. After making the assignment once in the database, the service At the point of initiation, a corresponding physical connection must be formed in the field. do not have. The database reflects both unfinished and completed instructions. must be maintained. All equipment is in operation or vacant and ready for new customers. The allocation is generally selected from available equipment. Changing the layout of physical equipment is This is very expensive, so most allocation algorithms It is designed to minimize changes in equipment layout. For example, assigned to a house Equipment remains assigned even after the customer moves. The premise is that new customers They will be moving again and requesting services. On the other hand, a certain sutra After an empirically determined period of time (several months), the probability that the house will be occupied again is low. Therefore, it is a better policy to use the equipment elsewhere.

FIG. 5 is assigned to provide telephone service to house 52 of FIG. Circulating specific equipment. Connecting the exchange 40 in this case to the interconnection terminal 46 Cable 41 is shown as cable "01". assigned to house 52 The particular pair in cable 01 is pair “21”, which is expressed in binary notation “01:2”. 1”. The field edge of pair 01:21 is the binder inside terminal 46. is connected to the ringing post 52. The inner binding post 52 is a jumper It is connected to the outer binding post 302 by a wire. cable 44 The end of the exchange side of the 121st pair (pair 0101:121) is connected to the binder of terminal 46. It is connected to the mounting post 302. At the other end (field end), 0101:121 is connected to the drop line 50 through the distribution terminal 48, and from there I'm going to house 52.

The equipment used in this loop is the type (pair, cable, terminal, etc.), internal It can be seen that it has both an identification number and an optional external identification number. Ru. For example, part of the identification number (e.g. pair 01:21, terminal 46, binding Posts 302) are external and some are internal. (to the node of that equipment) It's a simple pointer. ) The internal identification number is used in the record example in Figure 2. Ru. A common problem is used to manage equipment inventory and at the same time provide service between customers and exchanges. used to assign and reassign these facilities to the loops that provide them. The goal is to create a database that can be used.

Figure 6 shows the inventory of equipment that forms the external plant equipment shown in the graph in Figure 5. A standard representation of the prior art by a forward graph is shown. Each box in Figure 6 is a group. rough vertices, one vertex for each physical fruit in the inventory. It is provided for each body. In this case box 60 is a graphic representing cable 41. The vertex 61 represents the interconnect terminal 46, and the vertex 61 represents the interconnect terminal 46. tex 62 represents pair 01:21 and vertex 63 represents cable 44. I, vertex 64 represents pair 0101:121, and vertex 65 represents Distribution terminal 48 is represented, and vertex 66 represents house 52. These vertices A class is an entity in an entity-relationship database.

The relationships between these entities (the edges of the graph) are indicated by the arrows between the vertices in Figure 6. is expressed by In this case, the arrow 67 indicates that the cable 41 is connected to the terminal 46. Since there is a connection between the two, it represents the relationship of being “connected”. Arrow 68 indicates that the pair is 01:21. Since it is included in the table 41, it represents a relationship of "included". lastly The arrow 69 shows the information that it is “connected” and also the binding post (“ COBP 52”), i.e., information on the switching center side (inside) of the terminal 46. Information on the binding post 52 is displayed. The other arrows in Figure 6 have similar meanings. However, the mutual relationship between the distribution terminal 48 and the house 52 is “handled” and “handled”. , except that the customer service line 50 is omitted for simplicity. will not be explained here.

The inventory information contained in Figure 6 tracks the physical equipment used in the loop plant. It is necessary for However, this does not apply to allocating electrical circuits (loops) to customers. , not particularly convenient. In the seventh session, the arrows (Etsu) between these same vertices are shown. We show other sets of (d) that are more suitable for loop assignments.

In Figure 7, the same vertex (capable vertex) as shown in Figure 6 is shown. 80 is repeated, and a line vertex 80 is added to this.

The graph in FIG. 7 represents the connection of communication lines as distinct from the inventory of parts. times The line (distinguished by the phone number in vertex 80) has three parts: 1:21, versus 0101:121 and the house (related to drop line 50) ing. These three parts are interconnected through terminals. Assignment process For efficiency, pair 01:21 is connected to pair 0101:121. It is desirable to know this directly. At the same time, these interconnects are identified as terminals. You need to know what's going on at the pining post. Hyper Edge 8 1 and 82 simultaneously indicate the connected pair and the terminal through which the connection is made. There is. In the sixth expression, pair-to-pair connections can be detected, but equipment assignment It is very inefficient to further search the database for this purpose.

Interconnection of pair 0101:121 (box 64) and house 52 (box 66) is similarly represented by two hyperedges 83 and 84, which It has the same function as the part. Use jumper wires without changing inventory Please note that physical equipment can be assigned to other circuits using i.e. The connections in FIG. 7 can be changed without changing the inventory in FIG.

The hypergraph in Figure 7 is used to manage the inventory of allocated electrical lines. , while FIG. 6 is used to manage inventory of physical parts. Both of these are telephone subscriptions. It is necessary to treat people appropriately.

Figure 8 is used to represent both the physical equipment and line assignments shown in Figure 4. It shows a graph representation of one node of the hypergraph database. Figure 8 The node represented by indicates the pair 0101:121. As mentioned earlier The node has a body part (box 62) and a plurality of edge parts 82.83.86.87. 88 and 89, and some of them (82, 83) are Hibiscus nojii.

The nodes illustrated in Figure 8 are all nodes in the database for pair 0101:121. Contains all information. The name of this pair found in the external world (pair 0101:121) Note that the front is now a separate entity pointed to by edge 90.

Internal identification of each node is done by an internal number, which identifies the associated record. You can access the code directly. Additionally, all internal reference numbers are You can change an entity's external name without changing it.

Figure 9 shows the database record of the pair 0101:121 using the notation shown in Figure 2. Shows the representation of the code. The main body of the record appears first, but the edges appear first. The number is arbitrary. In such a configuration, specific edges can be found by searching. become. Next, the contents of the data record shown in FIG. 9 will be explained.

First, each physical facility has an internal identity different from the name by which it is known in the outside world. Please note that it is identified by a separate number.

These internal identification numbers are unique to the identified record and thereby This will simplify the management of records by computer, make the name of the external world arbitrary, And make it changeable. As shown in FIG. 8, a special edge 90 is 1 same pair 0101:121”), which is shown in rows gl-g3 in Figure 9. has been done.

The edges in rows c1-C5 and rows f1-f5 are hyperedges, each containing two records. Contains the card identification number. Each body and edge is called “applied data”. contains one or more rows that export database information to the outside world. This information is useful when applied to problems in the world. For example, in row C-5, the edge is The binding post on the child exchange side (this is the binding post on the field side of the terminal) It is shown that it refers to a post (distinguished from a post). In row e-3, the pair is Make sure it is connected to the “blue-green” stub wire inside (not outside) the distribution terminal. shown. No. 1 indicates the loop line of which this pair is a part.

FIG. 10 illustrates a general block diagram of the database manager 31 of FIG. ing. This database manager is of course a computer program. Since the block times are simply implemented between various software modules, It just shows the exchange. In FIG. 10, the request decoder 100 A request for addition to, deletion from, or modification of database 30 is received by.

The decoder 100 decomposes the request (interprets the request command) into seven specific procedures 1 01 to 107 is energized.

Procedure 101 includes external identification information (for example, the pair 0101:121 of node 62 in FIG. ) and obtain an internal identification number (for example, ID 388 of node 62 in FIG. 8). shall be A lookup called external/internal ID list is used to perform this translation. A quad table 108 is maintained. Internal ID is buffer 1 for future use 09 is stored. Using this internal ID number, the fetch node procedure 107 instructs storage manager 110 to retrieve appropriate node data from database 30. obtain. For example, if the data destination 30 resides on a magnetic disk, the storage manager Manager 110 is one of the necessary trunks for the appropriate sector of the disk. Contains the circuitry necessary to explore and access the But the database is Magnetic core, magnetic tape, magnetic bubble, video disk, laser disk and other It may reside in various forms of storage. In either case, the storage manager 110 is a data record given the unique internal ID of that record. Contains all the circuitry necessary to recover. Those skilled in the art will understand how this type of search works. Since this is well known, I will not discuss it further here.

Data records obtained by storage manager 110 are stored in node buffer 111 , where it becomes available for further processing. buffer 1 09 and 111 and the other buffers in Figure 10 store the data items described herein. is merely a storage location in the computer's memory reserved for the purpose of Please be careful. Similarly, list 108 is a contiguously reserved list containing the information described above. It's just multiple storage locations.

Nodes can be created and deleted using procedure 102. procedure 102, the decoder 100 selects the address of unused storage space from the free storage list 112. In response to the response, an internal ID number is assigned to this memory block, and this ID Put the number into buffer 109. The contents of the new node can then be created using the method described below. Therefore, it is generated.

Conversely, nodes that are no longer used (e.g. deleted or no longer used) facility) removes the corresponding content from list 108 and empties the corresponding storage space. It is deleted from the database by adding it to the stored list 112. data The actual data in the base 30 does not need to be deleted immediately; this storage space can be is overwritten by reassigning it to a new node created.

Once some node information has been written to the node bus sofa 111, the main body of the node or specific edges are fetched by procedures 103 and 105, respectively. be able to. At this time, the data of the main body is stored in the buffer 113, and this data is stored here. The data is modified by procedure 104. Newly generated nodes have the same hand It has the main body data inserted into the main body buffer 113 by the continuation 104. similarly In response to an edge fetch request by procedure 105, the edge data is sent to the edge Stored in sofa 114 and used for addition, modification, and deletion by procedure 106 It will be possible.

Procedure 102) to secure an ID number and reserve storage space by the system, (procedure 104), generate edges one at a time (procedure 106) ) creates a new node. A node is created or modified 1 This can then be replaced in the database by procedure 107, which The storage manager 110 transfers data from the node buffer 111 to the database. It is now possible to move the On the other hand, buffer 109.111.113, and The data stored in 114 is processed by other procedures in the 3M application program. available for.

The database manager in FIG. 10 is completely responsive to the hyperedge of the present invention You can see that it is now a Lance parent.

Of course, such hyperedges are written in the edge buffer 114 when they are searched. stored and therefore available for processing. However, the database in Figure 10 As far as managers are concerned, these hyperedges are simply simple (non-hyper) This is edge data that is handled exactly the same as edge data. Hyperedge data It is the application software that provides the ability to know about the It is gram 32.

As an example of the operation of the system shown in Figure 10, Table 1 below shows how new edge information is To add a new edge to the node assuming it has been placed in sofa 114, Shows the required programs.

The routine “addedge” first checks whether an edge already exists at the node. Check. If so, the message indicates that the edge already exists. Go back. If the edge does not already exist, it is added to the node, resulting in A message informing you will be returned.

addedge (node, edgebfr)/main buffer edgebfr Add edge to node */If node has edge>edge bfr;then ret*rrr’exists”;Else add e dgebfr to node; Then return’added”; nd Table 2 uses the “addedge” routine from Table 1 to connect the two nodes. “reIate-node-1od” that generates a hyperedge to other nodes The program for “e” is shown below.

relate node node (node-A, edgebfr A, node-8゜edgebfr　B,　node　C) 7 pieces Esoshiba sofa medium Use the edge of *// book from node A to nodes B and C. Generate Noji, */ /* Generate a second hyperedge from node B to nodes A and C. Director/ Set rid (A) and rid (C) in edgebfr B ;Set rtype(A) and rtype(C) in edgebf r　B；Set rid　(B)　and　rid　(C)　in edgeb fr-^:Set rtype (B) and rtype (C) in e Add edges to nodes A and B. Book/if ad’ dedge(node A, edgebfr-^) andaddedge( node B, edgebfr b) return same messageg e; then return that message; 7 otherwise The messages are different and have errors. ＊／ else return’error”: Finally, Table 3 shows the equipment in the database. Two pairs are connected to each other in a database record useful for assigning The response using “relate-node-node” to indicate that This shows the program for

Table 3 interconnect pair 7 wires This is to connect pair “A” to pair “B” at terminal “ter” *//* This is an application program of */node A = read (pair A) ;node B=read (pair B);node C=rea d (ter);21 7 lines. 7 lines for adding applied data A and data B to the buffer. 1 pair of colors and pins. ingpost and others ne/add data A to edgebfr A ;add data B to edgebfr B; message = r elate node node (node-8.

edgebfr A+node B+edgebfr B, node C); if message=”error”.

print(cannot cross-connect)”.

pair A, “and”, pair B.

"interminal", ter); encl; FIG/ ru;, 8 Record pair 01011121 international search report

Claims (1)

[Claims] 1. Multiple records each containing a body section and multiple edge sections for storing signals at least one of the edges includes a plurality of other records. contains a pointer signal to the characterized by comprising means for accessing and utilizing the signals stored in the record. database. 2. In the database according to claim 1, each of the parts has an entity title. a device including a stored signal representing a program, an entity identification number, and an entity application; database system. 3. In the database set forth in claim 1, further access to the record is provided. database manager program to access, create, delete, and modify A database system comprising: 4. In the database according to claim 1, further stored in the record. A device characterized in that it includes a plurality of user programs for making use of the obtained signals. database system. 5. In the database according to claim 4, the user program specifically including means for selectively allocating resources identified in the notes to resource utilization means; A database system with characteristics. 6. In a database with multiple records in similar formats, Store a signal representing information identifying each of a plurality of assignable facilities in the record. and the means to storing in the record a signal representing each of a plurality of relationships between any two of the equipment; and the means to At least one relationship between three or more of the facilities is included in the record. means for storing signals representative of personnel, and for accessing, modifying, and utilizing such records; A database containing means. 7. In the combination according to claim 6, the equipment is a telephone external plant equipment. including; A combination characterized in that the utilization means includes means for assigning the device to a telephone subscriber. . 8. In the combination set forth in claim 6, the record format is an entity. A combination characterized in that it represents each entry of a relational database. 9. Each record includes a node including a body portion and a plurality of edge portions, A signal representing the identification number and attribute of the physical equipment is stored in each main body of the node. means and A part of the edge part of the record represents a simple edge leading to another node. means for storing the edge signal and the other edge portion of the record at the node; Store hyperedge signals representing hyperedges that reach one or more other nodes in and the means to means for accessing the record to assign the physical facility to a user of the facility; and A database system comprising: 10. Claims characterized in that the physical equipment is external plant equipment for telephones. The combination described in box 9.