Safe queries in relational databases with functions

Joram Hirshfeld*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We define the class of syntactically safe queries in first order languages with function symbols. We prove using ideas from model theory that every model independent query is equivalent to a safe query. This answers a question raised by Topor in [Topor 1987].

Original languageEnglish
Title of host publicationComputer Science Logic - 5th Workshop, CSL 1991, Proceedings
EditorsEgon Borger, Gerhard Jager, Hans Kleine Buning, Michael M. Richter
PublisherSpringer Verlag
Pages173-183
Number of pages11
ISBN (Print)9783540557890
DOIs
StatePublished - 1992
Event5th Workshop on Computer Science Logic, CSL 1991 - Berne, Switzerland
Duration: 7 Oct 199111 Oct 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume626 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th Workshop on Computer Science Logic, CSL 1991
Country/TerritorySwitzerland
CityBerne
Period7/10/9111/10/91

Fingerprint

Dive into the research topics of 'Safe queries in relational databases with functions'. Together they form a unique fingerprint.

Cite this