Efficient Subgraph Matching on Large RDF Graphs Using MapReduce

Data Science and Engineering - Germany
doi 10.1007/s41019-019-0090-z
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Incremental Frequent Subgraph Mining on Large Evolving Graphs

IEEE Transactions on Knowledge and Data Engineering
Computational TheoryComputer Science ApplicationsInformation SystemsMathematics
2017English

Subgraph Matching

Proceedings of the VLDB Endowment
Computer Science
2017English

Subgraph Matching Using Graph Neural Network

Journal of Intelligent Learning Systems and Applications
2012English

Scalable Indexing of RDF Graphs for Efficient Join Processing

2009English

Efficient Matching of Dynamically Changing Graphs

Theory and Applications of Image Analysis
1992English

Streaming Saturation for Large RDF Graphs With Dynamic Schema Information

2019English

Algebra of RDF Graphs for Querying Large-Scale Distributed Triple-Store

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1976English

Controlling Access to RDF Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy