Patent DE2145386C3 successfully refreshed from Google Patents.
EP0428264A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
A method for generating an access plan in a database system
Assignee: International Business Machines Corp
•
Filing: 1990-10-08
•
Granted: —
•
Expires: 2010-10-08
Abstract
Abstract A system and method for enforcing referential integrity within a database system 10 provides for determination of relevant referential constraints at compile time for an access plan. All referential constraints that are relevant to data changes to the database are identified when the access plan 14 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. Constraints checking can be performed using substantially the same low-level procedural statements already used in the access plan for performing database accesses.
Inventors
- 👤 James Rusell Boykin
- 👤 Lisa Ann Geer Kurzejeski
- 👤 Gary Randall Horn
- 👤 Timothy Ray Malkemus
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-27 16:03
CPC Classifications
G; G06; G06F; G06F17/00; G06F16/00; G06F16/20; G06F16/23; G06F16/2365; Y; Y10; Y10S; Y10S707/00; Y10S707/99931
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
75 words
A method for generating an access plan ( 14 ) for accessing a relational database ( 10 ), comprising the steps of: compiling source language statements into low-level code for inclusion in the access plan; and characterised by: during said compiling step, determining relationships between database objects ( 30, 32 ) involved in processing the source language statements, and inserting low-level code into the access plan to perform constraint checks on the involved database objects.
Claim 2
Independent Claim
75 words
A method for generating an access plan ( 14 ) for accessing a relational database ( 10 ), comprising the steps of: compiling source language statements into low-level code for inclusion in the access plan; and characterised by: during said compiling step, determining relationships between database objects ( 30, 32 ) involved in processing the source language statements, and inserting low-level code into the access plan to perform constraint checks on the involved database objects.
Claim 3
Dependent Claim
48 words
The method of Claim 1, wherein the access plan contains a plurality of access sections ( 16, 18 ) each corresponding to a source language statement, and wherein said inserting step includes linking the constraint check code related to each source language statement to the corresponding access section.
Claim 4
Dependent Claim
36 words
The method of Claim 2, wherein operators in an access section are allowed to perform their functions only if the constraint check code linked to that access section returns an indicator that all constraints are satisfied.
Claim 5
Dependent Claim
51 words
A data processing system including a relational database ( 10, 12 ), said database comprising: a plurality of database objects containing data; and an access plan ( 14 ) containing code for performing database operations; and characterised in that said access plan also contains low-level code for performing preselected constraint checks.
Claim 6
Dependent Claim
51 words
A data processing system including a relational database ( 10, 12 ), said database comprising: a plurality of database objects containing data; and an access plan ( 14 ) containing code for performing database operations; and characterised in that said access plan also contains low-level code for performing preselected constraint checks.
Claim 7
Dependent Claim
54 words
A system of Claim 4, wherein said access plan comprises: a plurality of access sections ( 16, 18 ), each section corresponding to an identified section of database access language source code; wherein the code for performing constraint checks related to each identified section of source code is linked to the corresponding access section.
Claim 8
Dependent Claim
59 words
The system of Claim 5, wherein each access section comprises: a main thread ( 50 ) of low-level code for performing database operations to implement the corresponding section of source code; and a control block ( 54 ) containing pointers to subthreads ( 58, 60 ) of low-level code for implementing the constraint checks related to the access section.
Claim 9
Dependent Claim
16 words
The system of Claim 6, wherein each subthread corresponds to a single constraint to be checked.
Claim 10
Dependent Claim
29 words
The system of Claim 5, Claim 6 or Claim 7 wherein an identified section of database access language source code comprises one command defined by the database access language.
Claim 11
Dependent Claim
36 words
A method for accessing a relational database, comprising the step of: executing an access plan containing database access operators, said access plan having been generated by the method of Claim 1, Claim 2 or Claim 3.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.