Web technologies for environmental Big Data

Vitolo, Claudia; Elkhatib, Yehia; Reusser, Dominik E.; Macleod, Christopher; Buytaert, Wouter

doi:10.1016/j.envsoft.2014.10.007

Cited by 205 publications

(96 citation statements)

References 48 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In particular, the target cluster comprises five hosts having the hardware described in Table 1. MapReduce as to cope with the volume of big Web data, following the strict requirements dictated by recent applications dealing with this kind of data (e.g., [75,76]). …”

Section: Experimental Analysis and Resultsmentioning

confidence: 99%

An Effective and Efficient MapReduce Algorithm for Computing BFS-Based Traversals of Large-Scale RDF Graphs

2016

View full text Add to dashboard Cite

Nowadays, a leading instance of big data is represented by Web data that lead to the definition of so-called big Web data. Indeed, extending beyond to a large number of critical applications (e.g., Web advertisement), these data expose several characteristics that clearly adhere to the well-known 3V properties (i.e., volume, velocity, variety). Resource Description Framework (RDF) is a significant formalism and language for the so-called Semantic Web, due to the fact that a very wide family of Web entities can be naturally modeled in a graph-shaped manner. In this context, RDF graphs play a first-class role, because they are widely used in the context of modern Web applications and systems, including the emerging context of social networks. When RDF graphs are defined on top of big (Web) data, they lead to the so-called large-scale RDF graphs, which reasonably populate the next-generation Semantic Web. In order to process such kind of big data, MapReduce, an open source computational framework specifically tailored to big data processing, has emerged during the last years as the reference implementation for this critical setting. In line with this trend, in this paper, we present an approach for efficiently implementing traversals of large-scale RDF graphs over MapReduce that is based on the Breadth First Search (BFS) strategy for visiting (RDF) graphs to be decomposed and processed according to the MapReduce framework. We demonstrate how such implementation speeds-up the analysis of RDF graphs with respect to competitor approaches. Experimental results clearly support our contributions.

show abstract

Section: Experimental Analysis and Resultsmentioning

confidence: 99%

An Effective and Efficient MapReduce Algorithm for Computing BFS-Based Traversals of Large-Scale RDF Graphs

2016

View full text Add to dashboard Cite

show abstract

“…Annotations have the potential to enable new kinds of workflows where editors, authors, and reviewers all participate in conversations focussed on research manuscripts or other digital objects, either in a closed or public environment ( Vitolo et al , 2015). At the present, activity performed by Hypothesis and other Web annotation services is poorly recognized in scholarly communities, although such activities can be tied to ORCID .…”

Section: Potential Future Modelsmentioning

confidence: 99%

A multi-disciplinary perspective on emergent and future innovations in peer review

et al. 2017

Self Cite

View full text Add to dashboard Cite

Peer review of research articles is a core part of our scholarly communication system. In spite of its importance, the status and purpose of peer review is often contested. What is its role in our modern digital research and communications infrastructure? Does it perform to the high standards with which it is generally regarded? Studies of peer review have shown that it is prone to bias and abuse in numerous dimensions, frequently unreliable, and can fail to detect even fraudulent research. With the advent of web technologies, we are now witnessing a phase of innovation and experimentation in our approaches to peer review. These developments prompted us to examine emerging models of peer review from a range of disciplines and venues, and to ask how they might address some of the issues with our current systems of peer review. We examine the functionality of a range of social Web platforms, and compare these with the traits underlying a viable peer review system: quality control, quantified performance metrics as engagement incentives, and certification and reputation. Ideally, any new systems will demonstrate that they out-perform and reduce the biases of existing models as much as possible. We conclude that there is considerable scope for new peer review initiatives to be developed, each with their own potential issues and advantages. We also propose a novel hybrid platform model that could, at least partially, resolve many of the socio-technical issues associated with peer review, and potentially disrupt the entire scholarly communication system. Success for any such development relies on reaching a critical threshold of research community engagement with both the process and the platform, and therefore cannot be achieved without a significant change of incentives in research environments.

show abstract

“…Geospatial web services are a special kind of web service that provide access to heterogeneous geographic information on the Internet (Peng, Zhao, and Zhang 2011). THREDDS, GeoServer or rasdaman are common server solutions for geospatial web services (Vitolo et al 2015).…”

Section: Web-based Access To and Processing Of Big Earth Datamentioning

confidence: 99%

“…Big Earth Data can comprise of long time-series of multi-dimensional geospatial data sets available from satellites, ground-based sensors or numerical-weather prediction (NWP) models (Overpeck et al 2011;Yang et al 2011;Vitolo et al 2015 ;Dasgupta 2016). Advancements in sensing technologies and continuous improvements of NWP and climate models have improved their accuracy and spatio-temporal scope (Yang et al 2011).…”

Section: Introductionmentioning

confidence: 99%

Geospatial web services pave new ways for server-based on-demand access and processing of Big Earth Data

Wagemann

Clements

Figuera

et al. 2017

International Journal of Digital Earth

View full text Add to dashboard Cite

show abstract

Web technologies for environmental Big Data

Cited by 205 publications

References 48 publications

An Effective and Efficient MapReduce Algorithm for Computing BFS-Based Traversals of Large-Scale RDF Graphs

An Effective and Efficient MapReduce Algorithm for Computing BFS-Based Traversals of Large-Scale RDF Graphs

A multi-disciplinary perspective on emergent and future innovations in peer review

Geospatial web services pave new ways for server-based on-demand access and processing of Big Earth Data

Contact Info

Product

Resources

About