A Comparison of Blocking Methods for Record Linkage

Record linkage seeks to merge databases and to remove duplicates when unique identifiers are not available. Most approaches use blocking techniques to reduce the computational complexity associated with record linkage. We review traditional blocking techniques, which typically partition the records according to a set of field attributes, and consider two variants of a method known as locality sensitive hashing, sometimes referred to as "private blocking." We compare these approaches in terms of their recall, reduction ratio, and computational complexity. We evaluate these methods using different synthetic datafiles and conclude with a discussion of privacy-related issues.Comment: 22 pages, 2 tables, 7 figure

On the large N limit, W_\infty Strings, Star products, AdS/CFT Duality, Nonlinear Sigma Models on AdS spaces and Chern-Simons p-branes

It is shown that the large $N$ limit of SU(N) YM in $curved$ $m$-dim backgrounds can be subsumed by a higher $m+n$ dimensional gravitational theory which can be identified to an $m$-dim generally invariant gauge theory of diffs $N$, where $N$ is an $n$-dim internal space (Cho, Sho, Park, Yoon). Based on these findings, a very plausible geometrical interpretation of the $AdS/CFT$ correspondence could be given. Conformally invariant sigma models in $D=2n$ dimensions with target non-compact SO(2n,1) groups are reviewed. Despite the non-compact nature of the SO(2n,1), the classical action and Hamiltonian are positive definite. Instanton field configurations are found to correspond geometrically to conformal ``stereographic'' mappings of $R^{2n}$ into the Euclidean signature $AdS_{2n}$ spaces. The relation between Self Dual branes and Chern-Simons branes, High Dimensional Knots, follows. A detailed discussion on $W_\infty$ symmetry is given and we outline the Vasiliev procedure to construct an action involving higher spin massless fields in $AdS_4$. This $AdS_4$ spacetime higher spin theory should have a one-to-one correspondence to noncritical $W_\infty$ strings propagating on $AdS_4 \times S^7$.Comment: 43 pages, Tex fil

Enabling Secure Database as a Service using Fully Homomorphic Encryption: Challenges and Opportunities

The database community, at least for the last decade, has been grappling with querying encrypted data, which would enable secure database as a service solutions. A recent breakthrough in the cryptographic community (in 2009) related to fully homomorphic encryption (FHE) showed that arbitrary computation on encrypted data is possible. Successful adoption of FHE for query processing is, however, still a distant dream, and numerous challenges have to be addressed. One challenge is how to perform algebraic query processing of encrypted data, where we produce encrypted intermediate results and operations on encrypted data can be composed. In this paper, we describe our solution for algebraic query processing of encrypted data, and also outline several other challenges that need to be addressed, while also describing the lessons that can be learnt from a decade of work by the database community in querying encrypted data