Toward Ontology-Guided Knowledge-Driven XML Query Relaxation

Hill, J. P.; Torson, Jeff; Guo, Bo; Chen, Zhengxin

doi:10.1109/cimsim.2010.22

Cited by 9 publications

(6 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The use of adaptive methods will be studied where (a large part of) a previous solution might be reused to obtain a new solution. As further fields of study, partial index maintenance for the fragments as well as the application of the approach to other data formats (like XML or RDF data [41,42,43]).…”

Section: Discussionmentioning

confidence: 99%

“…With what they call "incremental relaxation" they apply generalization operators to single conjuncts in a conjunctive query; hence generalized queries form a lattice structure: queries with the same number of applications generalization operators are in the same level of the lattice. Ontology-based query relaxation has also been studied for non-relational data (like XML data in [41] or RDF data in [42]). With these graph structured data it might even be harder for a user to exactly express his query intent.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Replication Scheme for Multiple Fragmentations with Overlapping Fragments

Wiese

Waage

Bollwein

2016

The Computer Journal

View full text Add to dashboard Cite

In this article, we introduce a replication procedure in a distributed database system that supports several fragmentations of the same data table. One application that requires multiple fragmentations is flexible (similarity-based) query answering. The major feature of our replication procedure is that replication and recovery respect the overlaps of fragments stemming from different fragmentations. In this paper we extend the data replication problem (DRP) by not only considering hard constraints to ensure a fixed replication factor but also adding soft constraints that express desired data locality of fragments. We furthermore analyze the case that there are more fragmentations (leading to the situation that some replication conditions are optional); and we study the influences of data updates (insertions and deletions) on the data distribution.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

A Replication Scheme for Multiple Fragmentations with Overlapping Fragments

Wiese

Waage

Bollwein

2016

The Computer Journal

View full text Add to dashboard Cite

show abstract

“…All these investigations focus on the modification of the user original query constraints on the content level rather than the semantic analysis of the original query constraints. Hill et al [29], used the ontology information to relax structured XML queries. Farfan et al [34], proposed XOn-toRank system to address the ontology-aware XML key-word search of electronic medical records.…”

Section: Related Workmentioning

confidence: 99%

No-but-semantic-match: computing semantically matched xml keyword search results

et al. 2017

View full text Add to dashboard Cite

Users are rarely familiar with the content of a data source they are querying, and therefore cannot avoid using keywords that do not exist in the data source. Traditional systems may respond with an empty result, causing dissatisfaction, while the data source in effect holds semantically related content. In this paper we study this no-but-semantic-match problem on XML keyword search and propose a solution which enables us to present the top-k semantically related results to the user. Our solution involves two steps: (a) extracting semantically related candidate queries from the original query and (b) processing candidate queries and retrieving the top-k semantically related results. Candidate queries are generated by replacement of nonmapped keywords with candidate keywords obtained from an ontological knowledge base. Candidate results are scored using their cohesiveness and their similarity to the original query. Since the number of queries to process can be large, with each result having to be analyzed, we propose pruning techniques to retrieve the top-k results efficiently. We develop two query processing algorithms based on our pruning techniques. Further, we exploit a property of the candidate queries to propose a technique for processing multiple queries in batch, which improves the performance substantially. Extensive experiments on two real datasets verify the effectiveness and efficiency of the proposed approaches.

show abstract

“…Some approaches have used taxonomies or ontologies for flexible query answering but did not consider their application for distributed storage of data: CoBase [26] used a type abstraction hierarchy to generalize values; Shin et al [27] use some specific notion of metric distance in a knowledge abstraction hierarchy to identify semantically related answers; Halder and Cortesi [28] define a partial order between cooperative answers based on their abstract interpretation framework; Muslea [29] discusses the relaxation of queries in disjunctive normal form. Ontology-based query relaxation has also been studied for non-relational data (like XML data in [30]). …”

Section: Flexible Query Answeringmentioning

confidence: 99%

Clustering-based fragmentation and data replication for flexible query answering in distributed databases

Wiese

2014

J Cloud Comp

View full text Add to dashboard Cite

One feature of cloud storage systems is data fragmentation (or sharding) so that data can be distributed over multiple servers and subqueries can be run in parallel on the fragments. On the other hand, flexible query answering can enable a database system to find related information for a user whose original query cannot be answered exactly. Query generalization is a way to implement flexible query answering on the syntax level. In this paper we study a clustering-based fragmentation for the generalization operator Anti-Instantiation with which related information can be found in distributed data. We use a standard clustering algorithm to derive a semantic fragmentation of data in the database. The database system uses the derived fragments to support an intelligent flexible query answering mechanism that avoids overgeneralization but supports data replication in a distributed database system. We show that the data replication problem can be expressed as a special Bin Packing Problem and can hence be solved by an off-the shelf solver for integer linear programs. We present a prototype system that makes use of a medical taxonomy to determine similarities between medical expressions.

show abstract

Toward Ontology-Guided Knowledge-Driven XML Query Relaxation

Cited by 9 publications

References 8 publications

A Replication Scheme for Multiple Fragmentations with Overlapping Fragments

A Replication Scheme for Multiple Fragmentations with Overlapping Fragments

No-but-semantic-match: computing semantically matched xml keyword search results

Clustering-based fragmentation and data replication for flexible query answering in distributed databases

Contact Info

Product

Resources

About