On first order database query languages

A. Avron*, J. Hirshfeld

*Corresponding author for this work

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

Abstract

Using methods from model theory, the authors construct algorithms that, given any first-order predicate calculus query over a finite database, determine if they have a finite number of solutions or not, and if they do, list them all. This is done for languages that include function names (but no symbols for infinite relations) and for languages that include a name for the order of natural number or for the prefix order in a domain of strings over some alphabet (but no function symbols). The results prove some conjectures of M. Kiffer (Proc. Int. Conf. on Databases and Knowledge Bases, 1988, pp. 405-415).

Original languageEnglish
Title of host publicationProceedings - Symposium on Logic in Computer Science
PublisherPubl by IEEE
Pages226-231
Number of pages6
ISBN (Print)081862230X
StatePublished - Jul 1991
EventProceedings of the 6th Annual IEEE Symposium on Logic in Computer Science - Amsterdam, Neth
Duration: 15 Jul 199118 Jul 1991

Publication series

NameProceedings - Symposium on Logic in Computer Science

Conference

ConferenceProceedings of the 6th Annual IEEE Symposium on Logic in Computer Science
CityAmsterdam, Neth
Period15/07/9118/07/91

Fingerprint

Dive into the research topics of 'On first order database query languages'. Together they form a unique fingerprint.

Cite this