RDF keyword search using multiple indexes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Patterns for Keyword Search in RDF Graphs

An increasing number of RDF datasets are available on the Web. Querying RDF data requires the knowledge of a query language such as SPARQL; it also requires some information describing the content of these datasets. The goal of our work is to facilitate the querying of RDF datasets, and we present an approach for enabling users to search in RDF data using keywords. We introduce the notion of pa...

متن کامل

RDF Keyword Search Using a Type-based Summary

Keyword search enjoys great popularity due to succinctness and easy operability for exploring RDF data. SPARQL has been recommended as the standard query language that can retrieve any answers users need from available RDF data. Thus, keyword search based on keywords-to-SPARQL attracts more and more attention. However, existing solutions have main limitations that the summary index used for tra...

متن کامل

Efficient Keyword Search on Large Rdf Data Using Optimization Technique

Now a day’s keyword search in data mining is very emerging topic. Latest keyword search techniques on Semantic Web are moving away from shallow, information retrieval-style approaches that merely find ―keyword matches‖ towards more interpretive approaches that attempt to induce structure from keyword queries. Exploiting identity links among RDF resources allows applications to efficiently integ...

متن کامل

RDivF: Diversifying Keyword Search on RDF Graphs

In this paper, we outline our ongoing work on diversifying keyword search results on RDF data. Given a keyword query over an RDF graph, we define the problem of diversifying the search results and we present diversification criteria that take into consideration both the content and the structure of the results, as well as the underlying

متن کامل

k-nearest keyword search in RDF graphs

Resource Description Framework (RDF) has been widely used as a W3C standard to describe the resource information in the Semantic Web. A standard SPARQL query over RDF data requires query issuers to fully understand the domain knowledge of the data. Because of this fact, SPARQL queries over RDF data are not flexible and it is difficult for non-experts to create queries without knowing the underl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Filomat

سال: 2018

ISSN: 0354-5180,2406-0933

DOI: 10.2298/fil1805861l