Storm System Database: A Big Data Approach to Moving Object Databases

2013 ◽  
Author(s):  
Brian Olsen ◽  
Mark McKenney
Keyword(s):  
Big Data ◽  
Moving Object ◽  
System Database ◽  
Object Databases ◽  
Moving Object Databases

A Survey of Spatio-Temporal Data Warehousing

2010 ◽  
pp. 949-977
Author(s):  
Leticia Gómez ◽  
Bart Kuijpers ◽  
Bart Moelans ◽  
Alejandro Vaisman
Keyword(s):  
Moving Objects ◽  
Route Planning ◽  
Geographic Information ◽  
Moving Object ◽  
Attribute Data ◽  
Object Databases ◽  
Spatio Temporal ◽  
Eu Project ◽  
The University ◽  
Moving Object Databases

Geographic Information Systems (GIS) have been extensively used in various application domains, ranging from economical, ecological and demographic analysis, to city and route planning. Nowadays, organizations need sophisticated GIS-based Decision Support System (DSS) to analyze their data with respect to geographic information, represented not only as attribute data, but also in maps. Thus, vendors are increasingly integrating their products, leading to the concept of SOLAP (Spatial OLAP). Also, in the last years, and motivated by the explosive growth in the use of PDA devices, the field of moving object data has been receiving attention from the GIS community. However, not much has been done in providing moving object databases with OLAP functionality. In the first part of this article we survey the SOLAP literature. We then move to Spatio-Temporal OLAP, in particular addressing the problem of trajectory analysis. We finally provide an in-depth comparative analysis between two proposals introduced in the context of the GeoPKDD EU project: the Hermes-MDC system, and Piet, a proposal for SOLAP and moving objects, developed at the University of Buenos Aires, Argentina.

ASSIGNMENT QUERY AND ITS IMPLEMENTATION IN MOVING OBJECT DATABASES

2010 ◽  
Vol 09 (03) ◽  
pp. 349-372 ◽  
Author(s):  
ALİ R. KONAN ◽  
TAFLAN İ. GÜNDEM ◽  
MURAT E. KAYA
Keyword(s):  
Nearest Neighbor ◽  
Perfect Match ◽  
Moving Object ◽  
Location Based Services ◽  
Matching Problem ◽  
Total Cost ◽  
Wide Range ◽  
Weighted Bipartite Graph ◽  
Object Databases ◽  
Moving Object Databases

Moving object databases (MOD) are being used in a wide range of location-based services that are of growing interest in many application areas. In the literature, several query types such as nearest neighbor, reverse nearest neighbor, k-nearest neighbor, and proximity queries have been considered in MOD. In this paper, we propose a novel operator called the assignment operator as a query type for MOD. The assignment operator is an operator used in a query to solve the assignment problem (also known as the weighted bipartite graph-matching problem). Assignment operator finds a perfect match between two sets of objects in a manner that minimizes a total cost. For instance, a set of moving objects such as taxi cabs are assigned to a set of customers in a manner that minimizes the total cost of traveling for the taxis. A possible implementation of the assignment operator in MOD and its performance evaluation are given.

scholarly journals Discovery of Frequent Sequence Pattern in Moving Object Databases

2008 ◽  
Vol 15D (2) ◽  
pp. 179-186
Author(s):  
Thi Hong Nhan Vu ◽  
Bum-Ju Lee ◽  
Keun-Ho Ryu
Keyword(s):  
Moving Object ◽  
Sequence Pattern ◽  
Frequent Sequence ◽  
Object Databases ◽  
Moving Object Databases
Sign in / Sign up

Export Citation Format

Share Document