Abstract: As a conflict resolution system for the modification/editing of databases, the mechanism “for assigning priority to editing based on more up-to-date information” is disclosed. The system is effective in both full-fledged “parallel DB editing” in which a computer holds duplicated DBs permanently and the case in which a computer holds the duplicated DBs temporarily. The method is characterized in that “editing based on old information is determined to be ineffective.” When the information for which a conflict is predicted is edited, the possibility that the editing becomes ineffective can be reduced by a “substantially online operation” which performs “the synchronization with the up-to-date information, the editing, and the transmission of the editing records” quickly.

Abstract: As a conflict resolution method for the modification/editing of databases, the mechanism “for assigning priority to editing based on more up-to-date information” is disclosed. The method is effective in both full-fledged “parallel DB editing” in which a computer holds duplicated DBs permanently and the case in which a computer holds the duplicated DBs temporarily. The method is characterized in that “editing based on old information is determined to be ineffective.” When the information for which a conflict is predicted is edited, the possibility that the editing becomes ineffective can be reduced by a “substantially online operation” which performs “the synchronization with the up-to-date information, the editing, and the transmission of the editing records” quickly.

Abstract: As a conflict resolution method for the modification/editing of databases, the mechanism “for assigning priority to editing based on more up-to-date information” is disclosed. The method is effective in both full-fledged “parallel DB editing” in which a computer holds duplicated DBs permanently and the case in which a computer holds the duplicated DBs temporarily. The method is characterized in that “editing based on old information is determined to be ineffective.” When the information for which a conflict is predicted is edited, the possibility that the editing becomes ineffective can be reduced by a “substantially online operation” which performs “the synchronization with the up-to-date information, the editing, and the transmission of the editing records” quickly.

Abstract: Fundamental methods, memory systems and processors systems to synchronize replicas of data by exchanging editing plans to replicas are first explained in Section 1. Other sections show derived methods and systems. Major derived methods and systems are expressed as independent claims. Section 2 shows synchronization supported by server providing relay function. Updating of replica is performed, using editing plans arranged in a sequence determined by the server. Section 3 shows synchronization supported by server providing ordinal numbers. Updating of replica is performed, using editing plans arranged in a sequence of ordinal numbers provided by the server. Section shows synchronization keeping reference consistency. Section 5 shows synchronization of edited data and edited definition of data. Even if definition of data is edited, replicas can synchronize each other. Section 6 shows synchronization by version control, which removes editing plans with old version before updating of replicas.

Abstract: Fundamental methods, memory systems and processors systems to synchronize replicas of data by exchanging editing plans to replicas are first explained in Section 1. Other sections show derived methods and systems. Each derived method and system is expressed as an independent claim. Section 2 shows synchronization supported by server providing relay function. Updating of replica is performed, using editing plans arranged in a sequence determined by the server. Section 3 shows synchronization supported by server providing ordinal numbers. Updating of replica is performed, using editing plans arranged in a sequence of ordinal numbers provided by the server. Section 4 shows synchronization keeping reference consistency. Section 5 shows synchronization of edited data and edited definition of data. Section 6 shows synchronization by version control, which removes editing plans to a replica with old version before updating of replicas.

Abstract: Fundamental methods, memory systems and processors systems to synchronize replicas of data by exchanging editing plans to replicas are first explained in Section 1. Other sections show derived methods and systems. Each derived method and system is expressed as an independent claim. Section 2 shows synchronization supported by server providing relay function. Updating of replica is performed, using editing plans arranged in a sequence determined by the server. Section 3 shows synchronization supported by server providing ordinal numbers. Updating of replica is performed, using editing plans arranged in a sequence of ordinal numbers provided by the server. Section 4 shows synchronization keeping reference consistency. Editing plans containing data of changing reference indicating said next destination block are delivered. Actual operation of changing a reference to the next destination block is performed, when current destination block is accessed.

Abstract: In columns of a table, a list of labels of records of a table referenced by the table as a relation is displayed. A correlational display function of the record of interest enables information on a table involving an operator to be grasped in one table. When a record of the table of the reference origin is selected, a record referenced by the selected record is highlighted. Conversely, when a record of the reference destination is selected, the record of the reference origin referencing the selected record is highlighted and the related record is displayed in the same line or in the neighborhood. The reference, addition or change of a record of the reference destination can be intuitively performed around the table of the reference origin. A new record can be added to the reference destination during the addition of a record to the table of the reference origin. Information on the table of the reference destination is allowed to be grasped and managed with only an operation focusing on one table.

Abstract: Introduced is information that indicates a changing of “a reference that points a referenced record” to “another reference that points another record”. This information is named as “changing reference information (CRI)” and is registered to a referred record. When accessing a referencing record, there is a possibility to access referenced record by necessity of a program or an operator. At this time, CRI registered to originally referenced record is accessed. And the reference is changed to new record as indicated by the CRI. Thus, status of a DB in a device is changed by the invention. When PCs have reproduced DBs that are copy of the original and edit their own reproduced DBs so as to change a reference, these editorial contents with CRI will be propagated to other PCs. Other PCs change references of their reproduced DBs according to the CRIs.

Abstract: Presented is a method and an apparatus that change references between computer-objects that are memory blocks. Purpose is to change all references to a specific computer-object, which is called current-destination-object, into another object, which is called next-destination-object. For this purpose, information showing the next-destination-object, which is called as order-information, is attached to the current-destination-object. Reference of each computer-object is changed by tracing these computer-objects, references and order-information in order of the followings: A source-object, reference held by the source-object, next-destination-object indicated by the reference, and order-information (showing the next-destination-object) that is attached to the current-destination-object. Finally, the reference is changed so as to indicate the new destination object.

