2002Unpublished venueRequires access

The LDV approach to polyinstantiation

Dylan H. O’Brien

Open publisher page 1 citations

Abstract

In a multilevel DBMS, there is a need for tuple polyinstantiation. It is conceivable that users at different security levels will have different, legitimate understandings of the current state of the enterprise modeled by the database. As long as the data in each tuple in the database is classified at the same level, the tuple polyinstantiation approach is adequate. However, there are times when it is reasonable for a tuple to be distributed across security levels because it contains individual data elements that are classified at different levels and the responsibility for maintaining the various portions of the tuple should properly be allocated to users operating at different security levels. The LDV approach is to use tuple polyinstantiation augmented with the ability to derive tuple values from lower level tuples to provide a method of handling multilevel tuples that does not require element polyinstantiation.>

About this research paper

What this paper is about

In a multilevel DBMS, there is a need for tuple polyinstantiation. It is conceivable that users at different security levels will have different, legitimate understandings of the current state of the enterprise modeled by the database. As long as the data in each tuple in the database is classified at the same level, the tuple polyinstantiation approach is adequate. However, there are times when it is reasonable for a tuple to be distributed across security levels because it contains individual data elements that are classified at different levels and the responsibility for maintaining the various portions of the tuple should properly be allocated to users operating at different security levels. The LDV approach is to use tuple polyinstantiation augmented with the ability to derive tuple values from lower level tuples to provide a method of handling multilevel tuples that does not require element polyinstantiation.>

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In a multilevel DBMS, there is a need for tuple polyinstantiation. It is conceivable that users at different security levels will have different, legitimate understandings of the current state of the enterprise modeled by the database. As long as the data in each tuple in the database is classified at the same level, the tuple polyinstantiation approach is adequate. However, there are times when it is reasonable for a tuple to be distributed across security levels because it contains individual data elements that are classified at different levels and the responsibility for maintaining the various portions of the tuple should properly be allocated to users operating at different security levels. The LDV approach is to use tuple polyinstantiation augmented with the ability to derive tuple values from lower level tuples to provide a method of handling multilevel tuples that does not require element polyinstantiation.>

Key concepts: Tuple, Computer science, State (computer science), Theoretical computer science, Database, Data mining, Information retrieval, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
The LDV approach to polyinstantiation — Research Paper | ScholarLens