ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 40 Issue 3, October 2015

Boosting the Quality of Approximate String Matching by Synonyms
Jiaheng Lu, Chunbin Lin, Wei Wang, Chen Li, Xiaokui Xiao
Article No.: 15
DOI: 10.1145/2818177

A string-similarity measure quantifies the similarity between two text strings for approximate string matching or comparison. For example, the strings “Sam” and “Samuel” can be considered to be similar. Most existing work...

Workload-Driven Antijoin Cardinality Estimation
Florin Rusu, Zixuan Zhuang, Mingxi Wu, Chris Jermaine
Article No.: 16
DOI: 10.1145/2818178

Antijoin cardinality estimation is among a handful of problems that has eluded accurate efficient solutions amenable to implementation in relational query optimizers. Given the widespread use of antijoin and subset-based queries in analytical...

Optimal Location Queries in Road Networks
Zitong Chen, Yubao Liu, Raymond Chi-Wing Wong, Jiamin Xiong, Ganglin Mai, Cheng Long
Article No.: 17
DOI: 10.1145/2818179

In this article, we study an optimal location query based on a road network. Specifically, given a road network containing clients and servers, an optimal location query finds a location on the road network such that when a new server is set up at...

Reducing Layered Database Applications to their Essence through Vertical Integration
Kristian F. D. Rietveld, Harry A. G. Wijshoff
Article No.: 18
DOI: 10.1145/2818180

In the last decade, improvements on single-core performance of CPUs has stagnated. Consequently, methods for the development and optimization of software for these platforms have to be reconsidered. Software must be optimized such that the...

SCANRAW: A Database Meta-Operator for Parallel In-Situ Processing and Loading
Yu Cheng, Florin Rusu
Article No.: 19
DOI: 10.1145/2818181

Traditional databases incur a significant data-to-query delay due to the requirement to load data inside the system before querying. Since this is not acceptable in many domains generating massive amounts of raw data (e.g.,...

Uncertain Graph Processing through Representative Instances
Panos Parchas, Francesco Gullo, Dimitris Papadias, Francesco Bonchi
Article No.: 20
DOI: 10.1145/2818182

Data in several applications can be represented as an uncertain graph whose edges are labeled with a probability of existence. Exact query processing on uncertain graphs is prohibitive for most applications, as it involves evaluation over an...