TRGST: An enhanced generalized suffix tree for topological relations between paths
Non accesible ata 2026/11/01
Use este enlace para citar
http://hdl.handle.net/2183/37864
A non ser que se indique outra cousa, a licenza do ítem descríbese como Atribución-NoComercial-SinDerivadas 3.0 España
Coleccións
- GI-LBD - Artigos [54]
Metadatos
Mostrar o rexistro completo do ítemTítulo
TRGST: An enhanced generalized suffix tree for topological relations between pathsData
2024-11Cita bibliográfica
C. Quijada-Fuentes, M. A. Rodríguez, and D. Seco, "TRGST: An enhanced generalized suffix tree for topological relations between paths", Information Systems, Vol. 125, artículo 102406, Nov. 2024, doi: 10.1016/j.is.2024.102406
Resumo
[Abstract]: This paper introduces the TRGST data structure, which is designed to handle queries related to topological relations between paths represented as sequences of stops in a network. As an example, these paths could correspond to stops on a public transport network, and a query of interest is to retrieve paths that share at least k consecutive stops. While topological relations among spatial objects have received extensive attention, the efficient processing of these relations in the context of trajectory paths, considering both time and space efficiency, remains a relatively less explored domain. Taking inspiration from pattern matching implementations, the TRGST data structure is constructed on the foundation of the Generalized Suffix Tree. Its purpose is to provide a compact representation of a set of paths and to efficiently handle topological relation queries by leveraging the pattern search capabilities inherent in this structure. The paper provides a detailed account of the structure and algorithms of TRGST, followed by a performance analysis utilizing both real and synthetic data. The results underscore the remarkable scalability of the TRGST in terms of both query time and space utilization.
Palabras chave
Compact data structure
Generalized suffix tree
Topological relation
Trajectory path
Generalized suffix tree
Topological relation
Trajectory path
Descrición
©2024 Elsevier B.V. All rights reserved. This manuscript version is made
available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/
licenses/bync-nd/4.0/. This version of the article has been accepted for
publication in Journal of Controlled Release. The Version of Record is available
online at https://doi.org/10.1016/j.is.2024.102406 Versión aceptada
Versión do editor
Dereitos
Atribución-NoComercial-SinDerivadas 3.0 España
ISSN
0306-4379