Efficient Processing of Substring Match Queries with Inverted q-gram Indexes
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Younghoon | - |
dc.contributor.author | Woo, Kyoung-Gu | - |
dc.contributor.author | Park, Hyoungmin | - |
dc.contributor.author | Shim, Kyuseok | - |
dc.date.accessioned | 2021-06-23T14:37:59Z | - |
dc.date.available | 2021-06-23T14:37:59Z | - |
dc.date.created | 2021-01-21 | - |
dc.date.issued | 2010-03 | - |
dc.identifier.issn | 1063-6382 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/40537 | - |
dc.description.abstract | With the widespread of the internet, text-based data sources have become ubiquitous and the demand of effective support for string matching queries becomes ever increasing. The relational query language SQL also supports LIKE clause over string data to handle substring matching queries. Due to popularity of such substring matching queries, there have been a lot of study on designing efficient indexes to support the LIKE clause in SQL. Among them, q-gram based indexes have been studied extensively. However, how to process substring matching queries efficiently with such indexes has received very little attention until recently. In this paper, we show that the optimal execution of intersecting posting lists of q-grams for substring matching queries should be decided judiciously. Then we present the optimal and approximate algorithms based on cost estimation for substring matching queries. Performance study confirms that our techniques improve query execution time with q-gram indexes significantly compared to the traditional algorithms. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE COMPUTER SOC | - |
dc.title | Efficient Processing of Substring Match Queries with Inverted q-gram Indexes | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Younghoon | - |
dc.identifier.doi | 10.1109/ICDE.2010.5447866 | - |
dc.identifier.scopusid | 2-s2.0-77952780999 | - |
dc.identifier.wosid | 000286933100077 | - |
dc.identifier.bibliographicCitation | Proceedings - International Conference on Data Engineering, ICDE 2010, pp.721 - 732 | - |
dc.relation.isPartOf | Proceedings - International Conference on Data Engineering, ICDE 2010 | - |
dc.citation.title | Proceedings - International Conference on Data Engineering, ICDE 2010 | - |
dc.citation.startPage | 721 | - |
dc.citation.endPage | 732 | - |
dc.type.rims | ART | - |
dc.type.docType | Proceedings Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/5447866 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.