SYSTEM/U: a database system based on the universal relation assumption
ACM Transactions on Database Systems (TODS)
A graphical query language for entity-relationship databases
Proc. of the third international conference on Entity-relationship approach to software engineering
A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS)
Tree queries: a simple class of relational queries
ACM Transactions on Database Systems (TODS)
Maximal objects and the semantics of universal relation databases
ACM Transactions on Database Systems (TODS)
The universal relation revisited (technical correspondence)
ACM Transactions on Database Systems (TODS)
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Specifying connections for a universal relation scheme database
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Toward logical data independence: a relational query language without relations
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Compatible attributes in a universal relation
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Decomposition of Relations and Synthesis of Entity-Relationship Diagrams
Proceedings of the 1st International Conference on the Entity-Relationship Approach to Systems Analysis and Design
On the Semantics of the Entity-Relationship Data Model
Proceedings of the 1st International Conference on the Entity-Relationship Approach to Systems Analysis and Design
Explaining ambiguity in a formal query language
ACM Transactions on Database Systems (TODS)
A Visual Language Compiler for Information Retrieval by Visual Reasoning
IEEE Transactions on Software Engineering
Automated Query Formulation Using an Entity–Relationship Conceptual Schema
Journal of Intelligent Information Systems
FLEX: A Tolerant and Cooperative User Interface to Databases
IEEE Transactions on Knowledge and Data Engineering
Intensional Answers to Database Queries
IEEE Transactions on Knowledge and Data Engineering
A Group-Select Operation for Relational Algebra and Implications for Database Machine Design
IEEE Transactions on Software Engineering
Efficient discovery of join plans in schemaless data
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
| Hi-index | 0.00 |
The query inference problem is to translate a sentence of a query language into an unambiguous representation of a query. A query is represented as an expression over a set of query trees. A metric is introduced for measuring the complexity of a query and also a proposal that a sentence be translated into the least complex query which “satisfies” the sentence. This method of query inference can be used to resolve ambiguous sentences and leads to easier formulation of sentences.