Sciweavers

354 search results - page 2 / 71
» Approximate String Joins
Sort
View
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
14 years 6 months ago
Approximate Joins for Data-Centric XML
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
Nikolaus Augsten, Michael H. Böhlen, Curtis E...
PVLDB
2010
195views more  PVLDB 2010»
12 years 11 months ago
Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
Jiannan Wang, Guoliang Li, Jianhua Feng
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
13 years 9 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
WWW
2003
ACM
14 years 5 months ago
Text joins in an RDBMS for web data integration
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
Luis Gravano, Panagiotis G. Ipeirotis, Nick Koudas...
FSMNLP
2005
Springer
13 years 10 months ago
WFSM Auto-intersection and Join Algorithms
The join of two n-ary string relations is a main operation regarding to applications. n-Ary rational string relations are realized by weighted finite-state machines with n tapes. ...
André Kempe, Jean-Marc Champarnaud, Franck ...