On the public citation graph
Roaring bitmaps: Implementation of an optimized software library
0 signed · 81 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/spe.2289openalex-snapshot
Compressed bitmap indexes: beyond unions and intersections
inferredcites →https://doi.org/10.1002/spe.2325openalex-snapshot
Better bitmap performance with Roaring bitmaps
inferredcites →https://doi.org/10.1002/spe.2326openalex-snapshot
SIMD compression and the intersection of sorted integers
inferredcites →https://doi.org/10.1002/spe.2402openalex-snapshot
Consistently faster and smaller compressed bitmaps with Roaring
inferredcites →https://doi.org/10.1007/978-3-319-18818-8_15openalex-snapshot
Cooperative Techniques for SPARQL Query Relaxation in RDF Databases
inferredcites →https://doi.org/10.1007/978-3-642-30850-5_26openalex-snapshot
Fast, Small, Simple Rank/Select on Bitmaps
inferredcites →https://doi.org/10.1007/s00778-015-0419-9openalex-snapshot
Hybrid query optimization for hard-to-compress bit-vectors
inferredcites →https://doi.org/10.1016/0020-0190(76)90071-5openalex-snapshot
An almost optimal algorithm for unbounded searching
inferredcites →https://doi.org/10.1016/j.datak.2009.08.006openalex-snapshot
Sorting improves word-aligned bitmap indexes
inferredcites →https://doi.org/10.1016/j.ipl.2010.05.018openalex-snapshot
Concise: Compressed ‘n’ Composable Integer Set
inferredcites →https://doi.org/10.1093/comjnl/bxx046openalex-snapshot
Faster Population Counts Using AVX2 Instructions
inferredcites →https://doi.org/10.1109/icc.2015.7249457openalex-snapshot
SPLWAH: A bitmap index compression scheme for searching in archival Internet traffic
inferredcites →https://doi.org/10.1109/ideas.2007.4318091openalex-snapshot
Bitmap Index Design Choices and Their Performance Implications
inferredcites →https://doi.org/10.1109/lcomm.2016.2551719openalex-snapshot
CAMP: A New Bitmap Index for Data Retrieval in Traffic Archival
inferredcites →https://doi.org/10.1109/tc.1972.5009071openalex-snapshot
Some Computer Organizations and Their Effectiveness
inferredcites →https://doi.org/10.1109/tst.2016.7442497openalex-snapshot
COMBAT: a new bitmap index coding algorithm for big data
inferredcites →https://doi.org/10.1145/1385486.1385494openalex-snapshot
Database servers tailored to improve energy efficiency
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/1877766.1877767openalex-snapshot
Efficient set intersection for inverted indexing
inferredcites →https://doi.org/10.1145/1899503.1899530openalex-snapshot
Performance of C++ bit-vector implementations
inferredcites →https://doi.org/10.1145/2338626.2338633openalex-snapshot
Reordering rows for better compression
inferredcites →https://doi.org/10.1145/253260.253268openalex-snapshot
Improved query performance with variant indexes
inferredcites →https://doi.org/10.1145/2938503.2938515openalex-snapshot
Optimizing Druid with Roaring bitmaps
inferredcites →https://doi.org/10.1145/2996913.2996972openalex-snapshot
Efficient in-memory indexing of network-constrained trajectories
inferredcites →https://doi.org/10.1145/3035918.3064007openalex-snapshot
An Experimental Study of Bitmap Compression vs. Inverted List Compression
inferredcites →https://doi.org/10.14778/2809974.2809988openalex-snapshot
SIMD- and cache-friendly algorithm for sorting an array of structures
inferredcites →https://doi.org/10.14778/3025111.3025126openalex-snapshot
Effortless data exploration with zenvisage
inferredcites →https://doi.org/10.15398/jlm.v4i1.100openalex-snapshot
Data-oriented parsing with discontinuous constituents and function tags
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/stvr.1842openalex-snapshot
An investigation of distributed computing for combinatorial testing
inferred← citeshttps://doi.org/10.1007/978-1-0716-3989-4_9openalex-snapshot
Meta-colored Compacted de Bruijn Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-33495-6_10openalex-snapshot
The Merits of Bitset Compression Techniques for Mining Association Rules from Big Data
inferred← citeshttps://doi.org/10.1007/978-3-032-05228-5_14openalex-snapshot
REINDEER2: Practical Abundance Index at Scale
inferred← citeshttps://doi.org/10.1007/978-3-032-18765-9_5openalex-snapshot
Current Systems for Managing Massive High Frequency Time Series
inferred← citeshttps://doi.org/10.1007/978-3-032-29921-5_39openalex-snapshot
High-Throughput Chunk-Based GPU Bitmap Compression for Dense Retrieval Workloads
inferred← citeshttps://doi.org/10.1007/978-3-319-93417-4_13openalex-snapshot
HDTQ: Managing RDF Datasets in Compressed Space
inferred← citeshttps://doi.org/10.1007/978-981-97-5569-1_27openalex-snapshot
AdpDM: Adaptive Data Model for Efficient Dynamic Management of Large-Scale High-Cardinality Time-Series Databases
inferred← citeshttps://doi.org/10.1007/s00454-021-00344-xopenalex-snapshot
A New Face Iterator for Polyhedra and for More General Finite Locally Branched Lattices
inferred← citeshttps://doi.org/10.1007/s00778-024-00881-wopenalex-snapshot
A powerful reducing framework for accelerating set intersections over graphs
inferred← citeshttps://doi.org/10.1007/s11227-019-03053-8openalex-snapshot
The curse of indecomposable aggregates for big data exploratory analysis with a case for frequent pattern cubes
inferred← citeshttps://doi.org/10.1007/s11227-022-04366-xopenalex-snapshot
HyPar-FCA: a distributed framework based on hybrid partitioning for FCA
inferred← citeshttps://doi.org/10.1007/s11227-023-05116-3openalex-snapshot
HyPar-FCA+: an improved workload-aware elastic framework for FCA
inferred← citeshttps://doi.org/10.1016/j.knosys.2023.111335openalex-snapshot
A scalable, distributed framework for significant subgroup discovery
inferred← citeshttps://doi.org/10.1089/cmb.2024.0714openalex-snapshot
Where the Patterns Are: Repetition-Aware Compression for Colored de Bruijn Graphs *
inferred← citeshttps://doi.org/10.1093/gigascience/giae001openalex-snapshot
The probability of edge existence due to node degree: a baseline for network-based predictions
inferred← citeshttps://doi.org/10.1109/bigdata52589.2021.9671307openalex-snapshot
Energy Efficiency vs. Performance of Analytical Queries: The case of Bitmap Join Indexes
inferred← citeshttps://doi.org/10.1109/bigdata59044.2023.10386100openalex-snapshot
Performance of Null Handling in Array Databases
inferred← citeshttps://doi.org/10.1109/blockchain55522.2022.00032openalex-snapshot
Authenticated Multi-Version Index for Blockchain-based Range Queries on Historical Data
inferred← citeshttps://doi.org/10.1109/dcc50243.2021.00037openalex-snapshot
Fast and Compact Set Intersection through Recursive Universe Partitioning
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00130openalex-snapshot
FESIA: A Fast and SIMD-Efficient Set Intersection Approach on Modern CPUs
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00192openalex-snapshot
Efficient $k-\text{clique}$ Listing with Set Intersection Speedup
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00223openalex-snapshot
Towards Optimizing Storage Costs on the Cloud
inferred← citeshttps://doi.org/10.1109/icirca51532.2021.9544882openalex-snapshot
Bitmap Vectorization Conversion Method in Graphic Design with OpenGL Framework
inferred← citeshttps://doi.org/10.1109/mcg.2020.3033401openalex-snapshot
Cartolabe: A Web-Based Scalable Visualization of Large Document Collections
inferred← citeshttps://doi.org/10.1109/tc.2026.3688967openalex-snapshot
An Efficient Data Management Based on Adaptive Data Model for High-Cardinality Time-Series Database
inferred← citeshttps://doi.org/10.1109/tcc.2024.3408905openalex-snapshot
Multi-Dimensional Flat Indexing for Encrypted Data
inferred← citeshttps://doi.org/10.1109/tkde.2023.3329145openalex-snapshot
An Index for Set Intersection With Post-Filtering
inferred← citeshttps://doi.org/10.1109/tvcg.2018.2864847openalex-snapshot
Culling for Extreme-Scale Segmentation Volumes: A Hybrid Deterministic and Probabilistic Approach
inferred← citeshttps://doi.org/10.1109/tvcg.2022.3209439openalex-snapshot
Multivariate Probabilistic Range Queries for Scalable Interactive 3D Visualization
inferred← citeshttps://doi.org/10.1145/3380479.3380481openalex-snapshot
How to speed Connected Component Labeling up with SIMD RLE algorithms
inferred← citeshttps://doi.org/10.1145/3415148openalex-snapshot
Techniques for Inverted Index Compression
inferred← citeshttps://doi.org/10.1145/3447548.3467219openalex-snapshot
Accelerating Set Intersections over Graphs by Reducing-Merging
inferred← citeshttps://doi.org/10.1145/3583780.3614944openalex-snapshot
Khronos: A Real-Time Indexing Framework for Time Series Databases on Large-Scale Performance Monitoring Systems
inferred← citeshttps://doi.org/10.1145/3624575openalex-snapshot
Authenticated Range Querying of Historical Blockchain Healthcare Data Using Authenticated Multi-Version Index
inferred← citeshttps://doi.org/10.1145/3637528.3671814openalex-snapshot
ACER: Accelerating Complex Event Recognition via Two-Phase Filtering under Range Bitmap-Based Indexes
inferred← citeshttps://doi.org/10.1145/3639284openalex-snapshot
HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs
inferred← citeshttps://doi.org/10.1145/3643489.3661124openalex-snapshot
Libro - Lifelog Search Browser
inferred← citeshttps://doi.org/10.1145/3746252.3761179openalex-snapshot
Revisiting the Inner Product Method: Optimizing Sparse Matrix Multiplication via Set Intersection
inferred← citeshttps://doi.org/10.1145/3769819openalex-snapshot
RABIT: Efficient Range Queries with Bitmap Indexing
inferred← citeshttps://doi.org/10.1145/3812648openalex-snapshot
Adaptive Set Intersection via Trie Partition Certificates
inferred← citeshttps://doi.org/10.1145/3832783.3837421openalex-snapshot
SIMD-Accelerated Sparse Bit-Vectors for Pointer Analysis
inferred← citeshttps://doi.org/10.14778/3407790.3407821openalex-snapshot
Identifying insufficient data coverage in databases with multiple relations
inferred← citeshttps://doi.org/10.14778/3705829.3705854openalex-snapshot
CUBIT: Concurrent Updatable Bitmap Indexing
inferred← citeshttps://doi.org/10.21015/vtse.v14i1.2353openalex-snapshot
Vector+SQL Retrieval with Selectivity Workloads: Measuring Tail Latency and Quality under Filtered Top-K
inferred← citeshttps://doi.org/10.70675/ac967d12zc0a7z4126z92aez5b8e41949671openalex-snapshot
Indexation et analyse de grandes collections de séquençages via des matrices de k-mers
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.