ARTICLE
TITLE

Adaptive and Optimized RDF Query Interface for Distributed WFS Data

SUMMARY

Web Feature Service (WFS) is a protocol for accessing geospatial data stores such as databases and Shapefiles over the Web. However, WFS does not provide direct access to data distributed in multiple servers. In addition, WFS features extracted from their original sources are not convenient for user access due to the lack of connection to high-level concepts. Users are facing the choices of either querying each WFS server first and then integrating the results, or converting the data from all WFS servers to a more expressive format such as RDF (Resource Description Framework) and then querying the integrated data. The first choice requires additional programming while the second choice is not practical for large or frequently updated datasets. The new contribution of this paper is that we propose a novel adaptive and optimized RDF query interface to overcome the aforementioned limitation. Specifically, in this paper, we propose a novel algorithm to query and synthesize distributed WFS data through an RDF query interface, where users can specify data requests to multiple WFS servers using a single RDF query. Users can also define a simple configuration to associate WFS feature types, attributes, and values with RDF classes, properties, and values so that user queries can be written using a more uniform and informative vocabulary. The algorithm translates each RDF query written in SPARQL-like syntax to multiple WFS GetFeature requests, and then converts and integrates the multiple WFS results to get the answers to the original query. The generated GetFeature requests are sent asynchronously and simultaneously to WFS servers to take advantage of the server parallelism. The results of each GetFeature request are cached to improve query response time for subsequent queries that involve one or more of the cached requests. A JavaScript-based prototype is implemented and experimental results show that the query response time can be greatly reduced through fine-grained caching.

KEYWORDS

 Articles related

Vitalii Martovytskyi, Oleksandr Ivaniuk    

Today, the problem of navigation of autonomous mobile systems in a space where disturbances are possible is urgent. The task of finding a route for a mobile robot is a complex and non-trivial task. At the moment, there are many algorithms that allow you ... see more


Siniša Antonijevic,Vicko Doric,Dragan Poljak    

The algorithm for an indirect time domain (TD) analysis using arbitrary frequency domain method is presented.In previous work, an optimized version of the indirect timedomain method based on adaptive sampling iterative algorithm used in combination with ... see more


I. V. Averyanova, A. L. Maksimov, S. I. Vdovenko    

The specific climatic and geographical conditions of the northern territories of Russia, the relatively small workforce, as well as intensive migration processes require a specific approach with regard to northern regions and, particularly, to the health... see more


Nuttiiya Seekhao,Joseph JaJa,Luc Mongeau,Nicole Y.K. Li-Jessen    

A fast and insightful visualization is essential in modeling biological system behaviors and understanding underlying inter-cellular mechanisms. High fidelity models produce billions of data points per time step, making in situ visualization techniques e... see more


Sheng Shen, Honghui Yang, Junhao Li, Guanghui Xu and Meiping Sheng    

Detecting and classifying ships based on radiated noise provide practical guidelines for the reduction of underwater noise footprint of shipping. In this paper, the detection and classification are implemented by auditory inspired convolutional neural ne... see more

Revista: Entropy