Efficient processing of substring match queries with inverted variable-length gram indexes
Authors:
- Younghoon KimYounghoon Kim
- Hyoungmin ParkHPHyoungmin Park
- Kyuseok ShimKSKyuseok Shim
- Kyoung-Gu WooKWKyoung-Gu Woo
- 1 September 2013
- journal article
- Published by Elsevier in Information Sciences
- Vol. 244, 119-141
Abstract
No abstract availableKeywords
Funding Information
- National Research Foundation of Korea
- Ministry of Education, Science and Technology (NRF-2009-0078828)
This publication has 35 references indexed in Scilit:
- Natural Language Compression on Edge-Guided text preprocessingInformation Sciences, 2011
- Estimating the selectivity of approximate string queriesACM Transactions on Database Systems, 2007
- Inverted files for text search enginesACM Computing Surveys, 2006
- Exploiting concept clusters for content-based information retrievalInformation Sciences, 2005
- Regular biosequence pattern matching with cellular automataInformation Sciences, 2002
- A guided tour to approximate string matchingACM Computing Surveys, 2001
- Dictionary selection using partial matchingInformation Sciences, 1999
- The string B-treeJournal of the ACM, 1999
- An improvement of the Aho-Corasick machineInformation Sciences, 1998
- Flexible and adaptable buffer management techniques for database management systemsIEEE Transactions on Computers, 1995