首页>
外国专利>
Using a B-tree to store graph information in a database
Using a B-tree to store graph information in a database
展开▼
机译:使用B树在数据库中存储图信息
展开▼
页面导航
摘要
著录项
相似文献
摘要
Techniques to store graph information in a database are disclosed. In various embodiments, each node in a graph may be modeled as a micro b-tree. Node identity, attribute, edge, and edge attribute data may be stored in one or more pages modeled on page formats typically used to store index data for a relational database index. Data associated with a plurality of nodes and edges, each of said edges representing a relationship between two or more of said nodes, may be received. For each node, one or more pages of data may be created, each corresponding to a prescribed page size associated with a storage device in which said one or more pages are to be stored, and each page having a data structure that includes a variable-sized set of fixed length data slots and a variable-sized variable length data region.
展开▼