Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The expressive power of the bounded-iteration construct

From MaRDI portal
Publication:1186517
Jump to:navigation, search

DOI10.1007/BF01178680zbMath0741.68040MaRDI QIDQ1186517

Xiaolei Qian

Publication date: 28 June 1992

Published in: Acta Informatica (Search for Journal in Brave)


zbMATH Keywords

database programming languagebounded-iterationdatabase programmingiterative transaction language


Mathematics Subject Classification ID

Database theory (68P15) Theory of programming languages (68N15)


Related Items (3)

The expressiveness of a family of finite set languages ⋮ Compensation methods to support cooperative applications: A case study in automated verification of schema requirements for an advanced transaction model ⋮ Verifiable properties of database transactions



Cites Work

  • The expressive power of stratified logic programs
  • Structure and complexity of relational queries
  • Relational queries computable in polynomial time
  • Equivalence and optimization of relational transactions
  • Unnamed Item
  • Unnamed Item


This page was built for publication: The expressive power of the bounded-iteration construct

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1186517&oldid=12054288"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 00:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki