Sciweavers

102 search results - page 13 / 21
» Aggregation Algorithms for Very Large Compressed Data Wareho...
Sort
View
SPIRE
2009
Springer
14 years 2 months ago
k2-Trees for Compact Web Graph Representation
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ï...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
14 years 7 months ago
Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
Corrine Cheng, Jörg Sander, Samer Nassar
CNIS
2006
13 years 8 months ago
Towards effective packet classification
A variety of network security services, such as access control in firewalls and protocol analysis in intrusion detection systems, require the discrimination of packets based on th...
Yaxuan Qi, Jun Li
VLDB
2004
ACM
118views Database» more  VLDB 2004»
14 years 24 days ago
On the performance of bitmap indices for high cardinality attributes
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
Kesheng Wu, Ekow J. Otoo, Arie Shoshani
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 9 months ago
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
Yitao Duan, John F. Canny