US4698752A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data base locking
Assignee: Nokia Bell Labs
•
Filing: 1986-04-29
•
Granted: 1987-10-06
•
Expires: 2006-04-29
Abstract
Abstract A data base system is disclosed in which records are locked out during record changing by using a dynamically generated directed acyclic graph of the records. The edges of the graph, stored in the records themselves, point toward a "root" record representing multiply-shared information. An application to the assignment of telephone facilities to telephone subscribers is also described. A transaction list is maintained to identify locked out records previously locked out during the same transaction.
Inventors
- 👤 Alan J. Goldstein
- 👤 Terry R. Nusser
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 13:32
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/466; G06F16/00; G06F16/90; G06F16/901; G06F16/9024; Y; Y10; Y10S; Y10S707/00; Y10S707/953; Y10S707/956; Y10S707/99931; Y10S707/99938
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
86 words
In a data base management system, a method for locking records comprising the steps of (1) creating a directed acyclic locking graph of information records in said data base system, said locking graph associating related subsets of said records with a common root record, (2) accessing a record in said data base system, (3) for each record accessed, using said locking graph to identify a closest root record of said accessed record, and (4) locking said root record to prevent concurrent access to said accessed record.
Claim 2
Dependent Claim
86 words
In a data base management system, a method for locking records comprising the steps of (1) creating a directed acyclic locking graph of information records in said data base system, said locking graph associating related subsets of said records with a common root record, (2) accessing a record in said data base system, (3) for each record accessed, using said locking graph to identify a closest root record of said accessed record, and (4) locking said root record to prevent concurrent access to said accessed record.
Claim 3
Dependent Claim
47 words
The method of locking records according to claim 1 wherein said step of creating a directed acyclic locking graph further includes the step of (5) providing in each said record a storage location for identifying a next nearest neighbor to said record in said directed acyclic graph.
Claim 4
Dependent Claim
53 words
The method of locking records according to claim 1 further including the steps of (5) maintaining a list of records previously locked, (6) checking the present record against said list before performing steps (3) and (4), and (7) performing steps (3) and (4) only if said list does not include the present record.
Claim 5
Dependent Claim
48 words
The method of locking record according to claim 1 wherein step (1) comprises the substeps of (1a) associating said records in a "used in" or "included in" hierarchy, and (1b) selecting edges for said directed acyclic locking graph representing said "used in" or "included in" relationship between records.
Claim 6
Dependent Claim
88 words
Apparatus for providing data locking in a data base system including a plurality of records, said apparatus comprising means for representing a directed acyclic locking graph of all of said records, said locking graph identifying related subsets of said records showing a common root record, means for accessing a record in said data base system, means, utilizing said graph representation, for locating a root record closest to said accessed record in said graph, and means for locking said root record to prevent further access to said accessed record.
Claim 7
Dependent Claim
88 words
Apparatus for providing data locking in a data base system including a plurality of records, said apparatus comprising means for representing a directed acyclic locking graph of all of said records, said locking graph identifying related subsets of said records showing a common root record, means for accessing a record in said data base system, means, utilizing said graph representation, for locating a root record closest to said accessed record in said graph, and means for locking said root record to prevent further access to said accessed record.
Claim 8
Dependent Claim
29 words
Apparatus according to claim 5 further comprising means in each said record except said root records for storing at least one of the edges of said directed acyclic graph.
Claim 9
Dependent Claim
33 words
Apparatus according to claim 5 further comprising means for storing a list of records previously locked, and means for disabling said locating and locking means if said accessed record is on said list.
Claim 10
Independent Claim
78 words
A method for locking selected record subsets in a data base system said method comprising the steps of (a) including, in each record of said data base, an identification of another data base record, said identifications together representing a directed acyclic locking graph for one of said subsets, (b) utilizing said identifications to identify a closest root record of said acyclic locking graph and (c) locking said root record to prevent concurrent access to said record being accessed.
Claim 11
Independent Claim
78 words
A method for locking selected record subsets in a data base system said method comprising the steps of (a) including, in each record of said data base, an identification of another data base record, said identifications together representing a directed acyclic locking graph for one of said subsets, (b) utilizing said identifications to identify a closest root record of said acyclic locking graph and (c) locking said root record to prevent concurrent access to said record being accessed.
Claim 12
Dependent Claim
99 words
Apparatus for locking only selected record subsets in a data base system, said apparatus comprising means for including, in selected ones of said data base records, a pointer to one other data base record, said identifications together comprising a directed acyclic graph for at least one selected record subset, means for testing said acyclic locking graph to identify a root record thereof when attempting to access a data base record, means for locking said root record if not already locked, and means for preventing access to said data base record being accessed if said root record is already locked.
Claim 13
Dependent Claim
99 words
Apparatus for locking only selected record subsets in a data base system, said apparatus comprising means for including, in selected ones of said data base records, a pointer to one other data base record, said identifications together comprising a directed acyclic graph for at least one selected record subset, means for testing said acyclic locking graph to identify a root record thereof when attempting to access a data base record, means for locking said root record if not already locked, and means for preventing access to said data base record being accessed if said root record is already locked.
References Cited (Backward Citations)
US3422401A
Cited
US3435418A
Cited
US3916387A
Cited
US4086628A
Cited
US4276597A
Cited
US4468732A
Cited
US4399504A
Cited
US4476528A
Cited
US4439830A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1990-10-05 | 1991-04-06 | 1991-10-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-10-05 | 1995-04-06 | 1995-10-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-10-05 | 1999-04-06 | 1999-10-06 | $7700.00 | Window Closed / Lapsed |