Premium
Flexible querying of semistructured data: A fuzzy‐set‐based approach
Author(s) -
De Calmès Martine,
Prade Henri,
Sèdes Florence
Publication year - 2007
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.20225
Subject(s) - computer science , lexicographical order , rank (graph theory) , xquery , set (abstract data type) , information retrieval , data mining , fuzzy logic , similarity (geometry) , fuzzy set , scale (ratio) , xml , theoretical computer science , artificial intelligence , programming language , world wide web , mathematics , document structure description , combinatorics , image (mathematics) , physics , quantum mechanics
Abstract This article provides a general discussion about how flexible querying can be applied to semistructured data (SSD). We adapt flexible querying ideas, already used for classically structured databases, to XQuery‐like querying of SSD for managing users' priority and preferences, but also for tackling with the variability of SSD underlying structures. Indeed flexible querying seems to be still more useful for SSD than for classical databases, because of the potential structural heterogeneity of the former. Fuzzy sets are useful for expressing flexible requirements on attribute values and for estimating the degree of similarity of tags, or attribute labels, with elements present in the request. Priorities are introduced in the request for specifying the relative importance of elementary requirements in terms of their semantic contents, but also preferences about the location of information in the structure. The evaluation of the queries uses a qualitative scale with a finite number of levels, and retrieved pieces of SSD are rank‐ordered using a lexicographic vector procedure. Illustrative examples are provided. © 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 723–737, 2007.