Danh Le-Phuoc
National University of Ireland, Galway
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Danh Le-Phuoc.
international world wide web conferences | 2009
Danh Le-Phuoc; Axel Polleres; Manfred Hauswirth; Giovanni Tummarello; Christian Morbidoni
The use of RDF data published on the Web for applications is still a cumbersome and resource-intensive task due to the limited software support and the lack of standard programming paradigms to deal with everyday problems such as combination of RDF data from dierent sources, object identifier consolidation, ontology alignment and mediation, or plain querying and filtering tasks. In this paper we present a framework, Semantic Web Pipes, that supports fast implementation of Semantic data mash-ups while preserving desirable properties such as abstraction, encapsulation, component-orientation, code re-usability and maintainability which are common and well supported in other application areas.
Journal of Web Semantics | 2012
Danh Le-Phuoc; Hoan Quoc Nguyen-Mau; Josiane Xavier Parreira; Manfred Hauswirth
The Web has long exceeded its original purpose of a distributed hypertext system and has become a global, data sharing and processing platform. This development is confirmed by remarkable milestones such as the Semantic Web, Web services, social networks and mashups. In parallel with these developments on the Web, the Internet of Things (IoT), i.e., sensors and actuators, has matured and has become a major scientific and economic driver. Its potential impact cannot be overestimated-for example, in logistics, cities, electricity grids and in our daily life, in the form of sensor-laden mobile phones-and rivals that of the Web itself. While the Web provides ease of use of distributed resources and a sophisticated development and deployment infrastructure, the IoT excels in bringing real-time information from the physical world into the picture. Thus a combination of these players seems to be the natural next step in the development of even more sophisticated systems of systems. While only starting, there is already a significant amount of sensor-generated, or more generally dynamic information, available on the Web. However, this information is not easy to access and process, depends on specialised gateways and requires significant knowledge on the concrete deployments, for example, resource constraints and access protocols. To remedy these problems and draw on the advantages of both sides, we try to make dynamic, online sensor data of any form as easily accessible as resources and data on the Web, by applying well-established Web principles, access and processing methods, thus shielding users and developers from the underlying complexities. In this paper we describe our Linked Stream Middleware (LSM, http://lsm.deri.ie/), which makes it easy to integrate time-dependent data with other Linked Data sources, by enriching both sensor sources and sensor data streams with semantic descriptions, and enabling complex SPARQL-like queries across both dataset types through a novel query processing engine, along with means to mashup the data and process results. Most prominently, LSM provides (1) extensible means for real-time data collection and publishing using a cloud-based infrastructure, (2) a Web interface for data annotation and visualisation, and (3) a SPARQL endpoint for querying unified Linked Stream Data and Linked Data. We describe the system architecture behind LSM, provide details of how Linked Stream Data is generated, and demonstrate the benefits and efficiency of the platform by showcasing some experimental evaluations and the systems interface.
international semantic web conference | 2012
Danh Le-Phuoc; Minh Dao-Tran; Minh-Duc Pham; Peter A. Boncz; Thomas Eiter; Michael Fink
Linked Stream Data, i.e., the RDF data model extended for representing stream data generated from sensors social network applications, is gaining popularity. This has motivated considerable work on developing corresponding data models associated with processing engines. However, current implemented engines have not been thoroughly evaluated to assess their capabilities. For reasonable systematic evaluations, in this work we propose a novel, customizable evaluation framework and a corresponding methodology for realistic data generation, system testing, and result analysis. Based on this evaluation environment, extensive experiments have been conducted in order to compare the state-of-the-art LSD engines wrt. qualitative and quantitative properties, taking into account the underlying principles of stream processing. Consequently, we provide a detailed analysis of the experimental outcomes that reveal useful findings for improving current and future engines.
international semantic web conference | 2013
Danh Le-Phuoc; Hoan Nguyen Mau Quoc; Chan Le Van; Manfred Hauswirth
Linked Stream Data extends the Linked Data paradigm to dynamic data sources. It enables the integration and joint processing of heterogeneous stream data with quasi-static data from the Linked Data Cloud in near-real-time. Several Linked Stream Data processing engines exist but their scalability still needs to be in improved in terms of (static and dynamic) data sizes, number of concurrent queries, stream update frequencies, etc. So far, none of them supports parallel processing in the Cloud, i.e., elastic load profiles in a hosted environment. To remedy these limitations, this paper presents an approach for elastically parallelizing the continuous execution of queries over Linked Stream Data. For this, we have developed novel, highly efficient, and scalable parallel algorithms for continuous query operators. Our approach and algorithms are implemented in our CQELS Cloud system and we present extensive evaluations of their superior performance on Amazon EC2 demonstrating their high scalability and excellent elasticity in a real deployment.
Reasoning Web International Summer School | 2012
Danh Le-Phuoc; Josiane Xavier Parreira; Manfred Hauswirth
Linked Stream Data has emerged as an effort to represent dynamic, time-dependent data streams following the principles of Linked Data. Given the increasing number of available stream data sources like sensors and social network services, Linked Stream Data allows an easy and seamless integration, not only among heterogenous stream data, but also between streams and Linked Data collections, enabling a new range of real-time applications.
international conference on semantic systems | 2010
Danh Le-Phuoc; Josiane Xavier Parreira; Michael Hausenblas; Yuanbo Han; Manfred Hauswirth
There are millions of sensors being deployed all over the world. Data generated by these sensors is provided in different formats and interfaces and is rarely associated with semantics that describe its meaning. The heterogeneity and lack of semantic descriptions pose a big barrier for accessing sensor data and combining it with other data sources. The Live Linked Open Sensor Database project is the first project to provide a live database of semantically enriched sensor data, where each sensor reading is extended by adding proper metadata and by linking it to resources in the Linked Open Data Cloud. Currently, the database provides information of approximately 200,000 sensors and we are currently working on expanding it to incorporate even more data sources.
Journal of Web Semantics | 2016
Danh Le-Phuoc; Hoan Nguyen Mau Quoc; Hung Ngo Quoc; Tuan Tran Nhat; Manfred Hauswirth
The Internet of Things (IoT) with billions of connected devices has been generating an enormous amount of data every hour. Connecting every data item generated by IoT to the rest of the digital world to turn this data into meaningful actions will create new capabilities, richer experiences, and unprecedented economic opportunities for businesses, individuals, and countries. However, providing an integrated view for exploring and querying such data at real-time is extremely challenging due to its Big Data natures: big volume, fast real-time update and messy data sources. To address this challenge, we provide a unified integrated and live view for heterogeneous IoT data sources using Linked Data, called the Graph of Things (GoT). GoT is backed by a scalable and elastic software stack to deal with billions of records of historical and static datasets in conjunction with millions of triples being fetched and enriched to connect to GoT per hour in real time. GoT makes approximately a half of million stream data sources queryable via a SPARQL endpoint and a continuous query channel that enable us to create a live explorer of GoT (http://graphofthings.org/) with just HTML and Javascript.
The Future Internet Assembly | 2013
Martin Serrano; Danh Le-Phuoc; Maciej Zaremba; Alex Galis; Sami Bhiri; Manfred Hauswirth
IoT Cloud systems provide scalable capacity and dynamic behaviour control of virtual infrastructures for running applications, services and processes. Key aspects in this type of complex systems are the resource optimisation and the performance of dynamic management based on distributed user data metrics and/or IoT application data demands and/or resource utilisation metrics. In this paper we particularly focus on Cloud management perspective – integrating IoT Cloud service data management - based on annotated data of monitored Cloud performance and user profiles (matchmaking) and enabling management systems to use shared infrastructures and resources to enable efficient deployment of IoT services and applications. We illustrate a Cloud service management approach based on matchmaking operations and self-management principles which enable improved distribution and management of IoT services across different Cloud vendors and use the results from the analysis as mechanism to control applications and services deployment in Cloud systems. For our IoT Cloud data management solution we utilize performance metrics expressed with linked data in order to integrate monitored performance data and end user profile information (via linked data relations).
international semantic web conference | 2014
Danh Le-Phuoc; Anh Le-Tuan; Gregor Schiele; Manfred Hauswirth
Mobile devices are becoming a central data integration hub for personal information. Thus, an up-to-date, comprehensive and consolidated view of this information across heterogeneous personal information spaces is required. Linked Data offers various solutions for integrating personal information, but none of them comprehensively addresses the specific resource constraints of mobile devices. To address this issue, this paper presents a unified data integration framework for resource-constrained mobile devices. Our generic, extensible framework not only provides a unified view of personal data from different personal information data spaces but also can run on a users mobile device without any external server. To save processing resources, we propose a data normalisation approach that can deal with ID-consolidation and ambiguity issues without complex generic reasoning. This data integration approach is based on a triple storage for Android devices with small memory footprint. We evaluate our framework with a set of experiments on different devices and show that it is able to support complex queries on large personal data sets of more than one million triples on typical mobile devices with very small memory footprint.
Journal of Web Semantics | 2017
Danh Le-Phuoc
To enable efficiency in stream processing, the evaluation of a query is usually performed over bounded parts of (potentially) unbounded streams, i.e., processing windows ‘‘slide’’ over the streams. To avoid inefficient re-evaluations of already evaluated parts of a stream in respect to a query, incremental evaluation strategies are applied, i.e., the query results are obtained incrementally from the result set of the preceding processing state without having to re-evaluate all input buffers. This method is highly efficient but it comes at the cost of having to maintain processing state, which is not trivial, and may defeat performance advantages of the incremental evaluation strategy. In the context of RDF streams the problem is further aggravated by the hard-to-predict evolution of the structure of RDF graphs over time and the application of sub-optimal implementation approaches, e.g., using relational technologies for storing data and processing states which incur significant performance drawbacks for graph-based query patterns. To address these performance problems, this paper proposes a set of novel operator-aware data structures coupled with incremental evaluation algorithms which outperform the counterparts of relational stream processing systems. This claim is demonstrated through extensive experimental results on both simulated and real datasets.