Database Systems (TODS)


Search Issue
enter search term and/or author name


ACM Transactions on Database Systems (TODS), Volume 36 Issue 4, December 2011

Foreword to TODS invited papers issue 2011
Z. Meral Özsoyoğlu
Article No.: 20
DOI: 10.1145/2043652.2043653

Finding maximal cliques in massive networks
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey Xu Yu, Linhong Zhu
Article No.: 21
DOI: 10.1145/2043652.2043654

Maximal clique enumeration is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The problem is extensively studied; however, the best existing algorithms...

Designing fast architecture-sensitive tree search on modern multicore/many-core processors
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eric Sedlar, Anthony D. Nguyen, Tim Kaldewey, Victor W. Lee, Scott A. Brandt, Pradeep Dubey
Article No.: 22
DOI: 10.1145/2043652.2043655

In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vector units. There has been much work to exploit modern processor...

Characterizing schema mappings via data examples
Bogdan Alexe, Balder TEN Cate, Phokion G. Kolaitis, Wang-Chiew Tan
Article No.: 23
DOI: 10.1145/2043652.2043656

Schema mappings are high-level specifications that describe the relationship between two database schemas; they are considered to be the essential building blocks in data exchange and data integration, and have been the object of extensive...

Bag equivalence of tree patterns
Sara Cohen, Yaacov Y. Weiss
Article No.: 24
DOI: 10.1145/2043652.2043657

When a query is evaluated under bag semantics, each answer is returned as many times as it has derivations. Bag semantics has long been recognized as important, especially when aggregation functions will be applied to query results. This article...

Capturing continuous data and answering aggregate queries in probabilistic XML
Serge Abiteboul, T.-H. HUBERT Chan, Evgeny Kharlamov, Werner Nutt, Pierre Senellart
Article No.: 25
DOI: 10.1145/2043652.2043658

Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database models have been proposed, both in the relational and in the...

Collaborative personalized top-k processing
Xiao Bai, Rachid Guerraoui, Anne-Marie Kermarrec, Vincent Leroy
Article No.: 26
DOI: 10.1145/2043652.2043659

This article presents P4Q, a fully decentralized gossip-based protocol to personalize query processing in social tagging systems. P4Q dynamically associates each user with social acquaintances sharing similar tagging behaviors. Queries are...

The data cyclotron query processing scheme
Romulo Goncalves, Martin Kersten
Article No.: 27
DOI: 10.1145/2043652.2043660

A grand challenge of distributed query processing is to devise a self-organizing architecture which exploits all hardware resources optimally to manage the database hot set, minimize query response time, and maximize throughput without single...