BPI combines an append-only forest of bitmap masks, a 64-bit resume token, and randomized CRC checksums to make blockchain keyword search and completeness verification low-cost.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
BPI: A Novel Efficient and Reliable Search Structure for Hybrid Storage Blockchain
BPI combines an append-only forest of bitmap masks, a 64-bit resume token, and randomized CRC checksums to make blockchain keyword search and completeness verification low-cost.