Platform for processing semi-structured self-describing data with aggregating clauses

• US 8,219,972 B1
• Filed: 02/24/2009
• Issued: 07/10/2012
• Est. Priority Date: 12/26/2002
• Status: Expired due to Fees

• Current Assignee: Judson Ames Cornish
• Original Assignee: Judson Ames Cornish
• Inventors: Cornish, Judson Ames
• Primary Examiner(s): Dao, Thuy
• Application Number:
  US12/380,165
• Time in Patent Office: 1,232 Days
• Field of Search: None
• US Class Current: 717/117
• CPC Class Codes: G06F 16/83 Querying
• CPC Class Codes: G06F 8/00 Arrangements for software engineering testing or debugging G06F11/36; administrative, planning or organisation aspects of software project management G06Q10/06
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching

Abstract

An Extensible Markup Language (XML) Application Server for storing, processing, communicating, and displaying dynamic semi-structured information. It comprises a declarative specification language, a transactional indexed XML data store, and an XML application server engine. An integrated architecture (a) provides for optimization, indexing, and backtracking search in a business logic layer, (b) provides for general-purpose programming idioms including recursive function definitions, iteration, and dynamic dispatch in data layer queries and updates, and (c) eliminates processing overhead and maintenance issues caused by transforming between relational, object-oriented, and semi-structured data paradigms.

Claims

1. A method, executed by a programmable processor, of specifying, generating, and running a data processing system, comprising the steps of:

(a) providing a plurality of specifications, each of which defines valid argument values for said predicates, and refers to;

(b) providing a plurality of predicates, each referring to a set of arguments,

i. a set of variables, and

ii. a set of clauses,

(c) specifying some clauses of said specifications by referring to one of said predicates, and to variables of the specification to specify values for arguments of the predicate,

(d) providing a plurality of plans, which are able to be run to generate sets of said valid argument values for said predicates,

(e) providing a planning means which is able to generate said plans from said specifications,

(f) providing an evaluation means which is able to run said plans to generate sets of said valid argument values,

(g) providing an input means which is able to provide input data values for a set of the arguments of a predicate,

(h) providing an output means which is able to output data,

(i) inputting argument values from said input means, evaluating input argument values to generate output argument values using said evaluation means, and outputting argument values using said output means,

(j) specifying some of said clauses by referring to;

i. a set of generating clauses, which will generate a plurality of iterations, each with a set of valid variable values, and

ii. a set of aggregating clauses, which specify arbitrary predicate relations between

     1) a further set of variable values in a current iteration and

     2) a further set of variable values in the previous iteration, whereby users of the system can define any computable result of the iterations.