arXiv (All)
open access
A+ Indexes: Tunable and Space-Efficient Adjacency Lists in Graph Database Management Systems
Graph database management systems (GDBMSs) are highly optimized to perform fast traversals, i.e., joins of vertices with their neighbours, by indexing the neighbourhoods of vertices in adjacency lists. However, existing GDBMSs have system-specific and fixed adjacency list structures, which makes eac
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- AIM: A practical approach to automated index management for SQL databases#259623
- Spatial Database Management and Advanced Geographic Information Systems#3253
- Porpoise Observation Database (NRM)#471032
- Bit Index Explicit Replication (BIER) Support via IS-IS#139253
- Resolution limit in community detection#6642
Record · ID 987336
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive