Implication Problems for Specialization Constraints on Databases Supporting Complex Objects
Summary :
For a complex object model, a form of range restriction called specialization constraint (SC), has been proposed, which is associated not only with the properties themselves but also with property value paths. The domain and range of an SC, however, were limited to single classes. In this paper, SCs are generalized to have sets of classes as their domains and ranges. Let Σ be a set of SCs, where each SC in Σ has a set of classes as its domain and a non-empty set of classes as its range. It is proved that an SC is a logical consequence of Σ if and only if it is a finite logical consequence of Σ. Then a sound and complete axiomatization for SCs is presented. Finally, a polynomial-time algorithm is given, which decides whether or not an SC is a logical consequence of Σ.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E77-A No.9 pp.1510-1519
- Publication Date
- 1994/09/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Algorithms, Data Structures and Computational Complexity
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Minoru ITO, Michio NAKANISHI, "Implication Problems for Specialization Constraints on Databases Supporting Complex Objects" in IEICE TRANSACTIONS on Fundamentals,
vol. E77-A, no. 9, pp. 1510-1519, September 1994, doi: .
Abstract: For a complex object model, a form of range restriction called specialization constraint (SC), has been proposed, which is associated not only with the properties themselves but also with property value paths. The domain and range of an SC, however, were limited to single classes. In this paper, SCs are generalized to have sets of classes as their domains and ranges. Let Σ be a set of SCs, where each SC in Σ has a set of classes as its domain and a non-empty set of classes as its range. It is proved that an SC is a logical consequence of Σ if and only if it is a finite logical consequence of Σ. Then a sound and complete axiomatization for SCs is presented. Finally, a polynomial-time algorithm is given, which decides whether or not an SC is a logical consequence of Σ.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e77-a_9_1510/_p
Copy
@ARTICLE{e77-a_9_1510,
author={Minoru ITO, Michio NAKANISHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Implication Problems for Specialization Constraints on Databases Supporting Complex Objects},
year={1994},
volume={E77-A},
number={9},
pages={1510-1519},
abstract={For a complex object model, a form of range restriction called specialization constraint (SC), has been proposed, which is associated not only with the properties themselves but also with property value paths. The domain and range of an SC, however, were limited to single classes. In this paper, SCs are generalized to have sets of classes as their domains and ranges. Let Σ be a set of SCs, where each SC in Σ has a set of classes as its domain and a non-empty set of classes as its range. It is proved that an SC is a logical consequence of Σ if and only if it is a finite logical consequence of Σ. Then a sound and complete axiomatization for SCs is presented. Finally, a polynomial-time algorithm is given, which decides whether or not an SC is a logical consequence of Σ.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - Implication Problems for Specialization Constraints on Databases Supporting Complex Objects
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1510
EP - 1519
AU - Minoru ITO
AU - Michio NAKANISHI
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E77-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 1994
AB - For a complex object model, a form of range restriction called specialization constraint (SC), has been proposed, which is associated not only with the properties themselves but also with property value paths. The domain and range of an SC, however, were limited to single classes. In this paper, SCs are generalized to have sets of classes as their domains and ranges. Let Σ be a set of SCs, where each SC in Σ has a set of classes as its domain and a non-empty set of classes as its range. It is proved that an SC is a logical consequence of Σ if and only if it is a finite logical consequence of Σ. Then a sound and complete axiomatization for SCs is presented. Finally, a polynomial-time algorithm is given, which decides whether or not an SC is a logical consequence of Σ.
ER -
English
