A review of moving object trajectory clustering algorithms

G Yuan, P Sun, J Zhao, D Li, C Wang - Artificial Intelligence Review, 2017 - Springer
Clustering is an efficient way to group data into different classes on basis of the internal and
previously unknown schemes inherent of the data. With the development of the location …

R-trees: A dynamic index structure for spatial searching

A Guttman - Proceedings of the 1984 ACM SIGMOD international …, 1984 - dl.acm.org
In order to handle spatial data efficiently, as required in computer aided design and geo-
data applications, a database system needs an index mechanism that will help it retrieve …

[BOOK][B] Principles of geographical information systems

PA Burrough, RA McDonnell, CD Lloyd - 2015 - books.google.com
Geographical data are used in so many aspects of our lives today, ranging from disaster
relief operations through to finding directions on our mobile phones. We can all be data …

Conservative interpolation between volume meshes by local Galerkin projection

PE Farrell, JR Maddison - Computer Methods in Applied Mechanics and …, 2011 - Elsevier
The problem of interpolating between discrete fields arises frequently in computational
physics. The obvious approach, consistent interpolation, has several drawbacks such as …

A survey on big IoT data indexing: Potential solutions, recent advancements, and open issues

Z Kouahla, AE Benrazek, MA Ferrag, B Farou, H Seridi… - Future Internet, 2021 - mdpi.com
The past decade has been characterized by the growing volumes of data due to the
widespread use of the Internet of Things (IoT) applications, which introduced many …

A solution for large-scale multi-object tracking

M Beard, BT Vo, BN Vo - IEEE Transactions on Signal …, 2020 - ieeexplore.ieee.org
A large-scale multi-object tracker based on the generalised labeled multi-Bernoulli (GLMB)
filter is proposed. The algorithm is capable of tracking a very large, unknown and time …

The priority R-tree: A practically efficient and worst-case optimal R-tree

L Arge, M Berg, H Haverkort, K Yi - ACM Transactions on Algorithms …, 2008 - dl.acm.org
We present the priority R-tree, or PR-tree, which is the first R-tree variant that always
answers a window query using O ((N/B) 1− 1/d+ T/B) I/Os, where N is the number of d …

Spatio-temporal indexing in non-relational distributed databases

A Fox, C Eichelberger, J Hughes… - 2013 IEEE International …, 2013 - ieeexplore.ieee.org
Big Data has driven the need for datastores that can scale horizontally leading to the
development of many different NoSQL database implementations, each with different …

Geometric range search on encrypted spatial data

B Wang, M Li, H Wang - IEEE Transactions on Information …, 2015 - ieeexplore.ieee.org
Geometric range search is a fundamental primitive for spatial data analysis in SQL and
NoSQL databases. It has extensive applications in location-based services, computer-aided …

[BOOK][B] Conceptual modeling for traditional and spatio-temporal applications: The MADS approach

C Parent, S Spaccapietra, E Zimányi - 2006 - Springer
From environmental management to land planning and geo-marketing, the number of
application domains that may greatly benefit from using data enriched with spatio-temporal …