Spatio-temporal access methods: a survey (2010 - 2017)

Mahmood, Ahmed; Punni, Sri; Aref, Walid G.

doi:10.1007/s10707-018-0329-2

Cited by 46 publications

(27 citation statements)

References 135 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In this spatiotemporal index structure, the temporal dimension is managed through a triangular binary tree using a triangular decomposition strategy to handle the representation of temporal intervals. Mahmood et al (Mahmood et al, 2019), demonstrates that, for the majority of the structures, the temporal dimension is handled using a B+ tree variant. Regarding the comparison of some of the index structures presented above, Bozkaya and Ozsoyoglu present the benefits regarding node accesses when comparing the IB+ tree to the one-dimensional R-tree (Bozkaya and Ozsoyoglu, 1998).…”

Section: Valid-time Index Structuresmentioning

confidence: 99%

A Comparative Study on the Performance of the IB+ Tree and the I2B+ Tree

Carvalho¹,

Carneiro²,

Oliveira³

2021

J INFORM SYSTEMS ENG

View full text Add to dashboard Cite

Index structures were often used to optimise fetch operations to external storage devices (secondary memory). Nowadays, this also holds for increasingly large amounts of data residing in main-memory (primary memory). Within this scope, this work focuses on index structures that efficiently insert, query and delete valid-time data from very large datasets. This work performs a comparative study on the performance of the Interval B+ tree (IB+ tree) and the Improved Interval B+ tree (I2B+ tree): a variant that improves the time-efficiency of the deletion operation by reducing the number of traversed nodes to access siblings. We performed an extensive analysis of the performance of two operations: insertions and deletions, on both index structures, using multiple datasets with growing volumes of data, distinct temporal distributions and tree parameters (time-split alpha and node order). Results confirm that the I2B+ tree globally outperforms the IB+ tree, since, on average, deletion operations are 7% faster, despite insertions requiring 2% more time. Furthermore, results also allowed to determine the key factors that augment the performance difference on deletions between both trees.

show abstract

Section: Valid-time Index Structuresmentioning

confidence: 99%

A Comparative Study on the Performance of the IB+ Tree and the I2B+ Tree

Carvalho¹,

Carneiro²,

Oliveira³

2021

J INFORM SYSTEMS ENG

View full text Add to dashboard Cite

show abstract

“…Existe uma grande quantidade de trabalhos que propõemíndices espaço-temporais na literatura. Um survey recente apresenta alguns trabalhos publicados no período de 2010 a 2017 [Mahmood et al 2019]. Esta seção concentra-se nos trabalhos que inspiraram as estratégias adotadas pelo MIDM e apresenta uma análise comparativa com base na consulta apresentada.…”

Section: Trabalhos Relacionadosunclassified

Agrupamento de Eventos de Trânsito baseado em Tesselação

Duarte¹,

Pontarolo²,

Freitas

et al. 2021

Anais Da XVI Escola Regional De Banco De Dados (ERBD 2021)

View full text Add to dashboard Cite

Dados coletados a partir de eventos no trânsito, como engarrafamentos e acidentes, são importantes para o planejamento da mobilidade em cidades. O desafio é transformar este conjunto de dados em conhecimento sobre mobilidade. Em razão da velocidade com que os dados são reportados, o armazenamento de eventos é geralmente feito como registros individuais. Embora este modelo de armazenamento garanta um baixo custo de inserção em uma base de dados, ele produz baixo desempenho em consultas que necessitam recuperar eventos que satisfaçam filtros espaço-temporais. Para tratar deste problema, este artigo propõe um método para o armazenamento e indexação de dados de eventos de trânsito baseado em uma tesselação da área de interesse. íE apresentado um estudo de caso que demostra sua aplicação sobre dados coletados no aplicativo Waze.

show abstract

“…For example, in B^x-tree, the position of one spatiotemporal record in the structure is treated as a point along a space-filling curve with equal time intervals. The main drawback is that rectangular range queries in the primal space are always transformed into polygonal range queries in transformed space, which requires much more complex algorithms (Mahmood et al, 2019).…”

Section: Related Workmentioning

confidence: 99%

XStar: a software system for handling taxi trajectory big data

Mango

Song

et al. 2021

Comput.Urban Sci.

View full text Add to dashboard Cite

Advances in positioning and communicating technologies make it possible to collect large volumes of taxi trajectory data, quickly providing a complete picture of the ground traffic systems and thus being applied to different fields. However, there are still challenges for data users to handle such big data. In view of this, we have developed a software system named XStar to deal with trajectory big data. Its core is a scalable index and storage structure. Based on it, raw data can be saved in a more compact scheme and accessed more efficiently. A real taxi trajectory dataset is employed to demonstrate its performance. In general, XStar facilitates processing and analyzing trajectory data affordably and straightforwardly. Since its release in Jan. 2019, it has received downloads of over 4000 by May 2021. More analytical functions are being developed.

show abstract

Spatio-temporal access methods: a survey (2010 - 2017)

Cited by 46 publications

References 135 publications

A Comparative Study on the Performance of the IB+ <i>Tree</i> and the I2B+ <i>Tree</i>

A Comparative Study on the Performance of the IB+ <i>Tree</i> and the I2B+ <i>Tree</i>

Agrupamento de Eventos de Trânsito baseado em Tesselação

XStar: a software system for handling taxi trajectory big data

Contact Info

Product

Resources

About

Spatio-temporal access methods: a survey (2010 - 2017)

Cited by 46 publications

References 135 publications

A Comparative Study on the Performance of the IB+&nbsp;<i>Tree</i>&nbsp;and the I2B+&nbsp;<i>Tree</i>

A Comparative Study on the Performance of the IB+&nbsp;<i>Tree</i>&nbsp;and the I2B+&nbsp;<i>Tree</i>

Agrupamento de Eventos de Trânsito baseado em Tesselação

XStar: a software system for handling taxi trajectory big data

Contact Info

Product

Resources

About

A Comparative Study on the Performance of the IB+ <i>Tree</i> and the I2B+ <i>Tree</i>

A Comparative Study on the Performance of the IB+ <i>Tree</i> and the I2B+ <i>Tree</i>