6533b832fe1ef96bd129a222
RESEARCH PRODUCT
On Diving in Trees Thomas Schwentick
Thomas Schwenticksubject
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTheoretical computer scienceRegular languageComputer scienceRegular expressionQuery languageExpressive powerdescription
The paper is concerned with queries on tree-structured data. It defines fragments of first-order logic (FO) and FO extended by regular expressions along paths. These fragments have the same expressive power as the full logics themselves. On the other hand, they can be evaluated reasonably efficient, even if the formula which represents the query is considered as part of the input.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2000-01-01 |