Compressing string data in a database by using q-grams

ICCET 2010 - 2010 International Conference on Computer Engineering and Technology, Proceedings

Volumn 2, Issue , 2010, Pages

  Danesh, Amir Seyed ^a   Ahy, Abdollatif ^b  

^a UNIVERSITY OF MALAYA   (Malaysia)

^b UNIVERSITY OF GUILAN   (Iran)

Author keywords

Compressing; Database; DBMS; Q gram; String

Indexed keywords

COMPRESSING; DATABASE; DBMS; Q-GRAM; STRING;

DATABASE SYSTEMS;

EID: 77958061436     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCET.2010.5485484     Document Type: Conference Paper

References (6)

1. Luis Gravano, Panagiotis G. Ipeirotis, H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Lauri Pietarinen, Divesh Srivastava. Using q-grams in a DBMS for Approximate String Processing.
2. Erkki Sutinen and Jorma Tarhio. On using q-gram locations in approximate string matching. In Proceedings of Third Annual European Symposium on Algorithms (ESA'95), pages 327-340, 1995.
3. Esko Ukkonen. Approximate string matching with q-grams and maximal matches. Theoretical Computer Science, 92(1):191-211, 1992.
4. J. R. Ullmann. A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words. The Computer Journal, 20(2):141-147, 1977.
5. Abdullah Almousa Almaksour†, Gabriel Antoniu†, Luc Bougé‡, Loïc Cudennec†, Stéphane Garçanski§. Building a DBMS on top of the JuxMem Grid Data-Sharing Service.
6. Ivan T. Bowman Peter Bumbulis Dan Farrar Anil K. Goel Brendan Lucier Anisoara Nica G. N. Paulley John Smirnios Matthew Young-Lai. SQL Anywhere: An Embeddable DBMS.