Sciweavers

387 search results - page 28 / 78
» Reasoning About Approximate Match Query Results
Sort
View
SIGMOD
1998
ACM
180views Database» more  SIGMOD 1998»
14 years 27 days ago
Integration of Heterogeneous Databases Without Common Domains Using Queries Based on Textual Similarity
Most databases contain “name constants” like course numbers, personal names, and place names that correspond to entities in the real world. Previous work in integration of het...
William W. Cohen
EDBT
2009
ACM
118views Database» more  EDBT 2009»
14 years 3 months ago
Flexible query answering on graph-modeled data
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...
EWCBR
1998
Springer
14 years 26 days ago
On Bayesian Case Matching
Abstract. Case retrieval is an important problem in several commercially signi cant application areas, such as industrial con guration and manufacturing problems. In this paper we ...
Petri Kontkanen, Petri Myllymäki, Tomi Siland...
VLDB
2007
ACM
105views Database» more  VLDB 2007»
14 years 2 months ago
Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
13 years 12 days ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi