{"paper":{"title":"BitPath -- Label Order Constrained Reachability Queries over Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Medha Atre, Mohammed J. Zaki, Vineet Chaoji","submitted_at":"2012-03-13T18:11:55Z","abstract_excerpt":"In this paper we focus on the following constrained reachability problem over edge-labeled graphs like RDF -- \"given source node x, destination node y, and a sequence of edge labels (a, b, c, d), is there a path between the two nodes such that the edge labels on the path satisfy a regular expression \"*a.*b.*c.*d.*\". A \"*\" before \"a\" allows any other edge label to appear on the path before edge \"a\". \"a.*\" forces at least one edge with label \"a\". \".*\" after \"a\" allows zero or more edge labels after \"a\" and before \"b\". Our query processing algorithm uses simple divide-and-conquer and greedy pruni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2886","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":""},"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"}