Sciweavers

91 search results - page 3 / 19
» Scalable computation of acyclic joins
Sort
View
COLING
2010
13 years 2 months ago
Simple and Efficient Algorithm for Approximate Dictionary Matching
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
Naoaki Okazaki, Jun-ichi Tsujii
ICDE
2003
IEEE
133views Database» more  ICDE 2003»
14 years 9 months ago
Text Joins for Data Cleansing and Integration in an RDBMS
An organization's data records are often noisy because of transcription errors, incomplete information, lack of standard formats for textual data or combinations thereof. A f...
Luis Gravano, Panagiotis G. Ipeirotis, Nick Koudas...
AI
2008
Springer
13 years 7 months ago
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...
Jürg Kohlas, Nic Wilson
IPPS
2005
IEEE
14 years 1 months ago
Evaluation of Rate-Based Adaptivity in Asynchronous Data Stream Joins
Continuous query systems are an intuitive way for users to access streaming data in large-scale scientific applications containing many hundreds of streams. A challenge in these ...
Beth Plale, Nithya N. Vijayakumar
ICDM
2005
IEEE
149views Data Mining» more  ICDM 2005»
14 years 1 months ago
A Join-Less Approach for Co-Location Pattern Mining: A Summary of Results
Spatial co-location patterns represent the subsets of features whose instances are frequently located together in geographic space. Co-location pattern discovery presents challeng...
Jin Soung Yoo, Shashi Shekhar, Mete Celik