Name
Abstract | ||
|---|---|---|
We solve a problem, stated in [CGP10], showing that Sticky Datalog exists, defined in the cited paper as an element of the Datalog pm project, has the finite controllability property. In order to do that, we develop a technique, which we believe can have further applications, of approximating Chase(D, cal T), for a database instance D and a set of tuple generating dependencies and data log rules cal T, by an infinite sequence of finite structures, all of them being models of cal T and D. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/LICS.2013.61 | J. Comput. Syst. Sci. |
Keywords | DocType | Volume |
approximating chase,sticky datalog,finite controllability property,database instance d,finite controllability,infinite sequence,datalog pm project,tuple generating dependency,finite structure,data structures,controllability,computer science,database theory,datalog,finite element analysis,boolean functions,databases | Conference | 83 |
Issue | ISSN | Citations |
1 | 0022-0000 | 2 |
PageRank | References | Authors |
0.41 | 11 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomasz Gogacz | 1 | 43 | 5.80 |
| Jerzy Marcinkowski | 2 | 502 | 30.18 |