Sciweavers

4850 search results - page 265 / 970
» Approximate Data Structures with Applications
Sort
View
203
Voted
CIKM
2004
Springer
16 years 1 days ago
Organizing structured web sources by query schemas: a clustering approach
In the recent years, the Web has been rapidly “deepened” with the prevalence of databases online. On this deep Web, many sources are structured by providing structured query i...
Bin He, Tao Tao, Kevin Chen-Chuan Chang
PODS
2006
ACM
122views Database» more  PODS 2006»
16 years 6 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
DBVIS
1993
101views Database» more  DBVIS 1993»
15 years 10 months ago
Using Visualization to Support Data Mining of Large Existing Databases
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
Daniel A. Keim, Hans-Peter Kriegel
IPTPS
2005
Springer
16 years 4 days ago
Brushwood: Distributed Trees in Peer-to-Peer Systems
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
Chi Zhang, Arvind Krishnamurthy, Randolph Y. Wang
KDD
2007
ACM
201views Data Mining» more  KDD 2007»
16 years 7 months ago
Structural and temporal analysis of the blogosphere through community factorization
The blogosphere has unique structural and temporal properties since blogs are typically used as communication media among human individuals. In this paper, we propose a novel tech...
Yun Chi, Shenghuo Zhu, Xiaodan Song, Jun'ichi Tate...