ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 37 Issue 1, February 2012

A survey of B-tree logging and recovery techniques
Goetz Graefe
Article No.: 1
DOI: 10.1145/2109196.2109197

B-trees have been ubiquitous in database management systems for several decades, and they serve in many other storage systems as well. Their basic structure and their basic operations are well understood including search, insertion, and deletion....

Proximity measures for rank join
Davide Martinenghi, Marco Tagliasacchi
Article No.: 2
DOI: 10.1145/2109196.2109198

We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature vector, the goal is to return the K combinations of tuples...

Attribute and object selection queries on objects with probabilistic attributes
Rabia Nuray-Turan, Dmitri V. Kalashnikov, Sharad Mehrotra, Yaming Yu
Article No.: 3
DOI: 10.1145/2109196.2109199

Modern data processing techniques such as entity resolution, data cleaning, information extraction, and automated tagging often produce results consisting of objects whose attributes may contain uncertainty. This uncertainty is frequently captured...

Differentiating search results on structured data
Ziyang Liu, Yi Chen
Article No.: 4
DOI: 10.1145/2109196.2109200

Studies show that about 50% of Web search is for information exploration purposes, where a user would like to investigate, compare, evaluate, and synthesize multiple relevant results. Due to the absence of general tools that can...

Shared execution strategy for neighbor-based pattern mining requests over streaming windows
Di Yang, Elke A. Rundensteiner, Matthew O. Ward
Article No.: 5
DOI: 10.1145/2109196.2109201

In diverse applications ranging from stock trading to traffic monitoring, data streams are continuously monitored by multiple analysts for extracting patterns of interest in real time. These analysts often submit similar pattern mining requests...

Understanding cardinality estimation using entropy maximization
Christopher Ré, D. Suciu
Article No.: 6
DOI: 10.1145/2109196.2109202

Cardinality estimation is the problem of estimating the number of tuples returned by a query; it is a fundamentally important task in data management, used in query optimization, progress estimation, and resource provisioning. We study cardinality...

Exploiting Web querying for Web people search
Rabia Nuray-Turan, Dmitri V. Kalashnikov, Sharad Mehrotra
Article No.: 7
DOI: 10.1145/2109196.2109203

Searching for people on the Web is one of the most common query types submitted to Web search engines today. However, when a person name is queried, the returned Webpages often contain documents related to several distinct namesakes who have the...