RSS: A framework enabling ranked search on the semantic web

Ning, Xiaomin; Jin, Hai; Wu, Hao

doi:10.1016/j.ipm.2007.03.005

Cited by 25 publications

(10 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, the criteria for relevance in a federated infrastructure may also include trust and other factors, like response time and data quality. Existing ranking algorithms for RDF data, like RSS [43] or TripleRank [19], are not directly applicable because they are working on the link structure and do not take other aspects into account. Ranking is also important for the query optimization.…”

Section: Results Rankingmentioning

confidence: 99%

Federated Data Management and Query Optimization for Linked Open Data

Görlitz

Staab

2011

Studies in Computational Intelligence

View full text Add to dashboard Cite

Abstract.Linked Open Data provides data on the web in a machine readable way with typed links between related entities. Means of accessing Linked Open Data include crawling, searching, and querying. Search in Linked Open Data allows for more than just keyword-based, document-oriented data retrieval. Only complex queries across different data source can leverage the full potential of Linked Open Data. In this sense Linked Open Data is more similar to distributed/federated databases, but with less cooperation between the data sources, which are maintained independently and may update their data without notice. Since Linked Open Data is based on standards like the RDF format and the SPARQL query language, it is possible to implement a federation infrastructure without the need for specific data wrappers. However, some design issues of the current SPARQL standard limit the efficiency and applicability of query execution strategies. In this chapter we consider some details and implications of these limitations and presents an improved query optimization approach based on dynamic programming.

show abstract

Section: Results Rankingmentioning

confidence: 99%

Federated Data Management and Query Optimization for Linked Open Data

Görlitz

Staab

2011

Studies in Computational Intelligence

View full text Add to dashboard Cite

show abstract

“…Ning et al present a set of ranking algorithms and corresponding search algorithms for the semantic web [20]. The data representation in this research focuses on a weighted directed graph.…”

Section: B Semantic Search Methodsmentioning

confidence: 99%

“…For instance, in the RSS model, the transition probabilities distribution is a subjective process, subjecting to the designers' own perception to the relevant importance of relationship between subjects and objects [20]. The designers' perception and users' perception to such relationships are not able to be unified due to the difference of humans' understanding to any items in the real world.…”

Section: A Differentiation Between Designers and Users' Perceptionsmentioning

confidence: 99%

A survey in semantic search technologies

Dong

Hussain

Chang

2008

2008 2nd IEEE International Conference on Digital Ecosystems and Technologies

View full text Add to dashboard Cite

Abstract-In this paper, we make a survey over the primary literature regarding semantic search technologies. By classifying the literature into six main categories, we review their characteristics respectively. In addition, the issues within the reviewed semantic search methods and engines are analysed and concluded based on four perspectives.Index Terms-semantic search engines, semantic search methodologies, hybrid semantic search, XML search engines, ontology search engines, semantic multimedia search engines.

show abstract

“…The approaches can be divided into two groups, i.e. one that focuses on coherence of data nodes [1], [2], [8], and the other focusing on independence of data nodes [4]. Figure 1 shows an example of those approaches.…”

Section: Background and Motivationmentioning

confidence: 99%

“…Recently, keyword-based search approaches have been proposed in the literature of ontology and Semantic Web [1], [2], [8], [9]. In the methods, semantic search over a graph structured data such as ontology is often performed in three phases: keyword matching, semantic expansion, and resource mapping.…”

Section: Introductionmentioning

confidence: 99%

Improving Keyword Match for Semantic Search

Kim

Park

Lee

2011

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYSemantic search can be divided into three steps. Keyword matching, the first step, significantly impacts the search results, since the following steps are based on it. In this paper, we propose a keyword matching methodology that aggregates relevance scores of the related text to define the score of an object. Validity of the approach is shown by experiments performed with three public data sets and the detailed analysis of the results.

show abstract

RSS: A framework enabling ranked search on the semantic web

Cited by 25 publications

References 30 publications

Federated Data Management and Query Optimization for Linked Open Data

Federated Data Management and Query Optimization for Linked Open Data

A survey in semantic search technologies

Improving Keyword Match for Semantic Search

Contact Info

Product

Resources

About