4908 search results - page 880 / 982 » On the Complexity of Optimal K-Anonymity |
178
click to vote
VLDB
2007
ACM
16 years 3 days ago
2007
ACM
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
126
click to vote
PODS
2003
ACM
16 years 1 days ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
118
click to vote
EDBT
2002
ACM
16 years 1 days ago
2002
ACM
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
— One of the central problems for data quality is inconsistency detection. Given a database D and a set Σ of dependencies as data quality rules, we want to identify tuples in D ...
122
click to vote
SAC
2010
ACM
15 years 6 months ago
2010
ACM
This paper presents a random finite set theoretic formulation for multi-object tracking as perceived by a 3D-LIDAR in a dynamic environment. It is mainly concerned with the joint...