Fast nGram-based string search over data encoded using algebraic signatures

33rd International Conference on Very Large Data Bases, VLDB 2007 - Conference Proceedings

Volumn , Issue , 2007, Pages 207-218

  Litwin, Witold ^a   Mokadem, Riad ^a   Rigaux, Philippe ^a,b   Schwarz, Thomas ^c  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b Equipe Gemo   (France)

^c SANTA CLARA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; DISTRIBUTED DATABASE SYSTEMS;

ALGEBRAIC SIGNATURES; BOYER-MOORE; CLEAR TEXT; DATABASE AS SERVICES; DISTRIBUTED IMPLEMENTATION; SEARCH METHOD; SEARCH PATTERNS; STRING SEARCH;

ALGEBRA;

EID: 85011115146     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. M. Bawa, R. Bayardo, and R. Agrawal. Privacy Preserving Indexing of Documents on the Network. In Proc. Intl. Conf. on Very Large Databases (VLDB), 2003.
2. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Commun. ACM, 20(10):762-772, 1977.
3. Y.-C. Chang and M. Mitzenmacher. Privacy Preserving Keyword Searches on Remote Encrypted Data. In Proc. Applied Cryptography and Network Security Conference (ACNS), Springer LNCS, 3531, 2005.
4. M. Crochemore and M. Lecroq. Pattern Matching and Text Compression ALgorithms. CRC Press Inc, 2004.
5. M. Crochemore and W. Rytter. Text algorithms. Oxford University Press, 1994.
6. P. Golle, J. Staddon, and B. Waters. Public Key Encryption with Conjunctive Field Keyword Search. In Proc. Applied Cryptography and Network Security Conference (ACNS), Springer LNCS, 3531, 2005.
7. H. Hacigumus, B. Hore, B. Iyer, and S. Mehrotra. Search on Encrypted Data. Springer Verlag, 2007.
8. R. M. Karp and M. O. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development, 31(2):249-260, 1987.
9. M.-S. Kim, K.-Y. Whang, J.-G. Lee, and M.-J. Lee. n-Gram/2L: A Space and Time Efficient Two-Level n-Gram Inverted Index Structure. In Proc. Intl. Conf. on Very Large Databases (VLDB), pages 325-336, 2005.
10. W. Litwin, R. Mokadem, P. Rigaux, and T. Schwarz. Pattern Matching Using Cumulative Algebraic Signatures and n-gram Sampling. In Intl. Workshop on Grid and Peer-to-Peer Computing Impacts on Large Scale Heterogeneous Distributed Database Systems (GLOBE'06), 2006.
11. W. Litwin, R. Mokadem, and T. Schwarz. Pre-computed Algebraic Signatures for faster string search. Protection against incidental viewing and corruption of Data in an SDDS. In Intl. Workshop DBISP2P, 2005.
12. W. Litwin and T. Schwarz. Algebraic Signatures for Scalable Distributed Data Structures. In Proc. Intl. Conf. on Data Engineering (ICDE), 2004.
13. U. Manber and G. Myers. Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing, 22(5):935, 1993.
14. E. Miller, D. Shen, J. Liu, and C. Nicholas. Performance and Scalability of a Large-Scale N-gram Based Information Retrieval System. Journal of Digital Information, 2000.
15. T. Schwarz, P. Tsui, and W. Litwin. An Encrypted, Content Searchable Scalable Distributed Data Structure. In Proc. Int. Workshop on Security and Trust in Decentralized /Distributed Data Structures (STD3S), 2006.
16. D. Song, D. Wagner, and A. Perrig. Practical Techniques for Searches on Encrypted Data. In Proc. IEEE Security and Privacy Symposium, 2000.