DATABASE MANAGEMENT DELETE EFFICIENCY
First Claim
1. A computer-implemented method of managing a database contained in a storage facility, comprising:
- structuring the database to have a plurality of tables having indexes to related rows and having keys with key values associated with particular rows; and
deleting rows in the database tables by deleting keys in indexes related to the rows in an order such that corresponding rows are deleted based on relation to the keys.
1 Assignment
0 Petitions
Accused Products
Abstract
A method, system, and computer program product to efficiently delete data from a database is disclosed. The method, system, and computer program product may include structuring the database to have a plurality of tables having indexes to related rows and having keys with key values associated with particular rows. The method, system, and computer program product may include deleting rows in the database tables by deleting keys in indexes related to the rows in an order such that corresponding rows are deleted based on relation to the keys. The method, system, and computer program product may include ordering the rows to be deleted based on concepts such as hierarchy, spatial locality, temporal locality, frequency of access, number of rows, and value uniqueness. Comparatively closely related relationships may be prioritized to be deleted.
-
Citations
24 Claims
-
1. A computer-implemented method of managing a database contained in a storage facility, comprising:
-
structuring the database to have a plurality of tables having indexes to related rows and having keys with key values associated with particular rows; and deleting rows in the database tables by deleting keys in indexes related to the rows in an order such that corresponding rows are deleted based on relation to the keys. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer-implemented method of managing a database, comprising:
-
receiving a delete request for a first row and a second row of a table of the database, the first row associated with a first value and the second row associated with a second value; determining a third value and a fourth value, both the third value and the fourth value associated with the delete request and with an index, the third value of the first row of the table associated with the first value and the fourth value of the second row of the table associated with the second value; associating the third value with a first key value and the fourth value with a second key value, the first key value of a first key of the index associated with the first row of the table and the second key value of the second key of the index associated with the second row of the table; and ordering the first row to be deleted before the second row when a comparatively closely related relationship includes the first key but not the second key, ordering the second row to be deleted before the first row when a comparatively closely related relationship includes the second key but not the first key, and ordering the first row to be deleted before the second row otherwise. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A computer-implemented method of managing a database, comprising:
-
receiving a request to delete a first row and a second row in a table of a database; determining a first index node of a first value of the first row and a second index node of a second value of the second row of an index of the database; comparing a first relationship involving the first index node and a third index node of the index of the database with a second relationship involving the second index node and the third index node of the index of the database; and setting the first row to be deleted before the second row when the first relationship is a comparatively closely related relationship, setting the second row to be deleted before the first row when the second relationship is a comparatively closely related relationship, and setting the first row to be deleted before the second row otherwise. - View Dependent Claims (18, 19, 20, 21, 22, 23)
-
-
24-29. -29. (canceled)
Specification