Sciweavers

1091 search results - page 54 / 219
» Approximation in Databases
Sort
View
SCCC
1997
IEEE
15 years 10 months ago
Reactive Ranking for Cooperative Databases
A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to thei...
Berthier A. Ribeiro-Neto, Guilherme T. de Assis
DEXA
2004
Springer
136views Database» more  DEXA 2004»
15 years 12 months ago
PC-Filter: A Robust Filtering Technique for Duplicate Record Detection in Large Databases
: In this paper, we will propose PC-Filter (PC stands for Partition Comparison), a robust data filter for approximately duplicate record detection in large databases. PC-Filter dis...
Ji Zhang, Tok Wang Ling, Robert M. Bruckner, Han L...
ICDM
2007
IEEE
254views Data Mining» more  ICDM 2007»
16 years 21 days ago
Sampling for Sequential Pattern Mining: From Static Databases to Data Streams
Sequential pattern mining is an active field in the domain of knowledge discovery. Recently, with the constant progress in hardware technologies, real-world databases tend to gro...
Chedy Raïssi, Pascal Poncelet
IMAGING
2003
15 years 7 months ago
A Large Image Database for Color Constancy Research
We present a study on various statistics relevant to research on color constancy. Many of these analyses could not have been done before simply because a large database for color ...
Florian Ciurea, Brian V. Funt
PODS
2008
ACM
129views Database» more  PODS 2008»
16 years 6 months ago
Tree-width and functional dependencies in databases
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
Isolde Adler