scientific article; zbMATH DE number 3607517
From MaRDI portal
Publication:4172944
zbMATH Open0391.68050MaRDI QIDQ4172944FDOQ4172944
Authors: François Bancilhon 
Publication date: 1978
Title of this publication is not available (Why is that?)
Information storage and retrieval of data (68P20) Data structures (68P05) Theory of questionnaires (94A50)
Cited In (13)
- A comparison between algebraic query languages for flat and nested databases
- The powerset algebra as a natural tool to handle nested database relations
- On database query languages for K-relations
- Computable queries for relational data bases
- An alternative way to represent the cogroup of a relation in the context of nested databases
- First-order definable counting-only queries
- Linear constraint query languages expressive power and complexity
- Structural characterizations of the navigational expressiveness of relation algebras on a tree
- Title not available (Why is that?)
- Negation in rule-based database languages: A survey
- The complexity of higher-order queries
- The expressive power of stratified logic programs with value invention
- Procedural languages for database queries and updates
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4172944)
