Analysis and performance of inverted data base structures

摘要: The need to envision and architecture data base systems in a hierarchical level by framework is stressed. inverted (file) organization then analyzed, considering implementation oriented aspects. directory viewed realistically as another large which itself subjected inversion. Formulations are derived estimate average access time (read only) storage requirements, formalizing the interaction of content characteristics, logical complexity queries, machine timing blocking specifications identified having first-order effect on performance. formulations presented necessary be used conjunction with any index selection criteria determine optimum set keys.