Keyword based search over semantic data in polynomial time

Cappellari, Paolo; Virgilio, Roberto De; Maccioni, Antonio; Miscione, Michele

doi:10.1109/icdew.2010.5452697

Cited by 2 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If we consider the query Q 2 , we have to evaluate again the score of pt1, pt2 and pt3. The result is pt1 [1,88], pt2 [3,85] and pt3 [1,23]. In this case we rank the clusters as follows: [CL2, CL1, CL3].…”

Section: And (Iii)mentioning

confidence: 94%

“…template #-reviewer-#-fullname-#) containing respectively pt1, pt2 and pt3. With respect to Q 1 , YAANII assigns the following scores: pt1 [1,31], pt2 [4,55] and pt3 [1,83]. In this way we have the following ranking between clusters: [CL2, CL3, CL1].…”

Section: And (Iii)mentioning

confidence: 97%

“…In [1] we described the computational complexity of the frameworks cited in the Introduction. The final result we have obtained is that YAANII shows the lowest computational cost among the approaches considered.…”

Section: Efficiency Of Rankingmentioning

confidence: 99%

“…To this aim, in [2] we provided YAANII, a novel keyword based search technique that leverages a joint use of scoring functions and solution building algorithms. As demonstrated in [1], our technique allows us to reduce relevantly the computational complexity of the overall process. The contribution of this paper is a theoretical study on using an incremental IR ranking process when building solutions for the keyword search on RDF graphs.…”

Section: Introductionmentioning

confidence: 96%

See 3 more Smart Citations

Efficient and effective ranking in Top-k exploration for keyword search on RDF

Virgilio

2011

2011 IEEE International Conference on Information Reuse &Amp; Integration

Self Cite

View full text Add to dashboard Cite

Ranking solutions is an important issue in InformationRetrieval because it greatly influences the quality of results. In this context, keyword based search approaches use to consider solutions sorting as least step of the overall process. Ranking and building solutions are completely separate steps running autonomously. This may penalize the retrieving information process because it binds to order all found matching elements including (possible) irrelevant information. In this paper we present a theoretical study of YAANII, a novel technique to keyword based search over semantic data. We demonstrate how effectiveness of the answers depends not so much on the quality of the scoring metrics but on the way such criteria are involved.

show abstract

Section: And (Iii)mentioning

confidence: 94%

Section: And (Iii)mentioning

confidence: 97%

Section: Efficiency Of Rankingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 96%

See 2 more Smart Citations

Efficient and effective ranking in Top-k exploration for keyword search on RDF

Virgilio

2011

2011 IEEE International Conference on Information Reuse &Amp; Integration

Self Cite

View full text Add to dashboard Cite

show abstract

A Path-Oriented RDF Index for Keyword Search Query Processing

Cappellari

Virgilio

Maccioni

et al. 2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

"Most of the recent approaches to keyword search employ graph structured representation of data. Answers to queries are generally sub-structures of the graph, containing one or more keywords. While finding the nodes matching keywords is relatively easy, determining the connections between such nodes is a complex problem requiring on-the-fly time consuming graph exploration. Current techniques suffer from poorly performing worst case scenario or from indexing schemes that provide little support to the discovery of connections between nodes. In this paper, we present an indexing scheme for RDF that exposes the structural characteristics of the graph, its paths and the information on the reachability of nodes. This knowledge is exploited to expedite the retrieval of the sub-structures representing the query results. In addition, the index is organized to facilitate maintenance operations as the dataset evolves. Experimental results demonstrates the feasibility of our index that significantly improves the query execution performance.

show abstract

Keyword based search over semantic data in polynomial time

Cited by 2 publications

References 9 publications

Efficient and effective ranking in Top-k exploration for keyword search on RDF

Efficient and effective ranking in Top-k exploration for keyword search on RDF

A Path-Oriented RDF Index for Keyword Search Query Processing

Contact Info

Product

Resources

About