Approximate Querying of XML Fuzzy Data

Buche, Patrice; Dibie-Barthelemy, Juliette; Wattez, Fanny

doi:10.1007/11766254_3

Cited by 11 publications

(9 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fuzzy techniques have been also introduced recently to approximately query XML data [6], [9], [10], [12], [13], [17], [27], [32]. Buche et al [6] add flexibility to the MIEL++ system, that integrates data coming from a relational database and an XML database.…”

Section: Related Workmentioning

confidence: 99%

XPath Query Relaxation through Rewriting Rules

Fazzinga

Flesca

Furfaro

2011

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

Query relaxation is the process of weakening a query to a more general one, and it is frequently employed to support approximate query answering. In this paper, rewriting systems for a wide fragment of XPath are investigated, which accomplish query relaxation through the application of simple rewriting rules transforming navigational axes and node tests into relaxed ones. Specifically, a general yet simple form of rewriting rules is considered, which subsumes the forms adopted in several rewriting systems for approximate XPath query answering. The expressiveness of rewriting systems based on this form of rules is characterized in terms of their capability of transforming a query into every more general formulation. It is shown that traditional rewriting systems are not only incomplete w.r.t. containment, but also w.r.t. the stricter form known as containment by homomorphism. This limitation is overcome by defining a set R Ã of rewriting rules which are still of the same simple form of traditional ones, but are expressive enough to catch at least containment by homomorphism. Then, an algorithm is proposed which exploits R Ã to provide approximate answers of queries along with a measure of their approximation degree.Index Terms-XPath, query relaxation, approximate query answering, information systems.

show abstract

Section: Related Workmentioning

confidence: 99%

XPath Query Relaxation through Rewriting Rules

Fazzinga

Flesca

Furfaro

2011

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

show abstract

“…The proposed fuzzy query processing techniques also allow the users to use linguistic terms in the queries represented by fuzzy sets. In [3], Buche et al 2006 proposed a fuzzy-based XML querying system that performs approximate comparisons between query and data trees. This technique supports imprecise data via possibility distributions.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Fuzzy XQueries are based on fuzzy set theory proposed by [3], whose goals are to store imprecise data, to process user's imprecise queries, and to provide proper information to users to overcome the drawbacks of the normal XQuery Operations. Fuzzy XQueries provide a representation scheme for dealing with vague or uncertain concepts.…”

Section: Fuzzy Xquery Processing Techniques For Xml Databasementioning

confidence: 99%

Information Retrieval Using Xquery Processing Techniques

Fredrick¹,

Radhamani²

2011

IJDMS

View full text Add to dashboard Cite

show abstract

“…The proposed indexing aims to reduce the complexity of finding approximate query patterns, avoiding sequentially scanning of all documents in the collection. Another recent paper [17] proposes a fuzzy-based XML querying system that performs approximate comparisons between query and data trees. This technique supports imprecise data via possibility distributions.…”

Section: Related Workmentioning

confidence: 99%

A fuzzy extension of the XPath query language

et al. 2008

View full text Add to dashboard Cite

XML has become a widespread format for data exchange over the Internet. The current state of the art in querying XML data is represented by XPath and XQuery, both of which rely on Boolean conditions for node selection. Boolean selection is too restrictive when users do not use or even know the data structure precisely, e.g. when queries are written based on a summary rather than on a precise representation of the schema. In this paper we describe a XML querying framework, called FuzzyXPath, based on Fuzzy Set Theory, relying on fuzzy conditions for the definition of flexible constraints on stored data. To this end, we introduce a function called "deep-similar", which aims at substituting XPath's typical "deep-equal" function. Its goal is to provide a degree of similarity between two XML trees, assessing whether they are similar both structure-wise and content-wise. Several query examples are discussed in the field of XML-based metadata for e-learning.

show abstract

Approximate Querying of XML Fuzzy Data

Cited by 11 publications

References 15 publications

XPath Query Relaxation through Rewriting Rules

XPath Query Relaxation through Rewriting Rules

Information Retrieval Using Xquery Processing Techniques

A fuzzy extension of the XPath query language

Contact Info

Product

Resources

About