Managing Semantic Loss during Query Reformulation in Peer Data Management Systems

Delveroudis, Yannis; Lekeas, Paraskevas V.

doi:10.1109/swod.2007.353199

Cited by 4 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By the "query semantics", we mean the set of terms (i.e., concepts and properties), which are required at query formulation time. To this end, two aspects should be considered, namely: (i) query reformulation along the peers should take into account what users defined as important in the original submitted query; and (ii) the query routing process should avoid forwarding a reformulated query which has been identified with a high degree of semantic loss (Delveroudis and Lekeas, 2007).…”

Section: Introductionmentioning

confidence: 99%

Preserving the Original Query Semantics in Routing Processes

Freire

Cysneiros

Souza

et al. 2014

Proceedings of the 16th International Conference on Enterprise Information Systems

View full text Add to dashboard Cite

In distributed data environments, peers (data sources) are connected with each other through a set of semantic correspondences in such a way that peers directly connected are called semantic neighbours. Queries are submitted considering partial information provided by a peer schema and may be answered by other neighbour peers. From the query submission peer, the original query is successively rewritten into queries over the peers, according to the correspondences between the original peer and the target ones. In this process, some of the original query terms may be lost while other ones may be added, leading to a semantic loss of the original query. In this work, we argue that it is essential to try preserving the original query semantics if we wish to hold what the users defined as important at query submission time. With this in mind, we propose an approach to preserve the original query semantics in query routing processes. Furthermore, we present a metric for assessing the relevance of neighbour peers according to an estimated query semantic value obtained at each query reformulation. In this paper, we present the developed approach and some experimental results we have accomplished.

show abstract

Section: Introductionmentioning

confidence: 99%

Preserving the Original Query Semantics in Routing Processes

Freire

Cysneiros

Souza

et al. 2014

Proceedings of the 16th International Conference on Enterprise Information Systems

View full text Add to dashboard Cite

show abstract

“…The idea of semantic loss during query reformulation has been addressed in a few works (Delveroudis and Lekeas, 2007), and in the context of information loss problem (Aberer et al, 2003;Roth and Naumann, 2007;Kantere et al, 2009;Mena et al, 2000). Usually, in a PDMS, a peer reformulates a query to its neighbours which, in most of the cases, have a different schema.…”

Section: Introductionmentioning

confidence: 99%

“…Usually, in a PDMS, a peer reformulates a query to its neighbours which, in most of the cases, have a different schema. In this sense, the query may loss some of its significance, i.e., occurring loss of information from the original query to the reformulated query (Delveroudis and Lekeas, 2007). As a result of this information loss, the query answer may be discrepant when related to the information requested by the user or may be an empty result.…”

Section: Introductionmentioning

confidence: 99%

Semantic measures as information quality criteria for query routing processes

Freire

Souza

Salgado

et al. 2013

IJBIDM

View full text Add to dashboard Cite

Query answering has been addressed as a key issue in distributed environments such as peer data management systems (PDMS). An important step in this process regards query routing, i.e., how to find peers (data sources) that are most likely to provide results according to the submitted query. In this process, queries are reformulated and propagated through network peers using the semantic mappings between neighbour peers' schemas. The successive processes of query reformulation may result in a semantic loss of the original query, i.e., concepts which belong to the original query may be lost when reformulated queries are produced. Thereby, this work proposes the use of semantic measures obtained from information quality (IQ) criteria aiming to avoid or minimise this semantic loss. Moreover, it combines semantic information and IQ, by presenting a model, which is instantiated to illustrate how this proposal produces the semantic measures and enhances query routing processes.

show abstract