发明名称 NOSQL ONLINE ANALYTICAL PROCESSING ARCHITECTURE
摘要 A breadth-first join module receives, at a runtime, a query for travel data, wherein the travel data is stored in a data store, the data store comprising parent and child data structures arranged in a hierarchy. The breadth-first join module identifies a first child data structure associated with the travel data, the first child data structure comprising a plurality of pointers, wherein each of the plurality of pointers is associated with one of a plurality of first level parent data structures in the data store and queries each of the plurality of first level parent data structures to resolve the plurality of pointers in the first child data structure, wherein the plurality of first level parent data structures comprise travel data objects associated with the plurality of pointers, and wherein at least one of the plurality of first level parent data structures comprises a pointer to a second level parent data structure. The breadth-first join module queries the second level parent data structure to resolve the pointer in the at least one first level parent data structure, wherein all of the plurality of pointers in the first child data structure are resolved prior to querying the second level parent data structure.
申请公布号 US2014337064(A1) 申请公布日期 2014.11.13
申请号 US201314030677 申请日期 2013.09.18
申请人 Duetto Research, Inc. 发明人 Weissman Craig
分类号 G06Q30/06 主分类号 G06Q30/06
代理机构 代理人
主权项 1. A method comprising: receiving, at a runtime, a query for travel data, wherein the travel data is stored in a data store, the data store comprising parent and child data structures arranged in a hierarchy; identifying a first child data structure associated with the travel data, the first child data structure comprising a plurality of pointers, wherein each of the plurality of pointers is associated with one of a plurality of first level parent data structures in the data store; identifying a plurality of matching pointers in the first child data structure; querying, by a processing device, each of the plurality of first level parent data structures associated with the plurality of matching pointers to resolve the plurality of matching pointers in the first child data structure during a single access of the data store, wherein the plurality of first level parent data structures comprise travel data objects associated with the plurality of pointers, and wherein at least one of the plurality of first level parent data structures comprises a pointer to a second level parent data structure; and querying the second level parent data structure to resolve the pointer in the at least one first level parent data structure, wherein all of the plurality of pointers in the first child data structure are resolved prior to querying the second level parent data structure.
地址 San Francisco CA US