Sparse tree data structure for selective retrieval of database records

Abstract

Described herein is a sparse tree data structure that may be utilized to selectively retrieve database records containing information relevant to an obtained query. Specifically, the sparse tree data structure may be utilized to prevent combinatorial explosion that may occur where responses to an obtained query requires a combination of information from multiple records. Rather than explicitly enumerate all possible combinations, the sparse tree data structure enables implicit enumeration of those combinations to determine combinations of highest relevancy. In one embodiment, the sparse tree implements a specific algorithm within the 'branch-and-bound' algorithmic paradigm to reduce the time and computational resources required to response to a query.