RT Journal Article
T1 Improving query performance on dynamic graphs
A1 Barquero Moreno, Gala
A1 Troya-Castilla, Javier
A1 Vallecillo-Moreno, Antonio Jesús
K1 Algoritmos computacionales
AB Querying large models efficiently often imposes high demands on system resources such as memory, processing time, disk access or network latency. The situation becomes more complicated when data are highly interconnected, e.g. in the form of graph structures, and when data sources are heterogeneous, partly coming from dynamic systems and partly stored in databases. These situations are now common in many existing social networking applications and geo-location systems, which require specialized and efficient query algorithms in order to make informed decisions on time. In this paper, we propose an algorithm to improve the memory consumption and time performance of this type of queries by reducing the amount of elements to be processed, focusing only on the information that is relevant to the query but without compromising the accuracy of its results. To this end, the reduced subset of data is selected depending on the type of query and its constituent f ilters. Three case studies are used to evaluate the performance of our proposal, obtaining significant speedups in all cases.
PB Springer
YR 2020
FD 2020-11-20
LK https://hdl.handle.net/10630/25073
UL https://hdl.handle.net/10630/25073
LA eng
NO This work is partially supported by the European Commission (FEDER) and the Spanish Government under projects APOLO (US-1264651), HORATIO (RTI2018-101204-B-C21), EKIPMENT-PLUS (P18-FR-2895) and COSCA (PGC2018-094905B-I00).
DS RIUMA. Repositorio Institucional de la Universidad de Málaga
RD 21 ene 2026