A file structure for semantic databases

作者:

Highlights:

摘要

This paper presents a highly-efficient file structure for the storage of semantic databases. A low-level access language is presented, such that an arbitrary query can be performed as one or several elementary queries of the language. Most elementary queries, including such non-trivial queries as range queries and others, can be performed in just one single access to the disk.

论文关键词:Semantic databases,implementation,semantic binary model,file structure,query languages,transactions,indices,B-tree,efficiency,database access primitives,facts,inverted storage

论文评审过程:Received 25 November 1988, Revised 15 October 1990, Available online 17 June 2003.

论文官网地址:https://doi.org/10.1016/0306-4379(91)90029-9