RDF-TDAA: Optimizing RDF indexing and querying with a trie based on Directly Addressable Arrays and a path-based strategy
- 7 April 2025
- journal article
- Published by Elsevier in Expert Systems with Applications
- Vol. 279
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (U22A2099, 62362015)
- Guangxi Key Research and Development Program (AB24010160)
- Guilin University of Electronic Technology (2025YCXS056)
This publication has 15 references indexed in Scilit:
- Wukong+G: Fast and Concurrent RDF Query Processing Using RDMA-Assisted GPU Graph ExplorationIEEE Transactions on Parallel and Distributed Systems, 2021
- Compressed Indexes for Fast Search of Semantic DataIEEE Transactions on Knowledge and Data Engineering, 2020
- Accelerating SPARQL queries by exploiting hash-based locality and adaptive partitioningThe VLDB Journal, 2016
- Compressed vertical partitioning for efficient RDF managementKnowledge and Information Systems, 2014
- DACs: Bringing direct access to variable-length codesInformation Processing & Management, 2013
- YAGO2: A spatially and temporally enhanced knowledge base from WikipediaArtificial Intelligence, 2013
- Size Bounds and Query Plans for Relational JoinsSIAM Journal on Computing, 2013
- Characteristic sets: Accurate cardinality estimation for RDF queries with multiple joins2011
- The RDF-3X engine for scalable management of RDF dataThe VLDB Journal, 2009
- Compressing Integers for Fast File AccessThe Computer Journal, 1999