Minimization in cooperative response to failing database queries
Minimization in cooperative response to failing database queries
CoBase: a scalable and extensible cooperative information system
Journal of Intelligent Information Systems - Special issue on intelligent integration of information
Using explicit ontologies in KBS development
International Journal of Human-Computer Studies
Query approximate answering system for an incomplete DKBS
Fundamenta Informaticae - Special issue: intelligent information systems
Knowledge representation: logical, philosophical and computational foundations
Knowledge representation: logical, philosophical and computational foundations
Formal Ontology in Information Systems: Proceedings of the 1st International Conference June 6-8, 1998, Trento, Italy
Towards Very Large Knowledge Bases
Towards Very Large Knowledge Bases
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Cooperative Answering through Controlled Query Relaxation
IEEE Expert: Intelligent Systems and Their Applications
Ontology, Metadata, and Semiotics
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Discovery of Surprising Exception Rules Based on Intensity of Implication
PKDD '98 Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery
Ontologies: A Silver Bullet for Knowledge Management and Electronic Commerce
Ontologies: A Silver Bullet for Knowledge Management and Electronic Commerce
Ontology-based distributed autonomous knowledge systems
Information Systems - Special issue on web data integration
Handbook on Ontologies (International Handbooks on Information Systems)
Handbook on Ontologies (International Handbooks on Information Systems)
Data Confidentiality Versus Chase
RSFDGrC '07 Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
Discriminant feature analysis for music timbre recognition and automatic indexing
MCD'07 Proceedings of the 3rd ECML/PKDD international conference on Mining complex data
Approximating query answering on RDF databases
World Wide Web
Join Me with the Weakest Partner, Please
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Hi-index | 0.00 |
Sometime Query Answering Systems (QAS) for a Distributed Autonomous Information System (DAIS) may fail by returning the empty set of objects as an answer for a query q. Systems in DAIS can be incomplete, have hierarchical attributes, and the semantics of attributes and their values may differ between sites. Also, if there are no objects in S matching q, the query may fail when submitted to S. Alternatively, QAS for S may try to relax the query q as it was proposed in T. Gaasterland (IEEE Expert, 12(5), 1997, 48---59), P. Godfrey (International Journal of Cooperative Information Systems, 6(2), 1997, 95---149) and W. Chu et al. (Journal of Intelligent Information Systems, 6(2/3), 1996, 223---259). It means that q can be replaced by a new more general query. Clearly, the goal is to find possibly the smallest generalization of q which will not fail in S. Smaller generalizations guarantee higher confidence in objects returned by QAS. Such QAS is called cooperative (only one site is involved). Queries may also fail in S when some of the attributes listed in q are outside the domain of S. To resolve this type of queries, assuming that S is a part of DAIS, we may extract definitions of such attributes from information systems residing at some of the remote sites for S and next use them to approximate q in S. In order to do that successfully, we assume that all involved systems have to agree on the ontology of some of their common attributes Z.W. Ra驴 and A. Dardzi驴ska (Information Systems International Journal, 29(1), 2004, 47---58; Proceedings of FQAS 2004 Conference, LNCS/LNAI No. 3055, 2004, pp. 125---136); Z.W. Ra驴 and S. Joshi, Fundamenta Informaticae Journal, 30(3/4), 1997, 313---324. QAS based on the above strategy is called collaborative (minimum two sites are involved). Similarly, a query may fail in S when the granularity of an attribute used in q is finer than the granularity of the same attribute in S. This paper shows how to use collaboration and cooperation approach to solve failing queries in DAIS assuming that attributes are hierarchical. Some aspects of a collaboration strategy dealing with failing query problem for non-hierarchical attributes have been presented in Z.W. Ra驴 and A. Dardzi驴ska (Information Systems International Journal, 29(1), 2004, 47---58; Proceedings of FQAS 2004 Conference, LNCS/LNAI No. 3055, 2004, pp. 125---136).