Sciweavers

1709 search results - page 162 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
CLEANDB
2006
ACM
112views Database» more  CLEANDB 2006»
15 years 10 months ago
Generic Entity Resolution with Data Confidences
We consider the Entity Resolution (ER) problem (also known as deduplication, or merge-purge), in which records determined to represent the same real-world entity are successively ...
David Menestrina, Omar Benjelloun, Hector Garcia-M...
SSDBM
2000
IEEE
87views Database» more  SSDBM 2000»
15 years 10 months ago
A Tool for Nesting and Clustering Large Objects
In implementations of non-standard database systems, large objects are often embedded within an aggregate of different types, i.e. a tuple. For a given size and access probabilit...
Stefan Dieker, Ralf Hartmut Güting, Miguel Ro...
WWW
2005
ACM
16 years 7 months ago
TJFast: effective processing of XML twig pattern matching
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process ...
Jiaheng Lu, Ting Chen, Tok Wang Ling
SIGMOD
2005
ACM
162views Database» more  SIGMOD 2005»
16 years 6 months ago
Fast and Approximate Stream Mining of Quantiles and Frequencies Using Graphics Processors
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
Naga K. Govindaraju, Nikunj Raghuvanshi, Dinesh Ma...
ICIP
2008
IEEE
16 years 23 days ago
Detection of +/-1 LSB steganography based on the amplitude of histogram local extrema
Recently Zhang et al described an algorithm for the detection of ±1 LSB steganography based on the statistics of the amplitudes of local extrema in the greylevel histogram. Exper...
Giacomo Cancelli, Gwenaël J. Doërr, Inge...