Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1999-03-25
2004-08-10
Corrielus, Jean M. (Department: 2172)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
06775674
ABSTRACT:
COPYRIGHT NOTICE
A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the xerographic reproduction by anyone of the patent document or the patent disclosure in exactly the form it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
BACKGROUND OF THE INVENTION
The present invention relates to the field of data navigation. More specifically, one embodiment of the invention provides an application developer with an improved method and apparatus to define relationships between data objects.
The typical data navigator used to navigate through complex databases requires the application developer to know ahead of time the relations between the objects in the database. Most applications that allow navigation use icons, buttons or highlighted words (anchors) to point to related objects. An anchor represents a known relationship between objects, usually a relationship that is defined in database schema in the form known as a “foreign key”. Relations may also be coded in the application code itself. These relations require the developer of the applications to specifically define the relationship and attach this specific definition of the relationship to the anchor. This poses a number of problems in the creation process, which is long and tedious, but also poses problems in the maintenance of these applications. If any of the relationships has been changed, the developer most likely will need to change the application and its layout of its displays in order to represent of these changes.
The system of Hyper-relational data navigation described in U.S. Pat. No. 5,848,424, owned by the assignee of the present application, which is incorporated herein by reference for all purposes, shows a data navigator for use in a HyperRelational navigation system (“HRNS”) that improves on the typical “hypertext” metaphor of navigation on the World Wide Web (“WWW”). In one aspect of that interface, a browser displays hypertext pages and indicates draggable elements on the page being viewed. The browser also displays drop targets and allows the user to drag a draggable element onto a drop target. The browser and/or server (to which the browser is connected) then perform an action, which is a function of both the dragged element and the drop target. Usually this action involves getting data from a database, processing that data, and displaying the result. The details of the action—i.e., what data to get, what processing to do—are determined by the user's choice of dragged object and drop target. The action taken by the HRNS in response to a user request is therefore dependent on a definition of relationships between the objects. These relationships must typically be prepared in advance in order for the HRDN to work well.
SUMMARY OF THE INVENTION
One embodiment of the present invention provides a mechanism to infer a set of relationships between objects in a data model. The relationships between the objects can be used to refer from one object to another, and in particular, can be used in a HyperRelational navigation system (“HRNS”), to navigate between objects.
An auto completion process preferably starts with some pre-defined relationships. The pre-defined relationships are referred to herein as “basic” relationships. This set can be derived from the object model automatically or can be defined manually by the user.
The autocompletion process attempts to automatically complete all possible relationships between any object and any other object in the object model. The required result is the creation of a relationship between any two objects that follows the most logical path between those two objects. In cases where no such path exists, no relationship between the two objects will be created.
If the graph of basic relationships is a “connected graph” (then there are no two or more subsets of relationships that have no relationship defined between an object in one subset to an object in the other subset) with a connected graph, an unrestricted autocompletion process will find a relationship for any two objects.
After the autocompletion process completes, the output of the process, the set of relationships between the objects, together with the basic set of relationships forms the “full” set of relationships between the objects in the object model. This full set of relationships can be used by other processes or applications, and particularly by a HRNS. In an HRNS, each instance of data from an object can be dragged and then dropped on any object if a relationship exists between the two objects. After the drop, data from the second object that relates, according to a relationship from the full set, to the dragged data from the first object will be obtained and displayed.
REFERENCES:
patent: 5548749 (1996-08-01), Kroenke et al.
patent: 5553218 (1996-09-01), Li et al.
patent: 5659723 (1997-08-01), Dimitrios et al.
patent: 5758335 (1998-05-01), Gray
patent: 5774128 (1998-06-01), Golshani et al.
patent: 5848424 (1998-12-01), Scheinkman et al.
patent: 5884311 (1999-03-01), Blattmann-Bleile et al.
patent: 6014670 (2000-01-01), Zamanian et al.
patent: 6052687 (2000-04-01), Miura et al.
patent: 6128621 (2000-10-01), Weisz
patent: 6202099 (2001-03-01), Gillies et al.
patent: 6233578 (2001-05-01), Machihara et al.
IBM TDB (Automatic Query Generation, IBM Technical Disclosure Bulletin, Apr. 1991, vol. 33, No. 11, pp. 439-440).
Agassi Shai
Shulman Hannan
Ziv Udi
Corrielus Jean M.
Hwang Joon Hwan
SAP Aktiengesellschaft
LandOfFree
Auto completion of relationships between objects in a data... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Auto completion of relationships between objects in a data..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Auto completion of relationships between objects in a data... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3324283