SYSTEM/U: a database system based on the universal relation assumption
ACM Transactions on Database Systems (TODS)
Database machines and database management
Database machines and database management
Database machine architecture for supporting incomplete information
Computer Systems Science and Engineering
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS)
Consequences of assuming a universal relation
ACM Transactions on Database Systems (TODS)
A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS)
A foundation of CODD's relational maybe-operations
ACM Transactions on Database Systems (TODS)
On semantic issues connected with incomplete information databases
ACM Transactions on Database Systems (TODS)
Extending the database relational model to capture more meaning
ACM Transactions on Database Systems (TODS)
On Databases with Incomplete Information
Journal of the ACM (JACM)
MAYBE algebra operators in database machine architecture
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Principles of Database Systems
Principles of Database Systems
Null values in data base management a denotational semantics approach
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Assumptions in relational database theory
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Data-Base Computers
The data management machine, a classification
CAW '77 Proceedings of the 3rd workshop on Computer architecture : Non-numeric processing
An associative backend machine for data base management
An associative backend machine for data base management
ACM SIGMOD Record
| Hi-index | 0.00 |
Changes in the user population continues the trend to more simplicity for the user and increased sophistication of the computer systems. In addition, advances in data storage technology have enforced the growth and creation of incomplete data files. A growing number of users require information from the database which cannot be obtained through the operators found in traditional query languages. Such needs have increased the expectation that a system should be able to assist the user in gathering and interpreting the appropriate data. The recent discussion of null values and maybe algebra is an attempt in this direction. However, the current literature has not addressed the practical issues of such theoretical concepts. This presentation examines the inclusion of the maybe algebra operators in a database machine. In addition, modifications designed to increase the time and space efficiency of the maybe algebra operators as well as the quality of the results are discussed.