Sciweavers

318 search results - page 17 / 64
» A New Indexing Method for Approximate String Matching
Sort
View
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
15 years 9 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
ICAIL
2003
ACM
15 years 2 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
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
15 years 9 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
SIGIR
2009
ACM
15 years 4 months ago
Experiments in CLIR using fuzzy string search based on surface similarity
Cross Language Information Retrieval (CLIR) between languages of the same origin is an interesting topic of research. The similarity of the writing systems used for these language...
Sethuramalingam Subramaniam, Anil Kumar Singh, Pra...
SIGMOD
2004
ACM
188views Database» more  SIGMOD 2004»
15 years 9 months ago
Online Event-driven Subsequence Matching over Financial Data Streams
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
Huanmei Wu, Betty Salzberg, Donghui Zhang