Sciweavers

387 search results - page 1 / 78
» Reasoning About Approximate Match Query Results
Sort
View
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
14 years 5 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
IJCAI
2003
13 years 5 months ago
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all t...
Carmel Domshlak, Francesca Rossi, Kristen Brent Ve...
PVLDB
2008
134views more  PVLDB 2008»
13 years 4 months ago
Reasoning and identifying relevant matches for XML keyword search
Keyword search is a user-friendly mechanism for retrieving XML data in web and scientific applications. An intuitively compelling but vaguely defined goal is to identify matches t...
Ziyang Liu, Yi Chen
VLDB
2004
ACM
120views Database» more  VLDB 2004»
13 years 10 months ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...
VLDB
2005
ACM
93views Database» more  VLDB 2005»
13 years 10 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...