Abstract
A query language is defined in which users graphically manipulate entity-relationship (ER) diagrams to formulate queries. The theoretical foundation for the graphical language is algebraic. Each algebraic operator maps an ER diagram to an ER diagram, and every ER diagram represents a possible user query. A set of operators is formally defined and a suggested interactive implementation is given. The set of algebraic operators is both entity-set conservative, which guarantees that a user can interpret any transformed diagram in terms of known entity sets, and relationally complete, which guarantees an acceptable level of retrieval power.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
