Reforming queries to selectively audit accesses to rows...

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000, C707S793000, C707S793000

Reexamination Certificate

active

07127448

ABSTRACT:
One embodiment of the present invention provides a system that selectively audits accesses to a relational database. The system receives a query at the relational database and modifies the query so that processing the query causes an audit record to be created and recorded for rows in relational tables that are accessed by the query and that satisfy an auditing condition. Next, the system processes the modified query to produce a query result. This processing causes an audit record to be created for rows in relational tables that are accessed by the query and that satisfy the auditing condition. The system records the audit record in an audit record store, and then returns the query result. In one embodiment of the present invention, if the query includes a select statement, the system inserts a case statement into the select statement. This case statement calls a function that causes the audit record to be created and recorded if the auditing condition is satisfied. In a variation on this embodiment, the case statement is evaluated near the end of the query processing so that the case statement is evaluated only after other conditions of the query are satisfied. In this way, an audit record is created only for rows that are actually accessed by the query.

REFERENCES:
patent: 5404509 (1995-04-01), Klein
patent: 5428737 (1995-06-01), Li et al.
patent: 5600206 (1997-02-01), Cashin
patent: 5625815 (1997-04-01), Maier et al.
patent: 5725240 (1998-03-01), Kurita
patent: 5822750 (1998-10-01), Jou et al.
patent: 5864750 (1999-01-01), Fossaceca et al.
patent: 5940819 (1999-08-01), Beavin et al.
patent: 5987455 (1999-11-01), Cochrane et al.
patent: 6041310 (2000-03-01), Green et al.
patent: 6064951 (2000-05-01), Park et al.
patent: 6092062 (2000-07-01), Lohman et al.
patent: 6374267 (2002-04-01), Tam
patent: 6382357 (2002-05-01), Morrison et al.
patent: 6931573 (2005-08-01), Adams et al.
patent: 2003/0014394 (2003-01-01), Fujiwara et al.
patent: 0 723 238 (1996-07-01), None
patent: WO 99/52047 (1999-10-01), None
Kenneth A. Ross. Conjuntive selection condition in main memory, (Synposium of Principles of Database System, year 2002, p. 109-120.□□.
Benveventano et al. Description logics for semantic query optiminzation oin object-oriented database systems. ACM transaction on Database System (TODS), year 2003, p. 1-50.
Llirbat et al. Eliminating costly redundant computations from SQL trigger executions. International Conference on Management of Data, year 1997, pp. 428-439.□□.
Barry Lewis. Rules for Co-Existence of P—P and P-MP system uing differnet acess methods in teh same frequency band: ESTI TM4 Work Item DTR/TM04069. Year Apr. 26, 2000.
Elder et al. Minutes: TC-10 Subcommittee on ADCs. year Sep. 30, 1999-Oct. 1, 1999.
Bhargava et al. Relational database system with zero information loss, Knoweledge and Data Engineering, IEEE Transactions, date: 1993, pp. 76-87.
Publication: “Access control in a relational data base management system by query modification” by Stonebraker and Wong, Proc.ACM Ann. Conf. San Diego, CA, Nov. 1974, pp. 180-187.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Reforming queries to selectively audit accesses to rows... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Reforming queries to selectively audit accesses to rows..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reforming queries to selectively audit accesses to rows... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3669941

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.