Výsledky vyhledávání - "Nonnumerical Algorithms and Problems— Complexity of proof procedures General Terms Algorithms"

Satisfiability algorithms for conjunctive queries over trees

Autoři: James Cheney The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: James Cheney The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.edbt.org/Proceedings/2011-Uppsala/papers/icdt/a15-cheney.pdf.

Témata: Categories and Subject Descriptors H.2.3 [Database management systems, Languages— query languages, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems— Complexity of proof procedures General Terms Algorithms, Theory Keywords XPath, trees, satisfiability

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.429.3064

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.429.3064
http://www.edbt.org/Proceedings/2011-Uppsala/papers/icdt/a15-cheney.pdf