3 research outputs found

    Managing RDF Graphs using Mapreduce Algorithm with Indexing Solution for Future Direction

    Get PDF
    �Indexing solution� based on Big RDF (Resource Description Framework) graphs with improve processing which populate the semantic web, are the core data structure of the big web data, the natural transposition of big data on the web. Indexing data structure improve processing on the big RDF graph. it was present the �baseline operation� of fortunate web big data analytic. this require process, access and manage RDF graphs. It was dealing with severe temporal complexity. A solution to problem is represented by MapReduce model based algorithm for indexing solution which try to exploit the computation power offered by the MapReduce processing model in indexing order. this paper provide a survey on MapReduce based algorithm for state-of-the-art proposal using indexing solution

    Workload Matters: A Robust Approach to Physical RDF Database Design

    Get PDF
    Recent advances in Information Extraction, Linked Data Management and the Semantic Web have led to a rapid increase in both the volume and the variety of publicly available graph-structured data. As more and more businesses start to capitalize on graph-structured data, data management systems are being exposed to workloads that are far more diverse and dynamic than what they were designed to handle. In particular, most systems rely on a workload-oblivious physical layout with a fixed-schema and are adaptive only if the changes in the schema are minor. Thus, they are unable to perform consistently well across different types of workloads. This thesis introduces fundamental techniques for supporting diverse and dynamic workloads in RDF data management systems. Instead of assuming anything about the workload upfront, these techniques allow systems to adjust their physical designs as queries are executed. This includes changing the way (i) records are clustered in the storage system, (ii) data are organized and indexed, and (iii) queries are optimized, all at runtime. The thesis proceeds with a discussion of the challenges that have been encountered in implementing these ideas in a proof-of-concept prototype called chameleon-db, and it concludes with a thorough experimental evaluation
    corecore