Abstract: Disclosed are exemplary embodiments of systems and methods for use in assigning locations to network records. One exemplary system includes a processor coupled to a data structure including network records, each record including a network node identifier and a boundary identifier. The processor is configured to, for each boundary identifier, access each of the network records including the boundary identifier. The accessed records include reference and target network records. Each reference network record includes location data indicative of a location of the network node identified in the reference record within the boundary. The processor is configured to determine an aggregate location as a median of the location data for the network nodes identified in the reference network records and assign the aggregate location to each of the target network records as location data indicative of the location of each network node identified in the target records within the boundary.

Abstract: Disclosed are exemplary embodiments of systems and methods for use in assigning locations to network records. One exemplary system includes a processor coupled to a data structure including network records, each record including a network node identifier and a boundary identifier. The processor is configured to, for each boundary identifier, access each of the network records including the boundary identifier. The accessed records include reference and target network records. Each reference network record includes location data indicative of a location of the network node identified in the reference record within the boundary. The processor is configured to determine an aggregate location as a median of the location data for the network nodes identified in the reference network records and assign the aggregate location to each of the target network records as location data indicative of the location of each network node identified in the target records within the boundary.

Abstract: A system and method for enforcing referential integrity within a database system provides for determination of relevant referential constraints at compile time for an access plan. All referential constraints which are relevant to data changes to the database are identified when the access plan is created. Code necessary for performing referential constraint checks is inserted directly into the access plan at compile time, eliminating the necessity for determining the relevant constraints at run time. Constraint checking can be performed using substantially the same low-level procedural statements already used in the access plan for performing database accesses.

Abstract: A method and apparatus are disclosed for maintaining the referential integrity of a relational database by determining the validity of each new referential constraint which is brought about by the proposed creation or alteration of a data table within the database. All relationships of a newly created or altered data table are first examined for known non-error conditions in which the new referential constraint will not affect other data tables. Next, self-referencing relationships are examined to detect known error situations.

Abstract: Method for reducing data loss during I/O errors and power failure during non-atomic writes to media in a transaction management system using write-ahead logging protocol. A recovery log is written during forward processing. On system restart processing, the log is traversed and a REDO executed. Recovery is effected from detected incomplete log writes or log write failures and uncommitted transactions are undone. A technique is provided in which files having I/O errors are identified, whereby subsequent restart operations are prevented from accessing these files. In one embodiment index files with such error are renamed, serving to indicate that corresponding original files contain errors, and the error index files are automatically rebuilt whereby I/O error on the files causes no data loss. The index file rebuild does not invalidate access plans related to the failed index.

Abstract: A comprehensive pagination facility is described which combines an automatic pagination function with an interactive paginate function. With this technique the operator is allowed to insert both Page End and Required Page End controls, although the automatic pagination function makes page ending decisions during both the creation and revision of text. The operator can then interactively paginate the document while being allowed to view each page ending decision and optionally accept the page break location or reposition the suggested page break location to a different line on the page.

Abstract: In a column layout operation in an interactive word processing system, the unoccupied character escapement along a column example line is automatically evenly distributed by the insertion of an appropriate number of space characters responsive to the stroking of a predetermined function key.

Abstract: A method for the automatic center tab insertion within a column example line comprising the steps of an operator cursor move to a column margin to define an end position; and responsive to a function key stroke, the machine steps of concurrently moving the cursor to the other column margin and counting the text characters of the example; calculating the distance to the column center position; concurrently moving the cursor to the calculated center position, and inserting a centered tab stop control character therein.

Abstract: The automatic tab insertion in those null-entry positions in a tab-stopped positioned multicolumn table having row lines which include text right adjacent the null entries so as to inhibit right-to-left, text-to-null-entry migration in the same row.