AS-index: A structure for string search using n-grams and algebraic signatures

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2009, Pages 295-304

  Du Mouza, Cédric ^a   Litwin, Witold ^b   Rigaux, Philippe ^c   Schwarz, Thomas ^d  

^a University of Paris Cité   (France)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

^c INRIA SACLAY   (France)

^d SANTA CLARA UNIVERSITY   (United States)

Author keywords

Full text indexing; Large scale indexing

Indexed keywords

ACCESS TIME; ALGEBRAIC SIGNATURES; DESIGN TRADEOFF; EXPERIMENTAL PERFORMANCE ANALYSIS; FULL TEXT INDEXING; INDEX STRUCTURE; N-GRAMS; NEW INDICES; SEARCH ALGORITHMS; SEARCH COSTS; STORAGE OVERHEAD; STRING SEARCH;

ALGEBRA; HASH FUNCTIONS; KNOWLEDGE MANAGEMENT; LEARNING ALGORITHMS;

INDEXING (OF INFORMATION);

EID: 74549136791     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1645953.1645993     Document Type: Conference Paper

References (23)

1. S. N. A. Andersson. Efficient Implementation of Suffix Trees. Software - Practice and Experience, 25(2):129-141, 1995.
2. X. Cao, S. C. Li, and A. K. H. Tung. Indexing dna sequences using q-grams. In Proc. Database Systems for Advanced Applications (DASFAA), pages 4-16, 2005.
3. C. Charras, T. Lecroq, and J. D. Pehoushek. A Very Fast String Matching Algorithm for Small Alphabets and Long Patterns. In Proc. Combinatorial Pattern Matching, 1998. LNCS 1448.
4. M. Crochemore and M. Lecroq. Pattern Matching and Text Compression ALgorithms. CRC Press Inc, 2004.
5. R. Dementiev, J. Kärkkäinen, J. Mehnert, and P. Sanders. Better External Memory Suffix Array Construction. ACM Journal of Experimental Algorithmics, 12:1-24, 2008.
6. C. Faloutsos. Signature Files. In Information Retrieval: Data Structures & Algorithms, pages 44-65. 1992.
7. P. Ferragina and R. Grossi. The String B-tree: A New Data Structure for String Search in External Memory and Its Applications. J. ACM, 46(2):236-280, 1999.
8. J. Gray and B. Fitzgerald. Flash Disk Opportunity for Server-Applications. In Intl. Conf. on Innovative Data Systems research (CIDR), 2007.
9. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
10. J. Kärkkäinen. Suffix Cactus: A Cross between Suffix Treee and Suffix Array. In Proc. Intl.Symp. on Combinatorial Pattern Matching (CPM), pages 191-204, 1995.
11. M. S. Kim, K. 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), 2005.
12. S. Kurtz. Reducing the Space Requirement of Suffix Trees. Software - Practice and Experience, 29(13):1149-1171, 1999.
13. W. Litwin and T. Schwarz. Algebraic Signatures for Scalable Distributed Data Structures. In Proc. Intl. Conf. on Data Engineering (ICDE), 2004.
14. U. Manber and E. W. Myers. Sufix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing, 22(5):935-948, 1993.
15. G. Margaritis and S. V. Anastasiadis. Unleashing the Power of Full-text Search on File Systems. In Usenix Conf. on File and Storage Technology, 2007.
16. 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, 1(5), 2000.
17. J. C. Na and K. Park. Simple Implementation of String B-tree. In Proc. String Processing and Information Retrieval (SPIRE), pages 214-215, 2004.
18. B. Phoophakdee and M. J. Zaki. Genome-scale disk-based suffix tree indexing. In Proc. Intl. Conf. on Management of Data (SIGMOD), pages 833-844, 2007.
19. Z. Tan, X. Cao, B. C. Ooi, and A. K. H. Tung. The ed-tree: An Index for Large DNA Sequence Databases. In Proc. Intl. Conf. on Scientific and Statistical Databases (SSDBM), 2003.
20. S. Tata, R. Hankins, and J. Patel. Practical Suffix Tree Construction. In Proc. Intl. Conf. on Very Large Databases (VLDB), pages 36-48, Toronto, Canada, 2004.
21. H. Williams and J. Zobel. Indexing and Retrieval for Genomic Databases. IEEE Transactions on Knowledge and Data Engineering, 14(1):63-78, 2002.
22. I. Witten, A. Moffat, and T. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan-Kaufmann, 1999.
23. J. Zobel, A. Moffat, and K. Ramamohanarao. Inverted Files Versus Signature Files for Text Indexing. ACM Trans. on Database Systems, 23(4):453-490, 1998.