IMPLEMENTING Q. B. E.

Afrati, F; Papadimitriou, C; Papageorgiou, G; Paschos, E

dc.contributor.author	Afrati, F	en
dc.contributor.author	Papadimitriou, C	en
dc.contributor.author	Papageorgiou, G	en
dc.contributor.author	Paschos, E	en
dc.date.accessioned	2014-03-01T02:47:37Z
dc.date.available	2014-03-01T02:47:37Z
dc.date.issued	1985	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33290
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0022318627&partnerID=40&md5=f97fcb094f4c2cc2f40dd32375290891	en
dc.subject.other	COMPUTER PROGRAMMING LANGUAGES	en
dc.subject.other	DATA BASE MANAGEMENT SYSTEMS (DBMS)	en
dc.subject.other	DATA MANIPULATION LANGUAGE (DML)	en
dc.subject.other	DATABASE SYSTEMS	en
dc.title	IMPLEMENTING Q. B. E.	en
heal.type	conferenceItem	en
heal.publicationDate	1985	en
heal.abstract	Q. B. E. is a user-friendly Data Manipulation Language (D. M. L. ) for a Data Base system. It is referred to the relational model and it exhibits features that make it very powerful. It is proved that it is more powerful than the relational algebra. In this paper we describe the structure of Q. B. E. and we report the problems that arose at implementing Q. B. E. in the computer using PASCAL.	en
heal.publisher	North-Holland, Amsterdam, Neth	en
heal.journalName	[No source information available]	en
dc.identifier.spage	269	en
dc.identifier.epage	272	en