{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:QQ46XPSTNSNN5AT3JFUSDYHMPJ","short_pith_number":"pith:QQ46XPST","schema_version":"1.0","canonical_sha256":"8439ebbe536c9ade827b496921e0ec7a6bf9a70d26c754eec4cc0bf147241f6a","source":{"kind":"arxiv","id":"2108.13735","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical Bitmap Indexing for Range and Membership Queries on Multidimensional Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"(2) Rowan University, Czech Republic, Glassboro, Jan Holub (1) ((1) Czech Technical University in Prague, Lubo\\v{s} Kr\\v{c}\\'al (1), NJ, Shen-Shyang Ho (2), USA)","submitted_at":"2021-08-31T10:36:04Z","abstract_excerpt":"Traditional indexing techniques commonly employed in da\\-ta\\-ba\\-se systems perform poorly on multidimensional array scientific data. Bitmap indices are widely used in commercial databases for processing complex queries, due to their effective use of bit-wise operations and space-efficiency. However, bitmap indices apply natively to relational or linearized datasets, which is especially notable in binned or compressed indices.\n  We propose a new method for multidimensional array indexing that overcomes the dimensionality-induced inefficiencies. The hierarchical indexing method is based on $n$-"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2108.13735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-08-31T10:36:04Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"81a3a04dc871b95e176f221ddfa68e33febc9da68765355cd3ad92ad9af32626","abstract_canon_sha256":"24de48471c67157d311c3b2109580aff323ec71228e61448ad9b65fdc7d388be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:10:17.302631Z","signature_b64":"iaM1wfOc5X6zGNt/9Ph9epIxXSYIFOterXBEWuSJ9PFZ9h2KMS32eAJI+i2FwM/wmqduTaogTFJaLHN+qTuvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8439ebbe536c9ade827b496921e0ec7a6bf9a70d26c754eec4cc0bf147241f6a","last_reissued_at":"2026-07-05T03:10:17.302239Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:10:17.302239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Bitmap Indexing for Range and Membership Queries on Multidimensional Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"(2) Rowan University, Czech Republic, Glassboro, Jan Holub (1) ((1) Czech Technical University in Prague, Lubo\\v{s} Kr\\v{c}\\'al (1), NJ, Shen-Shyang Ho (2), USA)","submitted_at":"2021-08-31T10:36:04Z","abstract_excerpt":"Traditional indexing techniques commonly employed in da\\-ta\\-ba\\-se systems perform poorly on multidimensional array scientific data. Bitmap indices are widely used in commercial databases for processing complex queries, due to their effective use of bit-wise operations and space-efficiency. However, bitmap indices apply natively to relational or linearized datasets, which is especially notable in binned or compressed indices.\n  We propose a new method for multidimensional array indexing that overcomes the dimensionality-induced inefficiencies. The hierarchical indexing method is based on $n$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.13735","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.13735/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2108.13735","created_at":"2026-07-05T03:10:17.302295+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.13735v1","created_at":"2026-07-05T03:10:17.302295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.13735","created_at":"2026-07-05T03:10:17.302295+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQ46XPSTNSNN","created_at":"2026-07-05T03:10:17.302295+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQ46XPSTNSNN5AT3","created_at":"2026-07-05T03:10:17.302295+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQ46XPST","created_at":"2026-07-05T03:10:17.302295+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QQ46XPSTNSNN5AT3JFUSDYHMPJ","json":"https://pith.science/pith/QQ46XPSTNSNN5AT3JFUSDYHMPJ.json","graph_json":"https://pith.science/api/pith-number/QQ46XPSTNSNN5AT3JFUSDYHMPJ/graph.json","events_json":"https://pith.science/api/pith-number/QQ46XPSTNSNN5AT3JFUSDYHMPJ/events.json","paper":"https://pith.science/paper/QQ46XPST"},"agent_actions":{"view_html":"https://pith.science/pith/QQ46XPSTNSNN5AT3JFUSDYHMPJ","download_json":"https://pith.science/pith/QQ46XPSTNSNN5AT3JFUSDYHMPJ.json","view_paper":"https://pith.science/paper/QQ46XPST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.13735&json=true","fetch_graph":"https://pith.science/api/pith-number/QQ46XPSTNSNN5AT3JFUSDYHMPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/QQ46XPSTNSNN5AT3JFUSDYHMPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQ46XPSTNSNN5AT3JFUSDYHMPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQ46XPSTNSNN5AT3JFUSDYHMPJ/action/storage_attestation","attest_author":"https://pith.science/pith/QQ46XPSTNSNN5AT3JFUSDYHMPJ/action/author_attestation","sign_citation":"https://pith.science/pith/QQ46XPSTNSNN5AT3JFUSDYHMPJ/action/citation_signature","submit_replication":"https://pith.science/pith/QQ46XPSTNSNN5AT3JFUSDYHMPJ/action/replication_record"}},"created_at":"2026-07-05T03:10:17.302295+00:00","updated_at":"2026-07-05T03:10:17.302295+00:00"}