Query Compilation Optimization System and Method

• US 20120066205A1
• Filed: 03/14/2011
• Published: 03/15/2012
• Est. Priority Date: 03/14/2010
• Status: Abandoned Application

• Current Assignee: Intellidimension Inc.
• Original Assignee: Intellidimension Inc.
• Inventors: Chappell, Geoffrey, Repchick, Derrish
• Application Number:
  US13/047,347
• Publication Number:
  US 20120066205A1
• Time in Patent Office: Days
• US Class Current: 707/713
• CPC Class Codes: G06F 16/24535 of sub-queries or views

Abstract

A system and method of compiling a query involving clumping contiguous constraints of a query into one or more subqueries based on partition organization parameters and evaluating each subquery against a partition of a graph having data records for the corresponding partition organization parameter value. In one example, clumping of contiguous query constraints based on an RDF data component, such as a subject, may be used to evaluating subqueries of a query against one or more partitions of a graph having RDF data records with that subject.

Claims

1. A method of optimizing query compilation, the method comprising:

receiving one or more constraints of a query;

identifying contiguous constraints having the same partition organization parameter value;

clumping the contiguous constraints by partition organization parameter;

organizing each clumping of constraints into a subquery;

compiling each subquery; and

evaluating each subquery against a partition of a graph, the partition having data records for the corresponding partition organization parameter value.