A computer system for inference execution and data retrieval
Communications of the ACM
Treating hierarchical data structures in the SDC Time-Shared Data Management System (TDMS)
ACM '67 Proceedings of the 1967 22nd national conference
Proximal nodes: a model to query document databases by content and structure
ACM Transactions on Information Systems (TOIS)
Triggers over nested views of relational data
ACM Transactions on Database Systems (TODS)
Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more
Survey of graph database models
ACM Computing Surveys (CSUR)
Foundations and Trends in Databases
Inferring Dataflow Properties of User Defined Table Processors
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Approximate instance retrieval on ontologies
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
FlexTable: using a dynamic relation model to store RDF data
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Querying RDF data from a graph database perspective
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Abstract interpretation of database query languages
Computer Languages, Systems and Structures
Using functional dependencies for reducing the size of a data cube
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Applications of ordinal ranks to flexible query answering
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Automated reasoning to infer all minimal keys
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Red Fox: An Execution Environment for Relational Query Processing on GPUs
Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization
Derivation digraphs for dependencies in ordinal and similarity-based data
Information Sciences: an International Journal
Hi-index | 0.00 |
Future users of large data banks must be protected from having to know how the data is organized in the machine (the internal representation). A prompting service which supplies such information is not a satisfactory solution. Activities of users at terminals and most application programs should remain unaffected when the internal representation of data is changed and even when some aspects of the external representation are changed. Changes in data representation will often be needed as a result of changes in query, update, and report traffic and natural growth in the types of stored information.Existing noninferential, formatted data systems provide users with tree-structured files or slightly more general network models of the data. In Section 1, inadequacies of these models are discussed. A model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced. In Section 2, certain operations on relations (other than logical inference) are discussed and applied to the problems of redundancy and consistency in the user's model.