Generating a hierarchical plain-text execution plan from a...

Details Generating a hierarchical plain-text execution plan from a... Generating a hierarchical plain-text execution plan from a...

2007-01-23

2007-01-23

Hirl, Joseph P (Department: 2129)

Data processing: artificial intelligence

Adaptive system

C706S045000, C706S046000, C707S793000

Reexamination Certificate

active

10704480

ABSTRACT:
A system, method and computer-readable medium containing computer-executable instructions for tuning queries is provided. A query processor converts a query into an execution plan in a hierarchical format that conforms to a standardized schema. In one embodiment of the invention, the hierarchical format employed is XML.

REFERENCES:
patent: 6330552 (2001-12-01), Farrar et al.
patent: 6456997 (2002-09-01), Shukla
patent: 6654734 (2003-11-01), Mani et al.
patent: 6725212 (2004-04-01), Couch et al.
patent: 6785673 (2004-08-01), Fernandez et al.
patent: 6865567 (2005-03-01), Oommen et al.
patent: 2002/0188600 (2002-12-01), Lindsay et al.
patent: 2005/0138047 (2005-06-01), Liu et al.
Arnon Rosenthal, Cesar Galindo-Legaria, “Query graphs, implementing trees, and freely-reorderable outerjoins,” 1990, International Conference on Management of Data, pp. 291-299.
Neven, F. et al., “Automata-and Logic-Based Pattern Languages for Tree-Structured Data”,Semantics in Databases, Second International Workshop, Jan. 7-12, 2001, 160-178.

Affiliated with

Also associated with

Rating

Generating a hierarchical plain-text execution plan from a... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Generating a hierarchical plain-text execution plan from a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generating a hierarchical plain-text execution plan from a... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3745524