2003•Fundamenta InformaticaeRequires access

An Extended Relational Algebra on Abstract Objects for Summarizing Answers to Queries

Robert Demolombe

Abstract

Answers to queries in terms of abstract objects are defined in the logical framework of first order predicate calculus. A partial algebraic characterisation of the supremum and of the infimum of abstract answers is given in an extended Relational Algebra of the Cylindric Algebra kind. Then, the form of queries is restricted in order to be able to compute answers without the cylindrification operator. For these restricted queries we give a technique to compute an upper bound and a lower bound of abstract answers using only the operators of the standard Relational Algebra.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Infimum and supremum, Relational algebra, Predicate (mathematical logic), Algebraic number, Algebra over a field, Mathematics, Conjunctive query, Order (exchange)