Managing and automatically linking data objects
AssigneeAb Initio Technology LLC
InventorsTimothy Perkins, Alan Morse
Life of this patent
Estimating the term…
Loading patent…
AssigneeAb Initio Technology LLC
InventorsTimothy Perkins, Alan Morse
Estimating the term…
A computer-implemented method for managing data objects stored in a data repository and displaying elements associated with data objects on a graphical user interface is presented. The method includes using reusable logic to provide at least one displayed input element associated with a first data object stored in the data repository. In response to user input associated with the displayed input element, the method includes generating a second data object stored in the data repository, and linking the second data object with one or more related data objects in the data repository automatically based on the data object associated with the displayed element.
A method for managing data objects stored in a data repository and displaying elements associated with data objects on a graphical user interface, the method including:
A method for managing data objects stored in a data repository and displaying elements associated with data objects on a graphical user interface, the method including:
One or more non-transitory machine readable media for managing data objects stored in a data repository and displaying elements associated with data objects on a graphical user interface, the one or more non-transitory machine readable media storing one or more instructions that are executable by one or more processors to perform operations including:
A one or more non-transitory machine readable media for managing data objects stored in a data repository and displaying elements associated with data objects on a graphical user interface, the one or more non-transitory machine readable media storing one or more instructions that are executable by one or more processors to perform operations including:
A system for managing data objects stored in a data repository and displaying elements associated with data objects on a graphical user interface, the system including:
A system for managing data objects stored in a data repository and displaying elements associated with data objects on a graphical user interface, the system including:
Dependencies are inferred from the claim text.
Drawings are temporarily unavailable. Open the PDF at USPTO
From the US filing history. Foreign family members aren’t listed.
Indexing; Data structures therefor; Storage structures: graphs; Linked lists
Based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like…:…
For the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a…:…
Information retrieval; Database structures therefor; File system structures therefor: details of database functions independent of the retrieved…
About 3 years 1 month of term left · ends 12 Nov 2029 (estimated)
The description relates to managing and automatically linking data objects in a scalable object oriented database system.
Conventional data entry systems have been realized as Web applications, such that a user is allowed to generate new objects by clicking on a link. Such a link may direct the user to a web page listing the types of objects that could be generated. The user would then select a link for the type of object and be taken to an editor for a newly generated, empty object. The user would then fill in the necessary information about the new object, including links to existing objects. Setting these links to existing objects often required extensive navigation to find the link target or looking through a long list of existing objects.
Custom applications built within Lotus Notes are similar at least in terms of defining a custom interface where new objects (“documents”) are generated, and sometimes linked to other documents. A discussion forum interface would be another example where a new object or a response is generated from and linked to a previously existing object, the previous message.
FIG. 1 is a block diagram of a system for executing graph-based computations.
FIG. 2 illustrates computation graphs.
FIG. 3 is a screenshot.
1 System Overview
FIG. 1 is a schematic block diagram showing the interrelationship of parts of a computing system 100 for developing, executing and managing graph-based computations. A graph-based computation is implemented using a “data flow graph” that is represented by a directed graph, with vertices in the graph representing components (e.g., data files, processes, etc.), and the directed links or “edges” in the graph representing flows of data between components. In some examples, a graphic development environment (GDE) 102 provides a user interface for specifying executable graphs and defining parameters for the graph components. The GDE 102 communicates with a repository 104 and a parallel operating environment 106. Also coupled to the repository 104 and the parallel operating environment 106 are a User Interface module 108 and an external data store 112.
The repository 104 preferably is a scalable object-oriented database system designed to support the development and execution of graph-based applications and the interchange of metadata between the graph-based applications and other systems (e.g., other operating systems). In this arrangement, the repository 104 is referred to as Enterprise Meta Environment (EME) and is capable of storing one or more types of metadata, including documentation, record formats (e.g., fields and data types of records in a table), transform functions, graphs, jobs, monitoring information, etc. In particular, the EME 104 may store metadata associated with graph-based computations. In this context, each computer program can be considered as being implemented using a computational graph, also called a dataflow graph, or simply a graph. A graph contains one or more components (or vertices) that may be in communication (e.g., by a flow or edge) to allow data flow. In some arrangements, the graphs can execute in the parallel processing environment 106.