| L. Libkin and J. Nurmonen. Counting and locality over finite structures: a survey. In Generalized Quantifiers and Computation, Springer LNCS 1754, pages 18--50, 1999. |
....a watermarking scheme can be obtained. First, we construct a watermarking scheme for database instances with bounded degree Gaifman graph, while preserving any local query. Local languages contain particularly first order logic, order invariant queries [6] and relational AGGR queries [12, 13], that expresses mostly plain SQL by adding grouping and aggregate functions to relational calculus [8, 13, 14] Second, we provide a watermarking scheme for first order and monadic second order queries on trees or tree like structures. Monadic second order logic (MSO) is of a special interest, ....
L. Libkin and J. Nurmonen. Counting and locality over finite structures: a survey. In Generalized Quantifiers and Computation, Springer LNCS 1754, pages 18--50, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC