Computational Power in Query Languages

descriptionPublicationkeyboard_double_arrow_right Article 01 Aug 1982 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Computing, volume 11, pages 547-554 (issn: 0097-5397, eissn: 1095-7111,

Copyright policy )

Authors: Davis, Henry W.; Winslow, Leon E.;

doi: 10.1137/0211044

Computational Power in Query Languages

- Summary
- Subjects
- Metrics

Abstract

Primitive recursion, recursion and partial recursion are defined for languages which query a relational data base. Necessary and sufficient conditions for a language to satisfy these properties are given. The computational power of several extensions of the relational algebra is considered.

Keywords

computability, relational data base query language, Data structures, Information storage and retrieval of data, recursive functions, relational algebra, Recursive functions and relations, subrecursive hierarchies

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average