Sciweavers

17 search results - page 3 / 4
» Aggregate Query Answering on Anonymized Tables
Sort
View
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
13 years 12 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
14 years 9 months ago
Preserving Privacy in Social Networks Against Neighborhood Attacks
Recently, as more and more social network data has been published in one way or another, preserving privacy in publishing social network data becomes an important concern. With som...
Bin Zhou 0002, Jian Pei
DKE
2006
94views more  DKE 2006»
13 years 7 months ago
Extending the data warehouse for service provisioning data
The last few years, there has been an extensive body of literature in data warehousing applications that primarily focuses on basket-type (transactional) data, common in retail in...
Yannis Kotidis
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
14 years 7 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
14 years 7 months ago
A Disk-Based Join With Probabilistic Guarantees
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...