ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 38 Issue 2, June 2013

Analysis and optimization for boolean expression indexing
Mohammad Sadoghi, Hans-Arno Jacobsen
Article No.: 8
DOI: 10.1145/2487259.2487260

BE-Tree is a novel dynamic data structure designed to efficiently index Boolean expressions over a high-dimensional discrete space. BE Tree-copes with both high-dimensionality and expressiveness of Boolean expressions by introducing an effective...

A partition-based method for string similarity joins with edit-distance constraints
Guoliang Li, Dong Deng, Jianhua Feng
Article No.: 9
DOI: 10.1145/2487259.2487261

As an essential operation in data cleaning, the similarity join has attracted considerable attention from the database community. In this article, we study string similarity joins with edit-distance constraints, which find similar string pairs...

Top-k diversity queries over bounded regions
Ilio Catallo, Eleonora Ciceri, Piero Fraternali, Davide Martinenghi, Marco Tagliasacchi
Article No.: 10
DOI: 10.1145/2487259.2487262

Top-k diversity queries over objects embedded in a low-dimensional vector space aim to retrieve the best k objects that are both relevant to given user's criteria and well distributed over a designated region. An interesting case is...

RFID-data compression for supporting aggregate queries
Bettina Fazzinga, Sergio Flesca, Filippo Furfaro, Elio Masciari
Article No.: 11
DOI: 10.1145/2487259.2487263

RFID-based systems for object tracking and supply chain management have been emerging since the RFID technology proved effective in monitoring movements of objects. The monitoring activity typically results in huge numbers of readings, thus making...

Generalizing database forensics
Kyriacos E. Pavlou, Richard T. Snodgrass
Article No.: 12
DOI: 10.1145/2487259.2487264

In this article we present refinements on previously proposed approaches to forensic analysis of database tampering. We significantly generalize the basic structure of these algorithms to admit new characterizations of the “where” axis...

Revisiting “forward node-selecting queries over trees”
James Cheney
Article No.: 13
DOI: 10.1145/2487259.2487265

In “Forward Node-Selecting Queries over Trees,” Olteanu [2007] gives three rewriting systems for eliminating reverse XPath axis steps from node-selecting queries over trees, together with arguments for their correctness and termination...