Principles of programming with complex objects and collection types

DOI10.1016/0304-3975(95)00024-QzbMATH Open0874.68092OpenAlexW2130872776MaRDI QIDQ672333FDOQ672333

Authors: Peter Buneman, Shamim Naqvi, Val Tannen, Limsoon Wong 

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00024-q

Recommendations

• Semantics of types for database objects
• Deductive query languages for recursively typed complex objects
• Tractable query languages for complex object databases
• scientific article; zbMATH DE number 1086723
• Object identity as a query language primitive

zbMATH Keywords

database query languages

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Computable queries for relational data bases
• Title not available (Why is that?)
• A relational model of data for large shared data banks
• Title not available (Why is that?)
• Notions of computation and monads
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Comprehending monads
• Title not available (Why is that?)
• Title not available (Why is that?)
• Database query languages embedded in the typed lambda calculus
• The relational model with relation-valued attributes
• Structure and complexity of relational queries
• A comparison between algebraic query languages for flat and nested databases
• The powerset algebra as a natural tool to handle nested database relations
• Conservativity of nested relational calculi with internal generic functions
• Direct decompositions of atomistic algebraic lattices
• Title not available (Why is that?)

Cited In (30)

• A formalization of SQL with nulls
• Fragments of Bag Relational Algebra: Expressiveness and Certain Answers
• Query lifting. Language-integrated query for heterogeneous nested collections
• Expressive power of SQL.
• Iterating on multiple collections in synchrony
• Local properties of query languages
• Provenance as dependency analysis
• Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory
• Collections as combinations of features
• A descriptive type foundation for RDF Schema
• Database query languages and functional logic programming
• Structural recursion as a query language on lists and ordered trees
• Strongly-Normalizing Higher-Order Relational Queries
• The category theoretic understanding of universal algebra: Lawvere theories and monads
• Comprehending Ringads
• Higher order architecture of collections of objects
• Domain-independent queries on databases with external functions
• MGS: a rule-based programming language for complex objects and collections
• Semantics of types for database objects
• Incremental recomputation in local languages.
• A safe relational calculus for functional logic deductive databases
• Generic multiset programming with discrimination-based joins and symbolic Cartesian products
• Capability-based localization of distributed and heterogeneous queries
• The foundation of self-developing blob machines for spatial computing
• Well-definedness and semantic type-checking for the nested relational calculus
• Semantic subtyping with an SMT solver
• Expressivity and complexity of MongoDB queries
• A query language for NC
• Bounded fixpoints for complex objects
• Models of approximation in databases

This page was built for publication: Principles of programming with complex objects and collection types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672333)