Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Strategy to efficiently construct complex interlinked data objects from sparse joins of costly data

IP.com Disclosure Number: IPCOM000239770D
Publication Date: 2014-Dec-01
Document File: 3 page(s) / 30K

Publishing Venue

The IP.com Prior Art Database

Abstract

A method to efficiently construct complex interlinked data objects from sparse joins of costly data is disclosed.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 42% of the total text.

Page 01 of 3

Strategy to efficiently construct complex interlinked data objects from sparse joins of costly data

Disclosed is a method to efficiently construct complex interlinked data objects from sparse joins of costly data.

One approach to constructing complex interlinked data objects is to manually determine

what data is needed to determine a given reference link to another object. Then that data is used to concretely define the object's link to the second object. This approach

would involve procedural code that sets a complex object's links to other objects just as any other data property in the complex object. Through this approach, the code that manufactures a complex object is not only responsible for setting all data properties in the object, but it also needs to be aware of how to determine links between objects as

well as how to concretely establish them. Notice that whenever a complex object's relationships with other objects change due to data updates, its reference links need to be updated as a result, and the full object needs to be rebuilt from scratch.

Another approach to constructing complex interlinked data objects utilizes database query technologies. These technologies allow developers to define relational data views that are sourced on joins of distinct relational data tables. The resulting view can then be mapped to a complex non-relational object to populate its non-link data properties. Likewise, foreign keys and other entries in the view can be used to populate its link data properties. This approach makes no distinction in the ways in which it obtains data for and populates non-link data properties versus data properties that represent links.

The existence of these links implies that any middleware that produces these objects must be aware of and manage larger sets of data than if these complex objects were not linked together. Ideally, the middleware would always have quick access to all the data that it needs, but obtaining and maintaining non-stale versions of all data in a distributed heterogeneous system is not only expensive but often non-viable. These conditions create a need for an approach that is able to create complex interlinked data objects without requiring full access to all data in a distributed system.

In the disclosed method, the setting of link and non-link data properties are decoupled into two separate independent processes. In the process of establishing links between objects, the method determines whether an object-to-object relationship exists rather than defining the relationship itself. It allows the decoupling of data joins from object creation, is suitable to non-relational data sources, and leads to an efficient and robust code implementation. These qualities are all important because constructing both link and non-link data properties in a complex object may be expensive operations.

Joining and collecting data from multiple distributed, heterogeneous, and potentially legacy systems is a...