Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Paraconsistency in Object-Oriented Databases

Rajiv BagaiContact Information and Shellene J. KelleyContact Information

(5)  Department of Computer Science, Wichita State University, 67260-0083 Wichita, KS, USA
(6)  Department of Mathematics & Computer Science, Austin College, 75090-4440 Sherman, TX, USA
Abstract
Many database application areas require an ability to handle incomplete and/or inconsistent information. Such information, called paraconsistent information, has been the focus of some recent research. In this paper we present a technique for representing and manipulating paraconsistent information in object-oriented databases. Our technique is based on two new data types for such information. These data types are generalizations of the boolean and bag data types of the Object Data Management Group standard (ODMG). Algebraic operators with a 4- valued paraconsistent semantics are introduced for the new data types. Also a 4-valued operational semantics is presented for the select expression, with an example illustration of how such a semantics can be used effectively to query an object-oriented database containing paraconsistent information. To our knowledge, our technique is the first treatment of inconsistent information in object-oriented databases.
This research has been partially supported by the National Science Foundation research grant no. IRI 96-28866.

Contact Information Rajiv Bagai
Email: Rajiv.Bagai@Wichita.edu

Contact Information Shellene J. Kelley
Email: SKelley@AustinC.edu
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.109 • Server: mpweb22
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)