Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Volume 39, Issue 2May 2014
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
ISSN:0362-5915
EISSN:1557-4644
Reflects downloads up to 03 Feb 2025Bibliometrics
Skip Table Of Content Section
research-article
Optimality of Clustering Properties of Space-Filling Curves
Article No.: 10, Pages 1–27https://doi.org/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 is the average ...

research-article
Fast Distributed Transactions and Strongly Consistent Replication for OLTP Database Systems
Article No.: 11, Pages 1–39https://doi.org/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 order ...

research-article
Sharing across Multiple MapReduce Jobs
Article No.: 12, Pages 1–46https://doi.org/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 been a ...

research-article
Efficient Algorithms and Cost Models for Reverse Spatial-Keyword k-Nearest Neighbor Search
Article No.: 13, Pages 1–46https://doi.org/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 is ...

research-article
Domination in the Probabilistic World: Computing Skylines for Arbitrary Correlations and Ranking Semantics
Article No.: 14, Pages 1–45https://doi.org/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 together tuples' scores and ...

research-article
On the Complexity of Query Result Diversification
Article No.: 15, Pages 1–46https://doi.org/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 the tuples are as relevant as possible to the ...

research-article
Distributed Geometric Query Monitoring Using Prediction Models
Article No.: 16, Pages 1–42https://doi.org/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 actuation ...

research-article
Robust Distributed Query Processing for Streaming Data
Article No.: 17, Pages 1–45https://doi.org/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 ineffective, ...

Subjects

Comments