Data processing: database and file management or data structures – File or database maintenance – Synchronization
Reexamination Certificate
2011-01-18
2011-01-18
Alam, Hosain T (Department: 2166)
Data processing: database and file management or data structures
File or database maintenance
Synchronization
C707S626000
Reexamination Certificate
active
07873598
ABSTRACT:
A method and a processing device may be provided for creating a shadow database, having a size being approximately a desired percentage of a size of a relational database. Referential integrity of tables of the relational database may be preserved in the created shadow database. A representation of a connected graph may be created, based on a schema description of the relational database, and may be used to find driving tables and related tables of the relational database. Portions of driving tables of the relational database may be copied to corresponding tables of the shadow database and rows of tables of the relational database, related to the copied portions of the driving tables, may be copied to corresponding tables of the shadow database in a number of iterations until the size of the shadow database is approximately the desired percentage of the size of the relational database.
REFERENCES:
patent: 5701460 (1997-12-01), Kaplan et al.
patent: 5758337 (1998-05-01), Hammond
patent: 6931390 (2005-08-01), Zait et al.
patent: 6951013 (2005-09-01), Lozins
patent: 7058621 (2006-06-01), Wolge
patent: 2004/0226006 (2004-11-01), Russell
patent: 2005/0198074 (2005-09-01), Khayter et al.
patent: 2006/0074858 (2006-04-01), Etzold et al.
patent: 2006/0253473 (2006-11-01), Agrawal et al.
Rayside “A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis”, Derek Rayside, 2001, pp. 143.
Willmor, et al., “Program Slicing in the Presence of Database State”, 20th IEEE International Conference on Software Maintenance (ICSM'04), 2004, pp. 5.
“Reduce Size Requirements for Your Enterprise Application Testing Environment to Facilitate Testing and Development”, Applimation, 2008, pp. 2.
DeBarros,et al., “Binary Checksum Query Better for Big Table Samplings”, Jun. 2007, SQL Server Magazine, Penton Media, Inc., pp. 2.
Chaiyochlarb Chan
De Barros Marcelo M.
Dhanaraj Christina Ruth
Gidewall Kenton
Krishnan Murali R.
Alam Hosain T
Capitol City TechLaw
Irving Richard C.
Microsoft Corporation
Oberly Van H
LandOfFree
Slicing of relational databases does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Slicing of relational databases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Slicing of relational databases will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2668202