as-index：a structure for string search using n-grams and algebraic signatures.pdfVIP

下载本文档

1
0
约14.17万字
约 20页
2017-09-14 发布于上海
举报
版权申诉

as-index：a structure for string search using n-grams and algebraic signatures.pdf

1、本文档共20页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

as-index：a structure for string search using n-grams and algebraic signatures

Constantin C, du Mouza C, Litwin W et al. AS-Index: A structure for string search using n-grams and algebraic signatures. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 31(1): 147–166 Jan. 2016. DOI 10.1007/s11390-016-1618-6 AS-Index: A Structure for String Search Using n-Grams and Algebraic Signatures Camelia Constantin 1, C´edric du Mouza 2, Witold Litwin 3, Fellow, ACM, Philippe Rigaux 2, and Thomas Schwarz 4 1LIP6 Laboratory, University Pierre et Marie Curie, Paris 75005, France 2 CEDRIC Laboratory, Conservatoire National des Arts et M´etiers, Paris 75003, France 3LAMSADE Laboratory, University Paris-Dauphine, Paris 75775, France 4DICC Laboratory, Universidad Cat´olica del Uruguay, Montevideo 11200, Uruguay E-mail: camelia.constantin@lip6.fr; dumouza@cnam.fr; witold.litwin@dauphine.fr; philippe.rigaux@cnam.fr E-mail: tschwarz@.uy Received February 20, 2014; revised July 23, 2014. Abstract We present the AS-Index, a new index structure for exact string search in disk resident databases. AS-Index relies on a classical inverted ﬁle structure, whose main innovation is a probabilistic search based on the properties of algebraic signatures used for both n-grams hashing and pattern search. Speciﬁcally, the properties of our signatures allow to carry out a search by inspecting only two of the posting lists. The algorithm thus enjoys the unique feature of requiring a constant number of disk accesses, independently from both the pattern size and the database size. We conduct extensive experiments on large datasets to evaluate our index behavior. They conﬁrm that it steadily provides a search performance proportional to the two disk accesses necessary to obtain the posting lists. This makes our structure a choice of interest for the class of applications that require very fast lookups in large textual databases. We describe the index structure, our use