901 search results - page 17 / 181 » On Anonymization of String Data |
ICDE
2011
IEEE
14 years 1 months ago
2011
IEEE
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
111
click to vote
ACSC
2007
IEEE
15 years 3 months ago
2007
IEEE
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
DEXAW
2006
IEEE
15 years 3 months ago
2006
IEEE
: Scalable Distributed Data Structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applicat...
169
click to vote
POPL
2008
ACM
15 years 9 months ago
2008
ACM
A lens is a bidirectional program. When read from left to right, it denotes an ordinary function that maps inputs to outputs. When read from right to left, it denotes an "upd...
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
With this work we aim to make a three-fold contribution. We first address the issue of supporting efficiently queries over string-attributes involving prefix, suffix, containmen...