Name
Abstract | ||
|---|---|---|
In this paper, we propose an extended relational model to accommodate exclusive-or disjunctive information. The proposed model is defined by first-order logic. The answers to a query contain both sure answers and maybe answers. To guarantee that the manipulation power of the proposed model is as good as that of the classical relational model, we prove that the classical properties of the database, uniquely determined and well-defined relational algebra, are preserved in our proposed model. |
Year | Venue | Keywords |
|---|---|---|
2004 | JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | disjunctive information,incomplete information,well-defined relational algebra,relational database,uniquely determined |
Field | DocType | Volume |
Codd's theorem,Data mining,Relational calculus,Conjunctive query,Relational database,Computer science,Tuple relational calculus,Theoretical computer science,Relational Model/Tasmania,Relational model,Domain relational calculus,Distributed computing | Journal | 20 |
Issue | ISSN | Citations |
5 | 1016-2364 | 0 |
PageRank | References | Authors |
0.34 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chien-Chou Shih | 1 | 14 | 3.04 |
| Ding-An Chiang | 2 | 231 | 27.25 |
| Wen-hsing Kao | 3 | 1 | 1.37 |