Abstract
Emerging applications such as Web 2.0 and linked data has significantly contributed to the volume of data on the Web. Web 2.0 applications are dynamic in nature, and require frequent and real time update. However, substantial progress in the management of RDF data is focusing on speeding up query processing on the so called static data, such as the linked data. Approaches that are focusing on the static data tend to implement heavy indexing or decomposed techniques that cause updating to be inefficient. Among the RDF store implementations, the big triple table appears to be a robust approach that can be further explored. This paper aims to increase the understanding of the different approaches used in managing the RDF data and discussing the issues in managing Web 2.0 based applications, in order to realize the semantic web vision.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
