http://rdf.ncbi.nlm.nih.gov/pubchem/patent/GB-2366421-A
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_e757fd4fedc4fe825bb81b1b466a0947 |
| classificationCPCAdditional | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/Y10S707-99931 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/Y10S707-99945 |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-24565 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F16-24553 |
| classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F12-00 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F17-30 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F7-00 |
| filingDate | 2001-02-21-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_1e7f63f63e823255853b8debb8fd63e6 |
| publicationDate | 2002-03-06-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | GB-2366421-A |
| titleOfInvention | Ordering relational database operations according to referential integrity constraints |
| abstract | Increasing the efficiency of operations (insert, update, and delete) that are to be performed against an arbitrary relational database by automatically ordering these operations according to the referential integrity constraints defined for the affected tables. An ordering algorithm is described which utilizes the relationship information defined between relational tables in the database, described by primary key column to foreign key column pairs, and the integrity rules for these column pairs. The table order to be used for inserts, and for deletes, is determined, 700, 710, and the tuples created by an application program are then clustered by table and operation type, 720 (and Fig. 4). The insert, update, and delete operations are then performed in turn, 730, 740, 750, following the determined table order for the insert and delete operations. The application developer is relieved of the burden of attempting to structure the application in a manner that avoids violating the referential integrity constraints. Batch-mode write operations are possible, thus reducing the number of network round-trips that must be performed. |
| priorityDate | 2000-03-09-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 22.