Evaluating regular path queries on compressed adjacency matrices
- 26 November 2024
- journal article
- research article
- Published by Springer Nature in The VLDB Journal
- Vol. 34 (1) , 1-28
Abstract
No abstract availableKeywords
Funding Information
- Millennium Science Initiative Program, Chile (ICN17-002)
This publication has 64 references indexed in Scilit:
- Evaluating Regular Path Queries on Compressed Adjacency Matrices2023
- Join Ordering of SPARQL Property Path Queries2023
- A Worst-Case Optimal Join Algorithm for SPARQL2019
- Faster Dynamic Compressed d-ary Relations2019
- Getting the Most Out of Wikidata: Semantic Technology Usage in Wikipedia’s Knowledge Graph2018
- Compact Querieable Representations of Raster Data2013
- RDF Support in the Virtuoso DBMS2009
- Tables1996
- The transitive closure of a random digraphRandom Structures & Algorithms, 1990
- A transitive closure algorithmBIT Numerical Mathematics, 1970