Determining the satisfiability and transitive closure of...

Details Determining the satisfiability and transitive closure of... Determining the satisfiability and transitive closure of...

2006-01-24

2006-01-24

Mofiz, Apu M. (Department: 2165)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000

Reexamination Certificate

active

06990484

ABSTRACT:
A method and computer system for improving the efficiency of execution of a database query that includes conditions is disclosed. Satisfiability of the conditions is analyzed before executing the query. If the conditions are satisfiable, the transitive closure of the conditions is analyzed and the conditions are modified to meet transitive closure, if necessary, before executing the query.

REFERENCES:
patent: 5727196 (1998-03-01), Strauss et al.
patent: 5899993 (1999-05-01), Jenkins, Jr.
UVA ODS Specialist, Applying Conditions and Parameters, Jun. 17, 2002, University of Virginia, pp. 1-18.

Affiliated with

Also associated with

Rating

Determining the satisfiability and transitive closure of... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Determining the satisfiability and transitive closure of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Determining the satisfiability and transitive closure of... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3527632