Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Orlowska, Ewa
Affiliations: Institute of Computer Science, Polish Academy of Sciences, P.O. Box 22, 00-901 Warsaw, Poland
Note: [1] This research was supported by ATP International CNRS 1983.
Abstract: Algebraic methods of proving database constraints are proposed. The first method is based on the formulation of constraints in terms of inclusions of some binary relations associated with database. The relations are generated by indiscernibility relations by means of the operations of the algebra of binary relations. The second method is based on the matrix representation of constraints.
DOI: 10.3233/FI-1987-10104
Journal: Fundamenta Informaticae, vol. 10, no. 1, pp. 57-68, 1987
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]