The expressive power of cardinality-bounded set values in object-based data models
From MaRDI portal
Publication:672334
DOI10.1016/0304-3975(95)00025-RzbMATH Open0874.68078OpenAlexW2086340872WikidataQ127349698 ScholiaQ127349698MaRDI QIDQ672334FDOQ672334
Authors: Jan Van den Bussche, D. Van Gucht
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)00025-r
Recommendations
- Cardinality constraints in semantic data models
- Bounded queries to arbitrary sets
- scientific article; zbMATH DE number 1950752
- On the expressive power of description logics with cardinality constraints on finite and infinite sets
- The expressive power of complex values in object-based data models
- A theoretical framework for cardinality-based feature models: the semantics and computational aspects
- Efficient automated reasoning about sets and multisets with cardinality constraints
Cites Work
- Computable queries for relational data bases
- On the expressive power of database queries with intermediate types
- The expressive power of complex values in object-based data models
- Title not available (Why is that?)
- Duplicate record elimination in large data files
- A logic for programming with complex objects
- Nested relations and complex objects in databases
- Procedural languages for database queries and updates
Cited In (1)
This page was built for publication: The expressive power of cardinality-bounded set values in object-based data models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672334)