Abstract: Computers duplicate all or part of the data in DB originals, hold the duplicates therein, and parallel edit the duplicates (alteration edit). Data defining the items of the data, in addition to the data recorded in DBs, is parallel edited. When the result of edit of an item table is judged to be effective through a process of parallel edit, the structure of the data is altered according to the contents. Although conventionally only “item designing before data input” or “item edit except inhibited parallel edit” is possible, the present invention enable parallel edit of items even after data input.

Abstract: Apparatus holds a replica of the original object that is editable by apparatuses equivalent to a computer. The apparatus creates a packet of editorial contents to the replica, send the packet to a server or other apparatuses, and receives a packet of editorial contents to another replica held by another apparatus. The apparatus judges an order of packets by information from a server, and updates the replica by each packet. When apparatuses use same initial replicas, same sequence of packets and same updating procedure, replicas of them synchronize each other on common axis that is a sequence of packets.

Abstract: In columns of a table, a list of labels of records of a table referenced by the table as a relation is displayed. A correlational display function of the record of interest enables information on a table involving an operator to be grasped in one table. When a record of the table of the reference origin is selected, a record referenced by the selected record is highlighted. Conversely, when a record of the reference destination is selected, the record of the reference origin referencing the selected record is highlighted and the related record is displayed in the same line or in the neighborhood. The reference, addition or change of a record of the reference destination can be intuitively performed around the table of the reference origin. A new record can be added to the reference destination during the addition of a record to the table of the reference origin. Information on the table of the reference destination is allowed to be grasped and managed with only an operation focusing on one table.

Abstract: Conventionally and generally, a plurality of computers access a database provided in a server. According to the inventions, generally-called full-fledged “parallel DB edit” using computers permanently holding duplicate DBs is presented. Computers exchange edit information on the duplicate DBs, and the duplicate DBs of the computers synchronize with one another. Each of all the relevant PCs takes out the local-edit records in the other PCs in a unique order (such as the order of arrival at the server) and updates the local original DB thereof. The edit information including the same contents is processed in the same order with the same logic, and then the local original DBs are updated. Therefore, the resultant local original DBs of the PCs also synchronize with one another. The synchronization is established not along with real time axis but along the common time axis which is the order of edit records.

Abstract: Provided is a database operation method which modifies references among database records. A record is fetched (0301), a reference destination record that is set to the record is specified (0302), “changing reference destination modification” that is set to the reference destination record is specified (0303), a reference destination modification process corresponding to the reference destination modification information is invoked (0304), and the newly obtained reference destination is set as a new reference destination of the fetched record (0305). Moreover, copies of the original database are created in plural number of computers and editorial contents on the copies are reflected to the original database by a database management method. A base version of a database is recorded for each record and editorial contents on newest base version are made to be valid.

Abstract: Introduced is information that indicates a changing of “a reference that points a referenced record” to “another reference that points another record”. This information is named as “changing reference information (CRI)” and is registered to a referred record. When accessing a referencing record, there is a possibility to access referenced record by necessity of a program or an operator. At this time, CRI registered to originally referenced record is accessed. And the reference is changes to new record as indicated by the CRI. Thus, status of a DB in a device is changed by the invention. When PCs have reproduced DBs that are copy of the original and edit their own reproduced DBs so as to change a reference, these editorial contents with CRI will be propagated to other PCs. Other PCs change references of their reproduced DBs according to the CRIs.

Abstract: In a solar cell, at least one of reinforcing material and buffering material is provided at least partially on at least one of a back surface, a front surface and a side surface of the solar cell. With these reinforcing material and/or buffering material, occurrence of cell fracture due to load imposed by external force can be decreased.

Abstract: The object of the invention is to provide a solar panel and a method for manufacturing the same, wherein the manufacture of the solar panel for use in space and repair work thereon can be performed easily and in little time. An entirety of the solar panel is configured by detachably linking a plurality of unit solar cell modules, which include a plurality of solar cells and connection wires for connecting the solar cells, and electrically connecting the unit solar cell modules to one another. Thus, a solar panel can be easily fabricated by combining standardized unit solar cell modules. Moreover, by simply mechanically connecting the unit solar cell modules, they can be electrically connected, and thus the time necessary for manufacture or repair of solar panels can be shortened.

Abstract: This invention introduces class identification information for identifying the class of an object and makes it easy to retain, reproduce and transfer the object. An object tree as a tree-like structure for storing objects is also devised. A pointer can be retained and transferred by giving the object identification information to the object and converting the pointer to the combination of the object identification information. This invention is convenient for handling logic models representing various logical relationships. When elements of information distributed to a plurality of computers connected to a communication network such as an internet are linked together and a large scale logic model is reproduced, only the portion necessary for processing can be reproduced. When the invention is applied to three-dimensional space display, a continuous broad space can be reproduced as a space in which only necessary portions are conyinued.

Abstract: In a solar cell, at least one of reinforcing material and buffering material is provided at least partially on at least one of a back surface, a front surface and a side surface of the solar cell. With these reinforcing material and/or buffering material, occurrence of cell fracture due to load imposed by external force can be decreased.

Abstract: The object of the invention is to provide a solar panel and a method for manufacturing the same, wherein the manufacture of the solar panel for use in space and repair work thereon can be performed easily and in little time. An entirety of the solar panel is configured by detachably linking a plurality of unit solar cell modules, which include a plurality of solar cells and connection wires for connecting the solar cells, and electrically connecting the unit solar cellmodules to one another. Thus, a solar panel can be easily fabricated by combining standardized unit solar cellmodules. Moreover, by simply mechanically connecting the unit solar cell modules, they can be electrically connected, and thus the time necessary for manufacture or repair of solar panels can be shortened.