Access path query language for relational database systems

Abstract Database management systems offer a very reliable and attractive data organization for fast and economical information storage and processing for diverse applications. It is much more important that the information should be easily accessible to users with varied backgrounds, professional a...

Full description

Bibliographic Details
Published in:Software: Practice and Experience
Main Authors: Patnaik, L. M., Shailendra, Phule, Rao, K. Venkateswara
Format: Article in Journal/Newspaper
Language:English
Published: Wiley 1983
Subjects:
DML
Online Access:http://dx.doi.org/10.1002/spe.4380130802
https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fspe.4380130802
https://onlinelibrary.wiley.com/doi/pdf/10.1002/spe.4380130802
Description
Summary:Abstract Database management systems offer a very reliable and attractive data organization for fast and economical information storage and processing for diverse applications. It is much more important that the information should be easily accessible to users with varied backgrounds, professional as well as casual, through a suitable data sublanguage. The language adopted here (APPLE) is one such language for relational database systems and is completely nonprocedural and well suited to users with minimum or no programming background. This is supported by an access path model which permits the user to formulate completely nonprocedural queries expressed solely in terms of attribute names. The data description language (DDL) and data manipulation language (DML) features of APPLE are also discussed. The underlying relational database has been implemented with the help of the DATATRIEVE‐11 utility for record and domain definition which is available on the PDP‐11/35. The package is coded in Pascal and MACRO‐11. Further, most of the limitations of the DATATRIEVE‐11 utility have been eliminated in the interface package.