SEPIA: estimating selectivities of approximate string predicates in large Databases

ISSN： 1066-8888

Source： The VLDB Journal, Vol.17, Iss.5, 2008-08, pp. : 1213-1229

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A hybrid index structure for querying large string databases

By Xue Qiang Pramanik Sakti Qiang Gang Zhu Qiang

International Journal of Electronic Business, Vol. 3, Iss. 3-4, 2005-06 ,pp. : 243-254

Inderscience Publishers

Access to resources Recommend Favorite

A hash trie filter method for approximate string matching in genomic databases

By Chang Ye-In Chen Jiun-Rung Hsu Min-Tze

Applied Intelligence, Vol. 33, Iss. 1, 2010-08 ,pp. : 21-38

Springer Publishing Company

Access to resources Recommend Favorite

Generalizing predicates with string arguments

By Cicekli Ilyas Cicekli Nihan

Applied Intelligence, Vol. 25, Iss. 1, 2006-08 ,pp. : 23-36

Springer Publishing Company

Access to resources Recommend Favorite

Approximate string matching for music analysis

By Clifford R. Iliopoulos C.

Soft Computing, Vol. 8, Iss. 9, 2004-09 ,pp. : 597-603

Springer Publishing Company

Access to resources Recommend Favorite

Compressed Indexes for Approximate String Matching

By Chan Ho-Leung Lam Tak-Wah Sung Wing-Kin Tam Siu-Lung Wong Swee-Seong

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 263-281

Springer Publishing Company

Access to resources Recommend Favorite