Name
Abstract | ||
|---|---|---|
LP is a common formalism for the field of databases and CSP, both at the theoretical level and the implementation level in the form of Datalog and CLP. In the past, close correspondences have been made between both fields at the theoretical level. Yet correspondence at the implementation level has been much less explored. In this article we work towards relating them at the implementation level. Concretely, we show how to derive the efficient Leapfrog Triejoin execution algorithm of Datalog from a generic CP execution scheme. |
Year | Venue | Keywords |
|---|---|---|
2013 | CoRR | logic programming,datalog,constraint programming |
Field | DocType | Volume |
Programming language,Computer science,Theoretical computer science,Formalism (philosophy),Logic programming,Datalog | Journal | abs/1307.4635 |
Citations | PageRank | References |
1 | 0.38 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benoit Desouter | 1 | 8 | 2.69 |
| tom schrijvers | 2 | 652 | 63.35 |