Methods for defining queries, generating query results and displaying same

• US 8,020,110 B2
• Filed: 05/25/2006
• Issued: 09/13/2011
• Est. Priority Date: 05/26/2005
• Status: Expired due to Fees

• Current Assignee: WeiserMazars LLP (Mazars SA)
• Original Assignee: WeiserMazars LLP (Mazars SA)
• Inventors: Hurst, David
• Primary Examiner(s): Augustine; Nicholas
• Application Number:
  US11/440,568
• Publication Number:
  US 20060271884A1
• Time in Patent Office: 1,937 Days
• Field of Search: 715/762, 715/763, 715/765, 715/788, 715/825, 715/848
• US Class Current: 715/765
• CPC Class Codes: G06F 16/3323 using document space presentation or visualization, e.g. category, hierarchy or range presentation and selection
• CPC Class Codes: G06F 16/34 Browsing; Visualisation therefor

Abstract

Documents are grouped into a plurality of subjects. For documents associated with each subject, a document hierarchy is established that includes a plurality of hierarchical levels. A three-dimensional landscape defined by x, y and z orthogonal axes is displayed on a screen, and a plurality of document stacks are arranged in the landscape. Each document stack in the landscape corresponds to a subject, and has a plurality of layers arranged perpendicular to the length of the stack. Each layer in each document stack corresponds to one of the hierarchical levels of the hierarchy established for the subject corresponding to the stack. Images representing documents assigned to each level of the hierarchy are displayed in the layer of the stack corresponding to such level. A user navigates among the document images displayed in the landscape using a cursor.

Claims

1. A method of defining a query and generating a resulting hierarchical tree comprising:

(a) graphically selecting nodes and one or more edges and graphically placing representations of the selected nodes and one or more edges in a graphical user interface in order to create a vertical stack of nodes and one or more edges respectively representing object types and link types;

(b) defining the query based on the stack; and

(c) generating the resulting hierarchical tree by applying the query to an underlying data store, wherein a top node of the stack defines one or more top-level elements in the resulting hierarchical tree, a node below the top node of the stack defines child elements of the one or more top-level elements of the resulting hierarchical tree, and an edge of the stack connecting the top node and the node below the top node defines the relationship between the one or more top-level elements and their child elements in the resulting hierarchical tree.

2. The method of claim 1, further comprising including hierarchical information from recursive data links in the query by inserting a graphical edge connecting a node with itself.

3. The method of claim 1, wherein the query is defined to return multiple linked resulting trees, and the stack comprises two or more stacks with an edge between at least one node in each of the two or more stacks.

4. The method of claim 1, further comprising filtering output from the query using one or more filters placed at a query, tree, object or link level and represented within the graphical user interface as one or more icons.

5. The method of claim 2, further comprising filtering output from the query using one or more filters placed at a query, tree, object or link level and represented within the graphical user interface as one or more icons.

6. The method of claim 3, further comprising filtering output from the query using one or more filters placed at a query, tree, object or link level and represented within the graphical user interface as one or more icons.

7. The method of claim 1, further comprising defining sub queries for identifying subsets of data within the query by adding filter icons and inter-tree links to the graphical user interface that are color coded with a specific color corresponding to the sub query.

8. The method of claim 2, further comprising defining sub queries for identifying subsets of data within the query by adding filter icons and inter-tree links to the graphical user interface that are color coded with a specific color corresponding to the sub query.

9. The method of claim 3, further comprising defining sub queries for identifying subsets of data within the query by adding filter icons and inter-tree links to the graphical user interface that are color coded with a specific color corresponding to the sub query.

10. A computer implemented method of defining a query and generating a resulting hierarchical tree comprising:

(a) graphically selecting nodes and one or more edges and graphically placing representations of the selected nodes and one or more edges in a graphical user interface in order to create a display of nodes and one or more edges respectively representing object types and link types;

(b) defining the query based on the display; and

(c) generating and displaying the resulting hierarchical tree in the graphical user interface by applying the query to an underlying data stores,

wherein a first node of the display defines one or more top-level elements in the resulting hierarchical tree, a second node of the display adjacent to the first node of the display defines one or more child elements of the one or more top-level elements of the resulting hierarchical tree, and an edge of the display connecting the first node of the display and the second node of the display defines a relationship between the one or more top-level elements and the respective one or more child elements in the resulting hierarchical tree.