Sciweavers

30 search results - page 6 / 6
» Cache-Oblivious Index for Approximate String Matching
Sort
View
CIKM
2008
Springer
13 years 7 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
ICAIL
2003
ACM
13 years 10 months ago
A Comparative Evaluation of Name-Matching Algorithms
Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management syste...
Karl Branting
EDBT
2004
ACM
121views Database» more  EDBT 2004»
14 years 5 months ago
LexEQUAL: Supporting Multiscript Matching in Database Systems
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
A. Kumaran, Jayant R. Haritsa
WWW
2003
ACM
14 years 6 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...
EDBT
2008
ACM
178views Database» more  EDBT 2008»
14 years 5 months ago
Compacting music signatures for efficient music retrieval
Music information retrieval is becoming very important with the ever-increasing growth of music content in digital libraries, peer-to-peer systems and the internet. While it is ea...
Bin Cui, H. V. Jagadish, Beng Chin Ooi, Kian-Lee T...