Toward a Visual Query System for Spatio-Temporal Databases

2009 ◽  
pp. 987-1002
Author(s):  
Valéria M.B. Cavalcanti ◽  
Ulrich Schiel ◽  
Claudio de Souza Baptista
Keyword(s):  
Query Languages ◽  
Temporal Databases ◽  
Temporal Database ◽  
Database Queries ◽  
Integrated Environment ◽  
Visual Query ◽  
Query System ◽  
Spatio Temporal ◽  
Temporal Dimensions ◽  
Query Systems

Visual query systems (VQS) for spatio-temporal databases, which enable formulation of queries involving both spatial and temporal dimensions, are an important research subject. Existing results treat these dimensions separately and there are only a few integrated proposals. This chapter presents a VQS called spatio-temporal visual query environment (S-TVQE), which allows the formulation of conventional, spatial, temporal, and spatio-temporal database queries in an integrated environment. With S-TVQE, the user, instead of querying the database by textual query languages will interact with the system by visual operators for the statement of the query conditions. The tool provides a visualization of the results in different formats such as maps, graphics, and tables.

Towards a Visual Query System for Spatio-Temporal Databases

2011 ◽  
pp. 158-173
Author(s):  
Valéria M.B. Cavalcanti
Keyword(s):  
Query Languages ◽  
Temporal Databases ◽  
Temporal Database ◽  
Database Queries ◽  
Integrated Environment ◽  
Visual Query ◽  
Query System ◽  
Spatio Temporal ◽  
Temporal Dimensions ◽  
Query Systems

Visual Query Systems (VQS) for Spatio-Temporal Databases; which enable formulation of queries involving both spatial and temporal dimensions; are an important research subject. Existing results treat these dimensions separately and there are only a few integrated proposals. This chapter presents a VQS; called Spatio-Temporal Visual Query Environment (S-TVQE) which allows the formulation of conventional; spatial; temporal; and spatio-temporal database queries in an integrated environment. With S-TVQE the user; instead of querying the database by textual query languages will interact with the system by visual operators for the statement of the query conditions. The tool provides a visualization of the results in different formats such as maps; graphics; and tables.

scholarly journals Dimensional Inconsistency Measures and Postulates in Spatio-Temporal Databases

2021 ◽  
Vol 71 ◽  
Author(s):  
John Grant ◽  
Maria Vanina Martinez ◽  
Cristian Molinaro ◽  
Francesco Parisi
Keyword(s):  
Real World ◽  
Knowledge Bases ◽  
Propositional Knowledge ◽  
Location Based Services ◽  
Temporal Databases ◽  
Temporal Data ◽  
Time Space ◽  
Spatio Temporal ◽  
Temporal Dimensions ◽  
Natural Measures

The problem of managing spatio-temporal data arises in many applications, such as location-based services, environmental monitoring, geographic information systems, and many others. Often spatio-temporal data arising from such applications turn out to be inconsistent, i.e., representing an impossible situation in the real world. Though several inconsistency measures have been proposed to quantify in a principled way inconsistency in propositional knowledge bases, little effort has been done so far on inconsistency measures tailored for the spatio-temporal setting. In this paper, we define and investigate new measures that are particularly suitable for dealing with inconsistent spatio-temporal information, because they explicitly take into account the spatial and temporal dimensions, as well as the dimension concerning the identifiers of the monitored objects. Specifically, we first define natural measures that look at individual dimensions (time, space, and objects), and then propose measures based on the notion of a repair. We then analyze their behavior w.r.t. common postulates defined for classical propositional knowledge bases, and find that the latter are not suitable for spatio-temporal databases, in that the proposed inconsistency measures do not often satisfy them. In light of this, we argue that also postulates should explicitly take into account the spatial, temporal, and object dimensions and thus define “dimension-aware” counterparts of common postulates, which are indeed often satisfied by the new inconsistency measures. Finally, we study the complexity of the proposed inconsistency measures.

scholarly journals Experiencing OptiqueVQS: a multi-paradigm and ontology-based visual query system for end users

2015 ◽  
Vol 15 (1) ◽  
pp. 129-152 ◽  
Author(s):  
Ahmet Soylu ◽  
Martin Giese ◽  
Ernesto Jimenez-Ruiz ◽  
Guillermo Vega-Gorgojo ◽  
Ian Horrocks
Keyword(s):  
End Users ◽  
Visual Query ◽  
Query System

scholarly journals Efficient Discovery of Periodic-Frequent Patterns in Columnar Temporal Databases

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1478
Author(s):  
Penugonda Ravikumar ◽  
Palla Likhitha ◽  
Bathala Venus Vikranth Raj ◽  
Rage Uday Kiran ◽  
Yutaka Watanobe ◽  
...  
Keyword(s):  
Real World ◽  
Pattern Mining ◽  
Transportation Network ◽  
Frequent Pattern Mining ◽  
Temporal Databases ◽  
Frequent Pattern ◽  
Frequent Patterns ◽  
Temporal Database ◽  
First Case

Discovering periodic-frequent patterns in temporal databases is a challenging problem of great importance in many real-world applications. Though several algorithms were described in the literature to tackle the problem of periodic-frequent pattern mining, most of these algorithms use the traditional horizontal (or row) database layout, that is, either they need to scan the database several times or do not allow asynchronous computation of periodic-frequent patterns. As a result, this kind of database layout makes the algorithms for discovering periodic-frequent patterns both time and memory inefficient. One cannot ignore the importance of mining the data stored in a vertical (or columnar) database layout. It is because real-world big data is widely stored in columnar database layout. With this motivation, this paper proposes an efficient algorithm, Periodic Frequent-Equivalence CLass Transformation (PF-ECLAT), to find periodic-frequent patterns in a columnar temporal database. Experimental results on sparse and dense real-world and synthetic databases demonstrate that PF-ECLAT is memory and runtime efficient and highly scalable. Finally, we demonstrate the usefulness of PF-ECLAT with two case studies. In the first case study, we have employed our algorithm to identify the geographical areas in which people were periodically exposed to harmful levels of air pollution in Japan. In the second case study, we have utilized our algorithm to discover the set of road segments in which congestion was regularly observed in a transportation network.

Visual Query Languages for Data Stream

2017 ◽  
pp. 1-5
Author(s):  
Tiziana Catarci ◽  
Mariano Leva ◽  
Massimo Mecella
Keyword(s):  
Data Stream ◽  
Query Languages ◽  
Visual Query ◽  
Visual Query Languages
Sign in / Sign up

Export Citation Format

Share Document