Space-efficient data structures for the inference of subsumption and disjointness relations
Non accesible ata 2025-10-03
Use este enlace para citar
http://hdl.handle.net/2183/39385Coleccións
- GI-LBD - Artigos [54]
Metadatos
Mostrar o rexistro completo do ítemTítulo
Space-efficient data structures for the inference of subsumption and disjointness relationsData
2024Cita bibliográfica
Fuentes-Sepúlveda J, Gatica D, Navarro G, Rodríguez MA, Seco D. Space-efficient datastructures for the inference of subsumption and disjointness relations. Softw: Pract Exper. 2024;1-25. doi:10.1002/spe.3367
Resumo
[Abstract]: Conventional database systems function as static data repositories, storing vast amounts of facts and offering efficient query processing capabilities. The sheer volume of data these systems store has a direct impact on their scalability, both in terms of storage space and query processing time. Deductive database systems, on the other hand, require far less storage space since they derive new knowledge by applying inference rules. The challenge is how to efficiently obtain the required derivations, compared to having them in explicit form. In this study, we concentrate on a set of predefined inference rules for subsumption and disjointness relations, including their negations. We use compact data structures to store the facts and provide algorithms to support each type of relation, minimizing even further the storage space requirements. Our experimental findings demonstrate the feasibility of this approach, which not only saves space but is often faster than a baseline that uses well-known graph traversal algorithms implemented on top of a traditional adjacency list representation to derive the relations.
Palabras chave
compact data structure
deductive database system
inference rule
multigranular data model
deductive database system
inference rule
multigranular data model
Descrición
The data that support the findings of this study are openly available in GBP at https://github.com/dgaticar.
Versión do editor
Dereitos
© 2024 John Wiley & Sons Ltd. This is the peer reviewed version of the following article: [Fuentes-Sepúlveda J, Gatica D, Navarro G, Rodríguez MA, Seco D. Space-efficient datastructures for the inference of subsumption and disjointness relations. Softw: Pract Exper. 2024;1-25. doi:10.1002/spe.3367 ], which has been published in final form at [https://doi.org/10.1002/spe.3367]. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions. This article may not be enhanced, enriched or otherwise transformed into a derivative work, without express permission from Wiley or by statutory rights under applicable legislation. Copyright notices must not be removed, obscured or modified. The article must be linked to Wiley’s version of record on Wiley Online Library and any embedding, framing or otherwise making available the article or pages thereof by third parties from platforms, services and websites other than Wiley Online Library must be prohibited.