Efficient distributed query processing on large scale RDF graph data

DOI10.13328/J.CNKI.JOS.005696MaRDI QIDQ5196894zbMATH OpenFDO

Authors Xin Wang, Qiang Xu, Lele Chai, Yajun Yang, Yunpeng Chai

Publication date 20 September 2019

zbMATH Keywords

MapReducestar decompositionbasic graph pattern matchinglarge scale RDF graphs

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Knowledge representation (68T30) Database theory (68P15)

Recommendations

• Top-\( k\) queries on RDF graphs
• An effective and efficient MapReduce algorithm for computing BFS-based traversals of large-scale RDF graphs
• Semantic extension of query for RDF data
• Efficiently Querying RDF(S) Ontologies with Answer Set Programming
• An efficient SQL-based querying method to RDF schemata

Cited in

(8)

• An effective and efficient MapReduce algorithm for computing BFS-based traversals of large-scale RDF graphs
• Top-\( k\) queries on RDF graphs
• A distributional structured semantic space for querying RDF graph data
• Approximate spreading activation for efficient knowledge retrieval from large datasets
• An efficient SQL-based querying method to RDF schemata
• Efficient ELM-based two stages query processing optimization for big data
• Semantic extension of query for RDF data
• Distributed keyword approximate search method for RDF

This page was built for publication: Efficient distributed query processing on large scale RDF graph data

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