scientific article; zbMATH DE number 3607517

MaRDI QIDQ4172944zbMATH OpenFDO

Authors François Bancilhon

Publication date 1978

zbMATH Keywords

Information RetrievalQuery LanguagesRelational Data Bases

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Theory of questionnaires (94A50)

Cited in

(13)

• Procedural languages for database queries and updates
• 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
• scientific article; zbMATH DE number 1522507 (Why is no real title available?)
• Negation in rule-based database languages: A survey
• The complexity of higher-order queries
• The expressive power of stratified logic programs with value invention

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)