Accelerating Multilevel Secure Database Queries using P-Tree Technology

摘要

In the early 1990s, a lot of research was conducted in the area of multi-level secure database systems. Most of the work was directed towards the security aspect without much concentration on query acceleration. In this paper, a P-tree based algorithm using the Sea View model for multilevel relations is presented to accelerate queries in multilevel secure database systems. This algorithm recovers query output from single level relations in a fast and very space-efficient manner. The algorithm does not employ temporary data structures heavily nor does it produce spurious tuples while recovering, which has always been a major problem in this area.