Query by Example(ID:3957/que005)Database Query languageDatabase language from 1960s Structures: References: in Proceedings of National Computer Conference, Anaheim CA, 19-22 May 1975. The American Federation of Information Processing Societies view details in Proceedings of National Computer Conference, Anaheim CA, 19-22 May 1975. The American Federation of Information Processing Societies view details in Proceedings of International Conference on Very Large Data Bases, Framingham MA, 22-24 September 1975 view details in Proceedings of International Conference on Very Large Data Bases, Framingham MA, 22-24 September 1975 view details in Proceedings of International Conference on Very Large Data Bases, Framingham MA, 22-24 September 1975 view details @inproceedings{807726, author = {Dennis McLeod}, title = {The translation and compatibility of SEQUEL and Query by Example}, booktitle = {Proceedings of the 2nd international conference on Software engineering}, year = {1976}, isbn = {none}, pages = {520--526}, location = {San Francisco, California, United States}, publisher = {IEEE Computer Society Press}, } Abstract: The problem of the translation and compatibility of high level data base query languages is addressed via a case study of the languages SEQUEL and Query by Example. In particular, an algorithm for translating queries on a relational data base stated in Query by Example into queries expressed in SEQUEL is introduced. This algorithm is used as a vehicle to describe a consistent interpretation of the semantics of SEQUEL and Query by Example. The compatibility of Query by Example and SEQUEL is briefly discussed. Examples of the operation of the algorithm are presented. in [IEEE] Proceedings of the 2nd International Conference on Software Engineering 1976 San Francisco view details in Australian Computer Journal 12(1) 1980 view details |