Sciweavers

810 search results - page 124 / 162
» Storage Management for Evolving Databases
Sort
View
ACMSE
2010
ACM
13 years 6 months ago
Mining relaxed closed subspace clusters
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...
Erich Allen Peterson, Peiyi Tang
DATESO
2009
158views Database» more  DATESO 2009»
13 years 5 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
WWW
2011
ACM
13 years 3 months ago
Truthy: mapping the spread of astroturf in microblog streams
Online social media are complementing and in some cases replacing person-to-person social interaction and redefining the diffusion of information. In particular, microblogs have ...
Jacob Ratkiewicz, Michael Conover, Mark Meiss, Bru...
WWW
2011
ACM
13 years 3 months ago
Growing parallel paths for entity-page discovery
In this paper, we use the structural and relational information on the Web to find entity-pages. Specifically, given a Web site and an entity-page (e.g., department and faculty ...
Tim Weninger, Fabio Fumarola, Cindy Xide Lin, Rick...
WWW
2006
ACM
14 years 8 months ago
Semantic link based top-K join queries in P2P networks
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
Jie Liu, Liang Feng, Chao He