Applying Graph Traversal Queries Over Plain Objects
Publication Date: 2015-Dec-23
The IP.com Prior Art Database
Object Oriented Programming is one of the most popular paradigms in programming languages. In these languages, the data entities are represented by objects that have attributes and methods. Attributes can hold values of primitive or of complex types, or can reference other objects. The objects together with attributes that reference them, form, in essence, a graph structure (i.e., vertices represent entities and edges represent references between them). Searching for specific data within this graph can be a tedious task in terms of programming - it requires specifying graph traversal logic in a general purpose language, which lacks graph traversal paradigms. Executing this logic can be slow (in running time) due to sub-optimal algorithms applied by a programmer. Recently query languages have begun to be embedded into programming languages to alleviate this task (see for example LINQ). However these query languages do not treat the objects as a graph so they do not allow traversal queries. Traversal queries make it easier to represent paths between objects and also to support traversals of paths of variable sizes.