INFORMATION-SYSTEMS - QUERIES INVOLVING CARDINALITIES

被引：3

作者：

LIPSKI, W

MAREK, W

机构：

[1] Institute of Computer Science, Polish Academy of Sciences, P.O. Box 22

来源：

INFORMATION SYSTEMS | 1979年 / 4卷 / 03期

关键词：

D O I：

10.1016/0306-4379(79)90008-5

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A query language is considered allowing queries which ask for the cardinality of a set of objects satisfying specified conditions, or ask whether or not some relations (equalities, inequalities, etc.) hold between the cardinalities of sets of objects satisfying some conditions. We describe a precise semantics of this language, and we give a complete axiom system for equivalent transformations of queries. By using these axioms we are able to transform any query into a normal form which makes the retrieval process more efficient. © 1979.

引用

页码：241 / 246

页数：6

共 14 条

[1] Marek, Pawlak, Information storage and retrieval systems: mathematical foundations, Theoretical Comp. Sci., 1, pp. 331-354, (1976)
[2] Lipski, Marek, On information storage and retrieval systems, Mathematical Foundations of Computer Science, 2, pp. 215-259, (1977)
[3] Presburger, Über die Vollstandigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, welchem die Addition als einzige Operation hervortritt, pp. 92-101, (1929)
[4] Kreisel, Krivine, Elements of Mathematical Logic, (1967)
[5] Rasiowa, Sikorski, The Mathematics of Metamathematics, (1963)
[6] Kuratowski, Mostowski, Set Theory, (1976)
[7] Lipski, On semantic issues connected with incomplete information data bases, Proc. 3rd Int. Conf. on Very Large Data Bases, (1977)
[8] Cooper, Theorem proving in arithmetic without multiplication, Machine Intelligence, 7, pp. 91-99, (1972)
[9] Bledsoe, The SUP-INF method in Presburger arithmetic, The University of Texas at Austin Mathematics Department Memo ATP-18, (1974)
[10] Shostak, On the SUP-INF Method for Proving Presburger Formulas, Journal of the ACM, 24, pp. 529-543, (1977)

← 1 2 →