Compressed and queryable self-indexes for RDF archives
- 29 August 2023
- journal article
- research article
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 66 (1) , 381-417
Abstract
No abstract availableKeywords
Funding Information
- Xunta de Galicia, ERDF (ED431G 2019/01, ED431G 2019/01, ED431G 2019/01)
- MICINN (PID2019-105221RB-C41, PID2019-105221RB-C41, PID2019-105221RB-C41)
- Ministerio de Ciencia e Innovación (PDC2021-120917-C21, PDC2021-120917-C21, PDC2021-120917-C21)
- MCIU-AEI/FEDER-UE (RTI2018-098309-B-C32, RTI2018-098309-B-C32, RTI2018-098309-B-C32)
- Xunta de Galicia, IGAPE (IG240.2020.1.185, IG240.2020.1.185, IG240.2020.1.185)
This publication has 49 references indexed in Scilit:
- Practical Compressed Suffix TreesAlgorithms, 2013
- Binary RDF representation for publication and exchange (HDT)Journal of Web Semantics, 2013
- Observing Linked Data Dynamics2013
- Word-based self-indexes for natural language textACM Transactions on Information Systems, 2012
- A VERSION MANAGEMENT FRAMEWORK FOR RDF TRIPLE STORESInternational Journal of Software Engineering and Knowledge Engineering, 2012
- The RDF-3X engine for scalable management of RDF dataThe VLDB Journal, 2009
- Dynamic entropy-compressed sequences and full-text indexesACM Transactions on Algorithms, 2008
- Compressed indexes for dynamic text collectionsACM Transactions on Algorithms, 2007
- New text indexing functionalities of the compressed suffix arraysJournal of Algorithms, 2003
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993