{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:ESOVBHT3PZC7KLWTIQ7U27IZQQ","short_pith_number":"pith:ESOVBHT3","schema_version":"1.0","canonical_sha256":"249d509e7b7e45f52ed3443f4d7d19843902e54e7ffa0d448f1bfd597bf7369c","source":{"kind":"arxiv","id":"0907.2089","version":2},"attestation_state":"computed","paper":{"title":"Fast In-Memory XPath Search over Compressed Text and Tree Indexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"A. Arroyuelo, F. Claude, G. Navarro, J. Siren, K. Nguyen, N. V\\\"alim\\\"aki, S. Maneth, V. M\\\"akinen","submitted_at":"2009-07-13T03:19:23Z","abstract_excerpt":"A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicates can efficiently be implemented using a compressed self-index of the document's text nodes. Most queries, however, contain some parts of querying the text of the document, plus some parts of querying the tree structure. It is therefore a challenge to choose an appropriate evaluation order for a given query, which optimally leverages the execution speeds of the text and tree indexes. Here the SXSI system is introduce"},"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":"0907.2089","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2009-07-13T03:19:23Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"ad30c04db4cc42fedd9a83f31e64d7e50094880894fd8960246d065ab16984e9","abstract_canon_sha256":"e182faeea93bd2cb78e9fab8fe58dc7905fb0468d09d37ca30abeb3939c04b96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:40.860479Z","signature_b64":"PH5wnAHs0S+ee08jMfwsT9Wz+fb0DaGydJft3xE8Rwxu63vA5E7MbmRFxnADR795KQ6zSFWC+YF7IU2WDw2HBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"249d509e7b7e45f52ed3443f4d7d19843902e54e7ffa0d448f1bfd597bf7369c","last_reissued_at":"2026-05-18T04:11:40.859991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:40.859991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast In-Memory XPath Search over Compressed Text and Tree Indexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"A. Arroyuelo, F. Claude, G. Navarro, J. Siren, K. Nguyen, N. V\\\"alim\\\"aki, S. Maneth, V. M\\\"akinen","submitted_at":"2009-07-13T03:19:23Z","abstract_excerpt":"A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicates can efficiently be implemented using a compressed self-index of the document's text nodes. Most queries, however, contain some parts of querying the text of the document, plus some parts of querying the tree structure. It is therefore a challenge to choose an appropriate evaluation order for a given query, which optimally leverages the execution speeds of the text and tree indexes. Here the SXSI system is introduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.2089","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"0907.2089","created_at":"2026-05-18T04:11:40.860060+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.2089v2","created_at":"2026-05-18T04:11:40.860060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.2089","created_at":"2026-05-18T04:11:40.860060+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESOVBHT3PZC7","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESOVBHT3PZC7KLWT","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESOVBHT3","created_at":"2026-05-18T12:25:59.703012+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/ESOVBHT3PZC7KLWTIQ7U27IZQQ","json":"https://pith.science/pith/ESOVBHT3PZC7KLWTIQ7U27IZQQ.json","graph_json":"https://pith.science/api/pith-number/ESOVBHT3PZC7KLWTIQ7U27IZQQ/graph.json","events_json":"https://pith.science/api/pith-number/ESOVBHT3PZC7KLWTIQ7U27IZQQ/events.json","paper":"https://pith.science/paper/ESOVBHT3"},"agent_actions":{"view_html":"https://pith.science/pith/ESOVBHT3PZC7KLWTIQ7U27IZQQ","download_json":"https://pith.science/pith/ESOVBHT3PZC7KLWTIQ7U27IZQQ.json","view_paper":"https://pith.science/paper/ESOVBHT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.2089&json=true","fetch_graph":"https://pith.science/api/pith-number/ESOVBHT3PZC7KLWTIQ7U27IZQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ESOVBHT3PZC7KLWTIQ7U27IZQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESOVBHT3PZC7KLWTIQ7U27IZQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESOVBHT3PZC7KLWTIQ7U27IZQQ/action/storage_attestation","attest_author":"https://pith.science/pith/ESOVBHT3PZC7KLWTIQ7U27IZQQ/action/author_attestation","sign_citation":"https://pith.science/pith/ESOVBHT3PZC7KLWTIQ7U27IZQQ/action/citation_signature","submit_replication":"https://pith.science/pith/ESOVBHT3PZC7KLWTIQ7U27IZQQ/action/replication_record"}},"created_at":"2026-05-18T04:11:40.860060+00:00","updated_at":"2026-05-18T04:11:40.860060+00:00"}