Platform for processing semi-structured self-describing data with controlled side effects

• US 8,087,009 B1
• Filed: 02/24/2009
• Issued: 12/27/2011
• 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 CHAN
• Application Number:
  US12/380,164
• Time in Patent Office: 1,036 Days
• Field of Search: None
• US Class Current: 717/143
• 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 predicates, each referring to a set of arguments,

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

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, so that any of said predicates can be defined by referring to other said predicates,

(d) providing a plurality of plans, which are able to be run to generate sets of 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 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) providing a data store which is able to store and retrieve data,

(k) specifying some of said clauses by referring to locations in said data store,

(l) further comprising specifying some of said clauses by specifying an alteration to said data store, so that any predicate or clause may have arbitrary effects on the data store, and

(m) wherein said evaluation means further comprises;

i. altering said data store in accordance with only the clauses that refer to an alteration in said data store and that are also included in a successfully evaluated plan for said input, and in accordance only with the variable values that were tested successfully.

2. The method of claim 1, further:

(a) providing a plurality of caches which are able to store sets of variable values,

(b) storing precomputed valid values of some variables of said specifications in said caches,

(c) providing a plurality of indexes, each of which is able to accept values for a predetermined subset of the variables in one of said caches, and to return all matching sets of the remaining values,

(d) providing an indexing means which is able to create one of said indexes given one of said caches and a predetermined subset of input variables,

(e) and wherein said evaluation means further comprises;

i. generating some variable values by inputting other variable values into said indexes.

3. The method of claim 2, further:

(a) providing an updating means which uses data changes in said data store as values for intermediate variables or results of said plans associated with said specifications associated with said cache, and evaluates a modified version of said plans, which calculates possible inputs from said intermediate or result values, in order to determine whether said cache must be updated, and which portions of said cache must be updated.