Sciweavers

274 search results - page 11 / 55
» Approximating Edit Distance Efficiently
Sort
View
SSDBM
2003
IEEE
164views Database» more  SSDBM 2003»
14 years 3 months ago
Approximate String Joins
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
Divesh Srivastava
EDBT
2004
ACM
172views Database» more  EDBT 2004»
14 years 10 months ago
Efficient Similarity Search for Hierarchical Data in Large Databases
Structured and semi-structured object representations are getting more and more important for modern database applications. Examples for such data are hierarchical structures inclu...
Karin Kailing, Hans-Peter Kriegel, Stefan Schö...
VLDB
2005
ACM
93views Database» more  VLDB 2005»
14 years 3 months ago
Indexing Mixed Types for Approximate Retrieval
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
Liang Jin, Nick Koudas, Chen Li, Anthony K. H. Tun...
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
14 years 10 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
KDD
2003
ACM
214views Data Mining» more  KDD 2003»
14 years 10 months ago
Adaptive duplicate detection using learnable string similarity measures
The problem of identifying approximately duplicate records in databases is an essential step for data cleaning and data integration processes. Most existing approaches have relied...
Mikhail Bilenko, Raymond J. Mooney