The relational model of data and cylindric algebras
From MaRDI portal
Publication:761801
DOI10.1016/0022-0000(84)90077-1zbMATH Open0557.68067OpenAlexW2062058882WikidataQ55968586 ScholiaQ55968586MaRDI QIDQ761801FDOQ761801
Authors: Tomasz Imielinski, Witold jun. Lipski
Publication date: 1984
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(84)90077-1
Recommendations
Information storage and retrieval of data (68P20) Data structures (68P05) Cylindric and polyadic algebras; relation algebras (03G15)
Cites Work
- The concept of a linguistic variable and its application to approximate reasoning. I
- Title not available (Why is that?)
- Title not available (Why is that?)
- A relational model of data for large shared data banks
- Equivalences Among Relational Expressions with the Union and Difference Operators
- Title not available (Why is that?)
- Title not available (Why is that?)
- The equational theory of CA3 is undecidable
- Equivalences among Relational Expressions
- Title not available (Why is that?)
- Nonfinitizability of classes of representable cylindric algebras
- Nonfinitizability of classes of representable polyadic algebras
- Cylindric set algebras. Cylindric set algebras and related structures. By L. Henkin, J. D. Monk, and A. Tarski. On cylindric-relativized set algebras. By H. Andreka and I. Nemeti
- Title not available (Why is that?)
- Optimizing the performance of a relational algebra database interface
- Undecidability of the homogeneous formulas of degree 3 of the predicate calculus
- Optimization of Single Expressions in a Relational Data Base System
- Title not available (Why is that?)
- Provability with Finitely Many Variables
Cited In (25)
- A computational model of relational algebra
- Executable first-order queries in the logic of information flows
- The Verso algebra or how to answer queries with fewer joins
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- Title not available (Why is that?)
- Relational lattices: from databases to universal algebra
- A formalization of the Codd algebra operations in logic \(\mathcal{SHOIN}(D)\)
- Intuitionistic interpretation of deductive databases with incomplete information
- Cylindric structures and dependencies in relational databases
- Title not available (Why is that?)
- Algebraization of quantifier logics, an introductory overview
- Inputs, Outputs, and Composition in the Logic of Information Flows
- A remark of representable positive cylindric algebras
- Tarski’s Influence on Computer Science
- Title not available (Why is that?)
- Orbital concept lattices
- Title not available (Why is that?)
- Modelling some mathematical objects and operations on them with an expanded relational data model
- The contributions of Alfred Tarski to algebraic logic
- Title not available (Why is that?)
- A deontic approach to database integrity
- Title not available (Why is that?)
- The semijoin algebra and the guarded fragment
- Nonapplicable nulls
- A framework for comparing query languages in their ability to express Boolean queries
This page was built for publication: The relational model of data and cylindric algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761801)