Computing transitive closures of multilevel relations

  • Authors:
  • Bhavani Thuraisingham

  • Affiliations:
  • The MITRE Corporation, Bedford, MA

  • Venue:
  • ACM SIGMOD Record
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently many attempts have been made to implement recursive queries. Such queries are essential for the new generation intelligent database system applications. Much of the effort in recursive queries is focussed on transitive closure queries which are of practical significance. None of the work described investigates recursive query processing in secure database management systems. In this paper we propose centralized and distributed algorithms for implementing transitive closure queries for multilevel secure relational database management systems.