ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 39 Issue 2, May 2014

Optimality of Clustering Properties of Space-Filling Curves
Pan Xu, Srikanta Tirthapura
Article No.: 10
DOI: 10.1145/2556686

Space-filling curves have been used in the design of data structures for multidimensional data for many decades. A fundamental quality metric of a space-filling curve is its “clustering number” with respect to a class of queries, which...

Fast Distributed Transactions and Strongly Consistent Replication for OLTP Database Systems
Alexander Thomson, Thaddeus Diamond, Shu-Chun Weng, Kun Ren, Philip Shao, Daniel J. Abadi
Article No.: 11
DOI: 10.1145/2556685

As more data management software is designed for deployment in public and private clouds, or on a cluster of commodity servers, new distributed storage systems increasingly achieve high data access throughput via partitioning and replication. In...

Sharing across Multiple MapReduce Jobs
Tomasz Nykiel, Michalis Potamias, Chaitanya Mishra, George Kollios, Nick Koudas
Article No.: 12
DOI: 10.1145/2560796

Large-scale data analysis lies in the core of modern enterprises and scientific research. With the emergence of cloud computing, the use of an analytical query processing infrastructure can be directly associated with monetary cost. MapReduce has...

Efficient Algorithms and Cost Models for Reverse Spatial-Keyword k-Nearest Neighbor Search
Ying Lu, Jiaheng Lu, Gao Cong, Wei Wu, Cyrus Shahabi
Article No.: 13
DOI: 10.1145/2576232

Geographic objects associated with descriptive texts are becoming prevalent, justifying the need for spatial-keyword queries that consider both locations and textual descriptions of the objects. Specifically, the relevance of an object to a query...

Domination in the Probabilistic World: Computing Skylines for Arbitrary Correlations and Ranking Semantics
Ilaria Bartolini, Paolo Ciaccia, Marco Patella
Article No.: 14
DOI: 10.1145/2602135

In a probabilistic database, deciding if a tuple u is better than another tuple v has not a univocal solution, rather it depends on the specific Probabilistic Ranking Semantics (PRS) one wants to adopt so as to combine...

On the Complexity of Query Result Diversification
Ting Deng, Wenfei Fan
Article No.: 15
DOI: 10.1145/2602136

Query result diversification is a bi-criteria optimization problem for ranking query results. Given a database D, a query Q, and a positive integer k, it is to find a set of k tuples from Q(D) such that...

Distributed Geometric Query Monitoring Using Prediction Models
Nikos Giatrakos, Antonios Deligiannakis, Minos Garofalakis, Izchak Sharfman, Assaf Schuster
Article No.: 16
DOI: 10.1145/2602137

Many modern streaming applications, such as online analysis of financial, network, sensor, and other forms of data, are inherently distributed in nature. An important query type that is the focal point in such application scenarios regards...

Robust Distributed Query Processing for Streaming Data
Chuan Lei, Elke A. Rundensteiner
Article No.: 17
DOI: 10.1145/2602138

Distributed stream processing systems must function efficiently for data streams that fluctuate in their arrival rates and data distributions. Yet repeated and prohibitively expensive load reallocation across machines may make these systems...