IP Library Patent Application 12233506
Patent Application
App. No. 12/233,506

Apparatus and Method for Displaying Hierarchical Data

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
12/233,506
Abstract

A computer readable storage medium includes executable instructions to receive a request for tree node information and apply one or more tree node parameter limits to the request. The tree node parameter limits include a tree node level limit and a sibling node count limit. The computer readable storage medium further includes executable instructions to receive tree node objects corresponding to the tree node parameter limits, add the tree node objects to a dynamically extended tree node data structure and display a first portion of the tree node objects.

Claims (27)

1 . A computer readable storage medium comprising executable instructions to:

receive a request for tree node information;

apply one or more tree node parameter limits to the request, wherein the tree node parameter limits comprise at least one of a tree node level limit and a sibling node count limit;

receive tree node objects corresponding to the tree node parameter limits;

add the tree node objects to a dynamically extended tree node data structure; and

display a first portion of the tree node objects.

2 . The computer readable medium of claim 1 , wherein the executable instructions to display the first portion of the tree node objects further comprises executable instructions to render the first portion of the tree node objects in a Document Object Model (DOM) structure corresponding to the tree node data structure.

3 . The computer readable medium of claim 1 , further comprising executable instructions to display a second portion of the tree node objects.

4 . The computer readable medium of claim 3 , wherein the executable instructions to display the second portion of the tree node objects further comprises executable instructions to render the second portion of the tree node objects in a Document Object Model (DOM) structure corresponding to the tree node data structure.

5 . The computer readable medium of claim 1 , further comprising executable instructions to receive additional tree node objects corresponding to one or more additional tree node parameter limits.

6 . The computer readable medium of claim 5 , further comprising executable instructions to add the additional tree node objects to the dynamically extended tree node structure based on identifying one or more hierarchical relationships between the tree node objects and the additional tree node objects.

7 . The computer readable medium of 1 , wherein the executable instructions to add the tree node objects comprise executable instructions to dynamically extend an object definition corresponding to the tree node objects.

8 . The computer readable medium of 1 , wherein the tree node parameter limits are specified using a plurality of Extensible Markup Language (XML) Hyper Text Transfer Protocol (HTTP) requests.

9 . The computer readable medium of 1 , further comprising executable instructions to receive the tree node objects in a Java Script Object Notation (JSON) format.

10 . A computer readable storage medium comprising executable instructions to:

receive one or more tree node parameter limits, wherein the tree node parameter limits comprise at least one of a tree node level limit and a sibling node count limit;

retrieve tree node objects corresponding to the tree node parameter limits; and

deliver the tree node objects.

11 . A computer readable storage medium, comprising executable instructions to:

request a set of node objects in a hierarchical data structure, wherein each node object in the set includes a definition;

receive the set of node objects, wherein each node object represents a connected part of the hierarchical data structure; and

extend the definition of each node object in the set.

12 . The computer readable storage medium of claim 11 , wherein the executable instructions to extend the definition of each node object include executable instructions to update a node object within an annotation comprising at least one of a child annotation and a sibling annotation.

13 . The computer readable storage medium of claim 12 wherein the sibling annotation is selected from a first annotation corresponding to a representative object having more siblings than received, and a second annotation corresponding to a representative object having children.

14 . The computer readable storage medium of claim 11 , further comprising executable instructions to render the set of node objects forming the connected part of the hierarchical data structure.

15 . The computer readable storage medium of claim 14 , wherein the executable instructions to render include executable instructions to render at least one of a tree, a directed graph, an array and a table.

16 . The computer readable storage medium of claim 11 , further comprising executable instructions to add to a specified point in the hierarchical data structure a second set of node objects, wherein the specified point is based on at least one of a hierarchical relationship between node objects, a previous sibling reference, a next sibling reference, a parent reference and a visible node count.

Assignments (3)
CHANGE OF NAME Recorded Jul 12, 2011
From: BUSINESS OBJECTS, S.A.
To: SAP FRANCE S.A.
Reel/Frame 026581/0190 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 2, 2009
From: HARRISON, MATTHEW JOHN; HARRISON, CRAIG STUART; NEWMAN, SHAUN DARRYL BRYAN
To: BUSINESS OBJECTS, S.A.
Reel/Frame 022770/0101 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 18, 2008
From: HARRISON, MATTHEW JOHN
To: BUSINESS OBJECTS, S.A.
Reel/Frame 021552/0863 →