Sciweavers

150 search results - page 3 / 30
» A General Technique for Managing Strings in Comparison-Drive...
Sort
View
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 6 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
SBBD
2007
149views Database» more  SBBD 2007»
13 years 8 months ago
Embedding Similarity Joins into Native XML Databases
Similarity joins in databases can be used for several important tasks such as data cleaning and instance-based data integration. In this paper, we explore ways how to support such ...
Leonardo Ribeiro, Theo Härder
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
14 years 7 months ago
Support envelopes: a technique for exploring the structure of association patterns
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
Michael Steinbach, Pang-Ning Tan, Vipin Kumar
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
14 years 6 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
CAISE
1992
Springer
13 years 10 months ago
Data Modelling in Complex Application Domains
In many non trivial application domains, object types with a complex structure occur. Data modelling techniques which only allow flat structures are not suitable for representing ...
Arthur H. M. ter Hofstede, Henderik Alex Proper, T...