Searching for authors named "Dilys Thomas" – sorted by Relevance.
-
Generating Queries with Cardinality Constraints for DBMS Testing
- Abstract — Good testing coverage of novel database techniques, such as multidimensional histograms or changes in the execution engine, is a complex problem. In this work, we argue that this task requires generating query instances, not randomly, but based on a given set of constraints. Specifically,
- Cited by 4 (0 self) – Add To MetaCart
-
Auditing a Batch of SQL Queries
- Abstract. In this paper, we study the problem of auditing a batch of SQL queries: given a set of SQL queries that have been posed over a database, determine whether some subset of these queries have revealed private information about an individual or group of individuals. In [2], the authors studied
- Add To MetaCart
-
Journal of Privacy Technology 20051120001 Approximation Algorithms for k-Anonymity ∗
- We consider the problem of releasing a table containing personal records, while ensuring individual privacy and maintaining data integrity to the extent possible. One of the techniques proposed in the literature is k-anonymization. A release is considered k-anonymous if the information corresponding
- Add To MetaCart
-
VLDB Journal manuscript No.
- In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or realtime query responses in such an environment must be prepared to deal gracefully with bursts in data arrival without compromising system performanc
- Add To MetaCart
-
Operator Scheduling in Data Stream Systems
- In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or real-time query responses in such an environment must be prepared to deal gracefully with bursts in data arrival without compromising system performan
- Cited by 18 (0 self) – Add To MetaCart

