Structure of relations satisfying certain families of dependencies
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
A relational model of data for large shared data banks
Communications of the ACM
Non first normal form relations to represent hierarchically organized data
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Remarks on the algebra of non first normal form relations
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
CUDL language semantics: Updating FDB data
Journal of Systems and Software
Conceptual universal database language: literature review and the future of database design
Proceedings of the 2009 Euro American Conference on Telematics and Information Systems: New Opportunities to increase Digital Citizenship
Conceptual Universal Database Language: Moving Up the Database Design Levels
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
| Hi-index | 0.00 |
Unnormalized relations permit components of tuples to be relation instances themselves instead of atomic values. Such structures do not always represent the restructuring of a flat (1NF) relation. It is shown that for one-level structures (nesting is permitted only over sets of attributes) there is a polynomial time algorithm to determine whether the structure is the result of restructuring a flat relation with a sequence of NEST operations.