Abstract
Minimum motif-cut: a workload-aware RDF graph partitioning strategy
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The VLDB Journal The International Journal on Very Large Data Bases
Paper Title
Journal
Date
