L-reach: A vertex set cover approach to regular expression-based reachability queries.
Yifei ZhangGuoren WangChangkuan ZhaoEnde ZhangPublished in: FSKD (2013)
Keyphrases
- regular expressions
- set cover
- reachability queries
- greedy algorithm
- approximation algorithms
- network flow
- pattern matching
- np hard
- data objects
- semistructured data
- greedy heuristic
- solution space
- query language
- structured databases
- labeling scheme
- convex hull
- xml schema
- main memory
- primal dual
- query evaluation
- minimum cost
- directed graph
- matching algorithm
- databases
- database
- expressive power
- xml data
- worst case
- special case
- relational databases
- data structure
- optimal solution