Storage and management of semi-structured data

• US 20030145022A1
• Filed: 11/21/2002
• Published: 07/31/2003
• Est. Priority Date: 01/31/2002
• Status: Abandoned Application

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Company (HP Inc.)
• Inventors: Dingley, Andrew Peter
• Application Number:
  US10/303,137
• Publication Number:
  US 20030145022A1
• Time in Patent Office: Days
• US Class Current: 707/204
• CPC Class Codes: G06F 16/284 Relational databases
• CPC Class Codes: G06F 16/86 Mapping to a database

Abstract

Data having a desirable and machine readable structure, but which is not known in advance may be thought of as semi-structured data. Semi-structured data may be represented in Resource Document Framwork (RDF) format, and such documents may be parsed to form a table of triples. Relatively small amounts of data give rise to substantial number of triples, meaning that a triple store for relatively small amounts of data will have relatively large number of rows. A management programme for a triple store monitors the number of occasions on which a given query is executed, and if the frequency of the query exceeds a given threshold, then the triples forming the result set of the query are migrated to an auxiliary triple store, thus reducing the number of rows searchable as a result of execution of the given query.

Claims

1. A database having a principal table of triples, and a management programme adapted to monitor operation of the principal table and migrate triples from the principal table to at least one newly-generated auxiliary table when at least one criterion tested by the programme is met.

2. A database according to claim 1 wherein the management programme is additionally adapted to monitor operation of an auxiliary table and to repatriate one or more triples from the monitored auxiliary table to the principal table in the event at least one criterion tested by the programme is not met.

3. A database according to claim 2 wherein the programme is adapted to test the same at least one criterion in determining whether a triple is to be migrated to an auxiliary table and in determining whether a triple is to be repatriated to the principal table from an auxiliary table.

4. A database according to claim 2 wherein the programme is adapted to test different criteria in determining whether a triple is to be migrated to an auxiliary table and in determining whether a triple is to be repatriated to the principal table from an auxiliary table.

5. A database according to claim 1 wherein the management programme is adapted to test the number of occasions on which a triple is accessed as a result of execution of a query, as a proportion of a number of queries received by the database as a whole.

7. A database according to claim 1 wherein the management programme is adapted to test the number of occasions on which a triple is accessed as a result of execution of a query within a given period of time.

8. A database according to claim 1 wherein the management programme is adapted to test the number of occasions a given query is executed as a proportion of all queries executed.

9. A database according to claim 8 wherein the management programme is adapted to test the number of occasions a given query is executed during the course of execution of a predetermined total number of queries executed.

10. A database according to claim 1 wherein the management programme is adapted to test the number of occasions on which a given query is executed within predetermined period of time.

11. A database according to claim 8 wherein, in the event the at least one criterion tested by the management programme is met, all triples forming the result set to a given query are migrated to an auxiliary table.

12. A database according to claim 1, wherein migrated triples of the same rdf type are migrated to a common auxiliary table.

6. A database according to claim 6 wherein the management programme is adapted to test the number of occasions on which a triple is accessed as a result of execution of a query, as a proportion of a predetermined number of queries received by the database as a whole.