Sciweavers

409 search results - page 14 / 82
» Compact Similarity Joins
Sort
View
KDD
1998
ACM
102views Data Mining» more  KDD 1998»
13 years 11 months ago
Joins that Generalize: Text Classification Using WHIRL
WHIRL is an extensionof relational databasesthat canperform "soft joins" basedon the similarity of textual identifiers;thesesoftjoins extendthe traditional operationof j...
William W. Cohen, Haym Hirsh
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
SBBD
2001
119views Database» more  SBBD 2001»
13 years 9 months ago
The Dimension-Join: A New Index for Data Warehouses
There are several auxiliary pre-computed access structures that allow faster answers by reading less base data. Examples are materialized views, join indexes, B-tree and bitmap in...
Pedro Bizarro, Henrique Madeira
ISMB
2003
13 years 9 months ago
PSI: indexing protein structures for fast similarity search
We consider the problem of finding similarities in protein structure databases. Our techniques extract feature vectors on triplets of SSEs (Secondary Structure Elements). Later, ...
Orhan Çamoglu, Tamer Kahveci, Ambuj K. Sing...
WWW
2008
ACM
14 years 8 months ago
Race: finding and ranking compact connected trees for keyword proximity search over xml documents
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
Guoliang Li, Jianhua Feng, Jianyong Wang, Bei Yu, ...