SYSTEM FOR QUERYING A RELATIONAL DATABASE USING SCHEMA-LESS QUERIES

摘要

The invention provides, in one aspect, a method of searching an RDF triples data store of the type in which the triples are maintained in accord with a first storage schema. The method includes inputting a first query specifying RDF triples that are to be identified in the data sore (Figure 1A, 114C). That first query assumes either (i) that the triples are stored in a schema-less manner (i.e., with no storage schema) (Figure 3, 612A) or (ii) that the triples are maintained in accord with a second storage schema that differs from the first. The method further includes generating, from the first query, a second query that specifies those same RDF triples, yet, that reflects the first storage (Figure 3, 612B) schema. That second query can be applied to the RDF triples data store in order to identify and/or retrieve the desired data (Figure 1A, 114C).