{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:YOQLCL6AU6IGZ3UD7P2DNY6ITG","short_pith_number":"pith:YOQLCL6A","canonical_record":{"source":{"id":"cs/0202035","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DB","submitted_at":"2002-02-21T05:23:51Z","cross_cats_sorted":[],"title_canon_sha256":"71bf6009853579672de45f2e32d623303bb4393b93d051bad3756de5c20eeccb","abstract_canon_sha256":"4805a912f1fbe190e4862aab59b2f86806bbf81eb25edb037760625509b0bffc"},"schema_version":"1.0"},"canonical_sha256":"c3a0b12fc0a7906cee83fbf436e3c899b67cf510eb508340663e405aae0d08ba","source":{"kind":"arxiv","id":"cs/0202035","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0202035","created_at":"2026-07-04T14:24:15Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0202035v1","created_at":"2026-07-04T14:24:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0202035","created_at":"2026-07-04T14:24:15Z"},{"alias_kind":"pith_short_12","alias_value":"YOQLCL6AU6IG","created_at":"2026-07-04T14:24:15Z"},{"alias_kind":"pith_short_16","alias_value":"YOQLCL6AU6IGZ3UD","created_at":"2026-07-04T14:24:15Z"},{"alias_kind":"pith_short_8","alias_value":"YOQLCL6A","created_at":"2026-07-04T14:24:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:YOQLCL6AU6IGZ3UD7P2DNY6ITG","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0202035","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DB","submitted_at":"2002-02-21T05:23:51Z","cross_cats_sorted":[],"title_canon_sha256":"71bf6009853579672de45f2e32d623303bb4393b93d051bad3756de5c20eeccb","abstract_canon_sha256":"4805a912f1fbe190e4862aab59b2f86806bbf81eb25edb037760625509b0bffc"},"schema_version":"1.0"},"canonical_sha256":"c3a0b12fc0a7906cee83fbf436e3c899b67cf510eb508340663e405aae0d08ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:15.879013Z","signature_b64":"BjbG8CkYGz9wLJEzX+OBEwARyfiZW/Ovg60WDFXnxeeiJWM6Xtik1Hi01PPKRwBXtPVe51yxdTbgJD62jjpxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3a0b12fc0a7906cee83fbf436e3c899b67cf510eb508340663e405aae0d08ba","last_reissued_at":"2026-07-04T14:24:15.878625Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:15.878625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0202035","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T14:24:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQAYv25mHsxNr4wdue3lKIgUX3bTiWsEQDMj8vSgEa60Yf5+3eA4IjmnRkwUqA//HOp6FhmzUzfKMxVpPFKHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T20:52:35.582387Z"},"content_sha256":"70e28ef93a4053c68c571a23aed1b1815aa21ce98e7a6948883110f117f3e388","schema_version":"1.0","event_id":"sha256:70e28ef93a4053c68c571a23aed1b1815aa21ce98e7a6948883110f117f3e388"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:YOQLCL6AU6IGZ3UD7P2DNY6ITG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sprinkling Selections over Join DAGs for Efficient Query Optimization","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Kamalakar Karlapalem, Satyanarayana R Valluri, Soujanya Vadapalli","submitted_at":"2002-02-21T05:23:51Z","abstract_excerpt":"In optimizing queries, solutions based on AND/OR DAG can generate all possible join orderings and select placements before searching for optimal query execution strategy. But as the number of joins and selection conditions increase, the space and time complexity to generate optimal query plan increases exponentially. In this paper, we use join graph for a relational database schema to either pre-compute all possible join orderings that can be executed and store it as a join DAG or, extract joins in the queries to incrementally build a history join DAG as and when the queries are executed. The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0202035","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/cs/0202035/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T14:24:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNJxf98toaAWufEYv7bTsG837d4jYuce4OQ3B8Ko1XR2WetN0ZSzC64W20CSZE74OBI1r09XnZj2vIF2jVniCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T20:52:35.582901Z"},"content_sha256":"1d2f3075fd0014d6ae51244659d0d65f09fa23f8f4a02c7c36664e62e29243b9","schema_version":"1.0","event_id":"sha256:1d2f3075fd0014d6ae51244659d0d65f09fa23f8f4a02c7c36664e62e29243b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOQLCL6AU6IGZ3UD7P2DNY6ITG/bundle.json","state_url":"https://pith.science/pith/YOQLCL6AU6IGZ3UD7P2DNY6ITG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOQLCL6AU6IGZ3UD7P2DNY6ITG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-05T20:52:35Z","links":{"resolver":"https://pith.science/pith/YOQLCL6AU6IGZ3UD7P2DNY6ITG","bundle":"https://pith.science/pith/YOQLCL6AU6IGZ3UD7P2DNY6ITG/bundle.json","state":"https://pith.science/pith/YOQLCL6AU6IGZ3UD7P2DNY6ITG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOQLCL6AU6IGZ3UD7P2DNY6ITG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:YOQLCL6AU6IGZ3UD7P2DNY6ITG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4805a912f1fbe190e4862aab59b2f86806bbf81eb25edb037760625509b0bffc","cross_cats_sorted":[],"license":"","primary_cat":"cs.DB","submitted_at":"2002-02-21T05:23:51Z","title_canon_sha256":"71bf6009853579672de45f2e32d623303bb4393b93d051bad3756de5c20eeccb"},"schema_version":"1.0","source":{"id":"cs/0202035","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0202035","created_at":"2026-07-04T14:24:15Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0202035v1","created_at":"2026-07-04T14:24:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0202035","created_at":"2026-07-04T14:24:15Z"},{"alias_kind":"pith_short_12","alias_value":"YOQLCL6AU6IG","created_at":"2026-07-04T14:24:15Z"},{"alias_kind":"pith_short_16","alias_value":"YOQLCL6AU6IGZ3UD","created_at":"2026-07-04T14:24:15Z"},{"alias_kind":"pith_short_8","alias_value":"YOQLCL6A","created_at":"2026-07-04T14:24:15Z"}],"graph_snapshots":[{"event_id":"sha256:1d2f3075fd0014d6ae51244659d0d65f09fa23f8f4a02c7c36664e62e29243b9","target":"graph","created_at":"2026-07-04T14:24:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0202035/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In optimizing queries, solutions based on AND/OR DAG can generate all possible join orderings and select placements before searching for optimal query execution strategy. But as the number of joins and selection conditions increase, the space and time complexity to generate optimal query plan increases exponentially. In this paper, we use join graph for a relational database schema to either pre-compute all possible join orderings that can be executed and store it as a join DAG or, extract joins in the queries to incrementally build a history join DAG as and when the queries are executed. The ","authors_text":"Kamalakar Karlapalem, Satyanarayana R Valluri, Soujanya Vadapalli","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DB","submitted_at":"2002-02-21T05:23:51Z","title":"Sprinkling Selections over Join DAGs for Efficient Query Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0202035","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:70e28ef93a4053c68c571a23aed1b1815aa21ce98e7a6948883110f117f3e388","target":"record","created_at":"2026-07-04T14:24:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4805a912f1fbe190e4862aab59b2f86806bbf81eb25edb037760625509b0bffc","cross_cats_sorted":[],"license":"","primary_cat":"cs.DB","submitted_at":"2002-02-21T05:23:51Z","title_canon_sha256":"71bf6009853579672de45f2e32d623303bb4393b93d051bad3756de5c20eeccb"},"schema_version":"1.0","source":{"id":"cs/0202035","kind":"arxiv","version":1}},"canonical_sha256":"c3a0b12fc0a7906cee83fbf436e3c899b67cf510eb508340663e405aae0d08ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3a0b12fc0a7906cee83fbf436e3c899b67cf510eb508340663e405aae0d08ba","first_computed_at":"2026-07-04T14:24:15.878625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:24:15.878625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BjbG8CkYGz9wLJEzX+OBEwARyfiZW/Ovg60WDFXnxeeiJWM6Xtik1Hi01PPKRwBXtPVe51yxdTbgJD62jjpxAQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:24:15.879013Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0202035","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70e28ef93a4053c68c571a23aed1b1815aa21ce98e7a6948883110f117f3e388","sha256:1d2f3075fd0014d6ae51244659d0d65f09fa23f8f4a02c7c36664e62e29243b9"],"state_sha256":"6f204dc7bed495558e4281cae828a6226d1a993e784f60b65d8ac60d937e9031"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WCuA9VQMu9P5LQrBaMHYGKpY/N7mN1d3tJjPRXwHZdOmiPLzCeqCZM6Kj2eVuM1cmvGnRKtx0a7zZ+PjfGc7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T20:52:35.587707Z","bundle_sha256":"298e1d9258a348ec0d33ceed266ea636ead5cce769db8d5d438f8681069bddeb"}}