Sciweavers

4113 search results - page 569 / 823
» Watermarking Relational Databases
Sort
View
VLDB
2000
ACM
125views Database» more  VLDB 2000»
15 years 8 months ago
Focused Crawling Using Context Graphs
Maintaining currency of search engine indices by exhaustive crawling is rapidly becoming impossible due to the increasing size and dynamic content of the web. Focused crawlers aim...
Michelangelo Diligenti, Frans Coetzee, Steve Lawre...
VLDB
2000
ACM
163views Database» more  VLDB 2000»
15 years 8 months ago
Hierarchical Compact Cube for Range-Max Queries
A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous val...
Sin Yeung Lee, Tok Wang Ling, Hua-Gang Li
EDBT
2009
ACM
119views Database» more  EDBT 2009»
15 years 7 months ago
Unrestricted wavelet synopses under maximum error bound
Constructing Haar wavelet synopses under a given approximation error has many real world applications. In this paper, we take a novel approach towards constructing unrestricted Ha...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
CIKM
2008
Springer
15 years 6 months ago
Scaling up duplicate detection in graph data
Duplicate detection determines different representations of realworld objects in a database. Recent research has considered the use of relationships among object representations t...
Melanie Herschel, Felix Naumann
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
15 years 6 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane