ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 35 Issue 2, April 2010

Transparent anonymization: Thwarting adversaries who know the algorithm
Xiaokui Xiao, Yufei Tao, Nick Koudas
Article No.: 8
DOI: 10.1145/1735886.1735887

Numerous generalization techniques have been proposed for privacy-preserving data publishing. Most existing techniques, however, implicitly assume that the adversary knows little about the anonymization algorithm adopted by the data publisher....

Optimal matching between spatial datasets under capacity constraints
Leong Hou U, Kyriakos Mouratidis, Man Lung Yiu, Nikos Mamoulis
Article No.: 9
DOI: 10.1145/1735886.1735888

Consider a set of customers (e.g., WiFi receivers) and a set of service providers (e.g., wireless access points), where each provider has a capacity and the quality of service offered to its customers is anti-proportional to...

Return specification inference and result clustering for keyword search on XML
Ziyang Liu, Yi Chen
Article No.: 10
DOI: 10.1145/1735886.1735889

Keyword search enables Web users to easily access XML data without the need to learn a structured query language and to study possibly complex data schemas. Existing work has addressed the problem of selecting qualified data nodes that match...

Inference of concise regular expressions and DTDs
Geert Jan Bex, Frank Neven, Thomas Schwentick, Stijn Vansummeren
Article No.: 11
DOI: 10.1145/1735886.1735890

We consider the problem of inferring a concise Document Type Definition (DTD) for a given set of XML-documents, a problem that basically reduces to learning concise regular expressions from positive examples strings. We identify two classes...

Encryption policies for regulating access to outsourced data
Sabrina De Capitani Di Vimercati, Sara Foresti, Sushil Jajodia, Stefano Paraboschi, Pierangela Samarati
Article No.: 12
DOI: 10.1145/1735886.1735891

Current access control models typically assume that resources are under the strict custody of a trusted party which monitors each access request to verify if it is compliant with the specified access control policy. There are many scenarios where...

Personalizing queries based on networks of composite preferences
Georgia Koutrika, Yannis Ioannidis
Article No.: 13
DOI: 10.1145/1735886.1735892

People's preferences are expressed at varying levels of granularity and detail as a result of partial or imperfect knowledge. One may have some preference for a general class of entities, for example, liking comedies, and another one for a...

Querying and repairing inconsistent numerical databases
Sergio Flesca, Filippo Furfaro, Francesco Parisi
Article No.: 14
DOI: 10.1145/1735886.1735893

The problem of extracting consistent information from relational databases violating integrity constraints on numerical data is addressed. In particular, aggregate constraints defined as linear inequalities on aggregate-sum queries on input data...

Comments on “an integrated efficient solution for computing frequent and top-k elements in data streams”
Hongyan Liu, Xiaoyu Wang, Yinghui Yang
Article No.: 15
DOI: 10.1145/1735886.1735894

We investigate a well-known algorithm, Space-Saving [Metwally et al. 2006], which has been proven efficient and effective at mining frequent elements in data streams. We discovered an error in one of the theorems in Metwally et al. [2006]....