1. A graph database comprising: at least one non-transitory computer-readable medium including: one or more symbolic data stores configured to symbolically store sets of multiple hyper-graph nodes; one or more of the multiple hyper-graph nodes associated with a first unique identifier including one or more first global keys and a first local key, the one or more first global keys including a binary integer associated with a database server and the first local key uniquely identifying the one or more multiple hyper-graph nodes stored on the database server; a second unique identifier including one or more second global keys and a second local key and identifying a set of multiple hyper-graph nodes representing a set operation of a union of hyper-graph nodes with comparable relationships based on having similar edges; and one or more key-value data stores configured to store attribute information for hyper-graph nodes and hyper-graph edges, the attribute information including a first symbolic key and a first value, the first symbolic key identifying at least one of the one or more hyper-graph nodes symbolically stored by the one or more symbolic data stores, and the first value including an object key and data that is associated with the object key, the attribute information also including a second symbolic key and a second value associated with the set of multiple hyper-graph nodes representing the set operation; wherein each set is stored as a three element binary decision diagram (e3BDD).