Skip to Main content Skip to Navigation

AS-Index: A Structure For String Search Using n-grams and Algebraic Signatures

Abstract : AS-Index is a new index structure for exact string search in disk resident databases. It uses hashing, unlike known alternatives, whether baesd on trees or tries. It typically indexes every n-gram in the database, though non-dense indexing is possible. The hash function uses the algebraic signatures of $n$-grams. Use of hashing provides for constant index access time for arbitrarily long patterns, unlike other structures whose search cost is at best logarithmic. The storage overhead of AS-Index is basically 500 - 600%, similar to that ofalternatives or smaller. We show the index structure, our use of algebraic signatures and the search algorithm. We present the theoretical and experimental performance analysis. We compare the AS-Index to main alternatives. We conclude that AS-Index is an attractive structure and we indicate directions for future work.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01125707
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 11:24:20 AM
Last modification on : Wednesday, March 4, 2020 - 11:00:57 AM

Identifiers

  • HAL Id : hal-01125707, version 1

Citation

Cedric Du Mouza, Witold Litwin, Philippe Rigaux, Thomas Schwarz. AS-Index: A Structure For String Search Using n-grams and Algebraic Signatures. CIKM'09 ACM Conference on Information and Knowledge Management, Hong-Kong, Jan 2009, X, France. pp.295-304. ⟨hal-01125707⟩

Share

Metrics

Record views

100