Spatial data quality in the Internet of Things: Management, exploitation, and prospects
With the continued deployment of the Internet of Things (IoT), increasing volumes of devices
are being deployed that emit massive spatially referenced data. Due in part to the dynamic …
are being deployed that emit massive spatially referenced data. Due in part to the dynamic …
Uncertain spatial data management: An overview
A Züfle - Handbook of Big Geospatial Data, 2020 - Springer
Both the current trends in technology such as smart phones, general mobile devices,
stationary sensors, and satellites as we as a new user mentality of using this technology to …
stationary sensors, and satellites as we as a new user mentality of using this technology to …
Reverse k nearest neighbors query processing: experiments and analysis
Given a set of users, a set of facilities and a query facility q, a reverse k nearest neighbors (R
k NN) query returns every user u for which the query is one of its k closest facilities. R k NN …
k NN) query returns every user u for which the query is one of its k closest facilities. R k NN …
Quantifying the competitiveness of a dataset in relation to general preferences
Typically, a specific market (eg, of hotels, restaurants, laptops, etc.) is represented as a multi-
attribute dataset of the available products. The topic of identifying and shortlisting the …
attribute dataset of the available products. The topic of identifying and shortlisting the …
SLICE: reviving regions-based pruning for reverse k nearest neighbors queries
Given a set of facilities and a set of users, a reverse k nearest neighbors (RkNN) query q
returns every user for which the query facility is one of the k-closest facilities. Due to its …
returns every user for which the query facility is one of the k-closest facilities. Due to its …
Efficiently processing snapshot and continuous reverse k nearest neighbors queries
Given a set of objects and a query q, a point p is called the reverse k nearest neighbor (R k
NN) of q if q is one of the k closest objects of p. In this paper, we introduce the concept of …
NN) of q if q is one of the k closest objects of p. In this paper, we introduce the concept of …
Reverse k nearest neighbors queries and spatial reverse top-k queries
Given a set of facilities and a set of users, a reverse k nearest neighbors (R k NN) query q
returns every user for which the query facility is one of the k closest facilities. Almost all of the …
returns every user for which the query facility is one of the k closest facilities. Almost all of the …
Voronoi-based nearest neighbor search for multi-dimensional uncertain databases
In Voronoi-based nearest neighbor search, the Voronoi cell of every point p in a database
can be used to check whether p is the closest to some query point q. We extend the notion of …
can be used to check whether p is the closest to some query point q. We extend the notion of …
Managing uncertainty in spatial and spatio-temporal data
Location-related data has a tremendous impact in many applications of high societal
relevance and its growing volume from heterogeneous sources is one true example of a Big …
relevance and its growing volume from heterogeneous sources is one true example of a Big …
On efficiently finding reverse k-nearest neighbors over uncertain graphs
Reverse k-nearest neighbor (R k NN R k NN) query on graphs returns the data objects that
take a specified query object q as one of their k-nearest neighbors. It has significant …
take a specified query object q as one of their k-nearest neighbors. It has significant …