DocumentCode
2148349
Title
On first order database query languages
Author
Avron, A.
Author_Institution
Sch. of Math. Sci., Tel Aviv Univ., Ramat-Aviv
fYear
1991
fDate
15-18 July 1991
Firstpage
226
Lastpage
231
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, p.405-415)
Keywords
database theory; formal languages; formal logic; query languages; algorithms; alphabet; finite database; first order database query languages; first-order predicate calculus query; function names; model theory; natural number; prefix order; Calculus; Database languages; Electronic mail; Logic; Mathematical model; Relational databases;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1991. LICS '91., Proceedings of Sixth Annual IEEE Symposium on
Conference_Location
Amsterdam
Print_ISBN
0-8186-2230-X
Type
conf
DOI
10.1109/LICS.1991.151647
Filename
151647
Link To Document