Distributed keyword approximate search method for RDF

DOI10.3969/J.ISSN.0253-2778.2017.10.004MaRDI QIDQ4641089zbMATH OpenFDO

Authors Yuan Chen, Jingbin Wang

Publication date 25 May 2018

Full work available at URL https://doi.org/10.3969/J.ISSN.0253-2778.2017.10.004

zbMATH Keywords

approximate searchkeywordMapReduce

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Knowledge representation (68T30) Distributed algorithms (68W15)

Recommendations

• RDF keyword search by the condensed entity summary graph
• RDF keyword search using multiple indexes
• Efficient distributed query processing on large scale RDF graph data
• A Top-K keyword search for supporting semantics in relational databases
• RDF approximate queries based on semantic similarity

Cited in

(5)

• RDF approximate queries based on semantic similarity
• RDF keyword search using multiple indexes
• A practically efficient algorithm for generating answers to keyword search over data graphs
• RDF keyword search by the condensed entity summary graph
• Approximate spreading activation for efficient knowledge retrieval from large datasets

This page was built for publication: Distributed keyword approximate search method for RDF

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4641089)