Recursive data traversal model

One or more embodiments interpret a configuration graph to efficiently and optimally construct requests and fetch data from a datastore. The values of objects of a requested data type are used to generate additional queries for pre-fetching data from the datastore. Specifically, the values are used...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Shah, Rajesh Ashwinbhai, Humes, Donald Creig, Balasubrahmanian, Kaarthik, Tadepalli, Sridhar
Format: Patent
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:One or more embodiments interpret a configuration graph to efficiently and optimally construct requests and fetch data from a datastore. The values of objects of a requested data type are used to generate additional queries for pre-fetching data from the datastore. Specifically, the values are used to query for and retrieve a corresponding subset of objects of another, related data type. Recursively querying for and retrieving objects of related data types based on already retrieved objects builds a data cache of relevant objects. The cached, relevant objects may be useful in subsequent queries that are likely to follow the initial query.