Query languages for hierarchic databases

DOI10.1016/0890-5401(92)90074-PzbMath0765.68029OpenAlexW2091420415MaRDI QIDQ1201723

Elias Dahlhaus, Johann A. Makowsky

Publication date: 17 January 1993

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(92)90074-p

zbMATH Keywords

independencecompletenessdirectoryhigher order database

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (2)

\(\Delta\)-languages for sets and LOGSPACE computable graph transformers ⋮ Some thoughts on computational models: from massive human computing to abstract state machines, and beyond

Uses Software

• Smalltalk

Cites Work

• Nested relations and complex objects in databases
• The relational model with relation-valued attributes
• Descriptive set theory
• Computable queries for relational data bases
• Elementary induction on abstract structures
• Structure and complexity of relational queries
• Specification of the UNIX Filing System
• A taxonomy of problems with fast parallel algorithms
• On static logics, dynamic logics, and complexity classes
• Primitiv-Rekursive Funktionen Über Einem Bereich Endlicher Mengen
• A hierarchy of formulas in set theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Query languages for hierarchic databases