scientific article; zbMATH DE number 3607517
From MaRDI portal
Publication:4172944
zbMath0391.68050MaRDI QIDQ4172944
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Data structures (68P05) Information storage and retrieval of data (68P20) Theory of questionnaires (94A50)
Related Items (13)
An alternative way to represent the cogroup of a relation in the context of nested databases ⋮ Linear constraint query languages expressive power and complexity ⋮ Structural characterizations of the navigational expressiveness of relation algebras on a tree ⋮ Computable queries for relational data bases ⋮ A comparison between algebraic query languages for flat and nested databases ⋮ Unnamed Item ⋮ The complexity of higher-order queries ⋮ The powerset algebra as a natural tool to handle nested database relations ⋮ On database query languages for K-relations ⋮ First-order definable counting-only queries ⋮ Procedural languages for database queries and updates ⋮ Negation in rule-based database languages: A survey ⋮ The expressive power of stratified logic programs with value invention
This page was built for publication:
