A language extension for graph processing and its formal semantics
Communications of the ACM
RQL: a declarative query language for RDF
Proceedings of the 11th international conference on World Wide Web
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
RDF Aggregate Queries and Views
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Scalable semantic web data management using vertical partitioning
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Towards distributed processing of RDF path queries
International Journal of Web Engineering and Technology
Planetary-scale views on a large instant-messaging network
Proceedings of the 17th international conference on World Wide Web
Pig latin: a not-so-foreign language for data processing
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
nSPARQL: A Navigational Language for RDF
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
An Experimental Comparison of RDF Data Management Approaches in a SPARQL Benchmark Scenario
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Extending SPARQL with regular expression patterns (for querying RDF)
Web Semantics: Science, Services and Agents on the World Wide Web
SP^2Bench: A SPARQL Performance Benchmark
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Representing, Querying and Transforming Social Networks with RDF/SPARQL
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Semantics and complexity of SPARQL
ACM Transactions on Database Systems (TODS)
PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations
ICDM '09 Proceedings of the 2009 Ninth IEEE International Conference on Data Mining
Hadoop: The Definitive Guide
SPARQL basic graph pattern processing with iterative MapReduce
Proceedings of the 2010 Workshop on Massive Data Analytics on the Cloud
A comparison of join algorithms for log processing in MaPreduce
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Data Intensive Query Processing for Large RDF Graphs Using Cloud Computing Tools
CLOUD '10 Proceedings of the 2010 IEEE 3rd International Conference on Cloud Computing
Data-Intensive Text Processing with MapReduce
Data-Intensive Text Processing with MapReduce
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
A RPL through RDF: expressive navigation in RDF graphs
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Processing theta-joins using MapReduce
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
PigSPARQL: mapping SPARQL to Pig Latin
Proceedings of the International Workshop on Semantic Web Information Management
Querying RDF data from a graph database perspective
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Web and semantic web query languages: a survey
Proceedings of the First international conference on Reasoning Web
Proceedings of the 22nd international conference on World Wide Web
Hi-index | 0.00 |
The MapReduce programming model has gained traction in different application areas in recent years, ranging from the analysis of log files to the computation of the RDFS closure. Yet, for most users the MapReduce abstraction is too low-level since even simple computations have to be expressed as Map and Reduce phases. In this paper we propose RDFPath, an expressive RDF path query language geared towards casual users that benefits from the scaling properties of the MapReduce framework by automatically transforming declarative path queries into MapReduce jobs. Our evaluation on a real world data set shows the applicability of RDFPath for investigating typical graph properties like shortest paths.