4908 search results - page 916 / 982 » On the Complexity of Optimal K-Anonymity |
165
click to vote
SIGMOD
2009
ACM
16 years 2 days ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
192
click to vote
SIGMOD
2009
ACM
16 years 2 days ago
2009
ACM
As business intelligence becomes increasingly essential for organizations and as it evolves from strategic to operational, the complexity of Extract-Transform-Load (ETL) processes...
SIGMOD
2001
ACM
16 years 1 hour ago
2001
ACM
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical ...
114
click to vote
PODS
2006
ACM
15 years 12 months ago
2006
ACM
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
108
click to vote
PODS
2007
ACM
15 years 12 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...