Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2016
Low-Overhead Asynchronous Checkpointing in Main-Memory Database Systems
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 1539–1551https://doi.org/10.1145/2882903.2915966As it becomes increasingly common for transaction processing systems to operate on datasets that fit within the main memory of a single machine or a cluster of commodity machines, traditional mechanisms for guaranteeing transaction durability---which ...
- research-articleJune 2016
Similarity Join over Array Data
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 2007–2022https://doi.org/10.1145/2882903.2915247Scientific applications are generating an ever-increasing volume of multi-dimensional data that are largely processed inside distributed array databases and frameworks. Similarity join is a fundamental operation across scientific workloads that requires ...
How to Architect a Query Compiler
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 1907–1922https://doi.org/10.1145/2882903.2915244This paper studies architecting query compilers. The state of the art in query compiler construction is lagging behind that in the compilers field. We attempt to remedy this by exploring the key causes of technical challenges in need of well founded ...
- research-articleJune 2016
Optimization of Nested Queries using the NF2 Algebra
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 1765–1780https://doi.org/10.1145/2882903.2915241A key promise of SQL is that the optimizer will find the most efficient execution plan, regardless of how the query is formulated. In general, query optimizers of modern database systems are able to keep this promise, with the notable exception of ...
- research-articleJune 2016
Functional Dependencies for Graphs
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 1843–1857https://doi.org/10.1145/2882903.2915232We propose a class of functional dependencies for graphs, referred to as GFDs. GFDs capture both attribute-value dependencies and topological structures of entities, and subsume conditional functional dependencies (CFDs) as a special case. We show that ...
-
- research-articleJune 2016
T-Part: Partitioning of Transactions for Forward-Pushing in Deterministic Database Systems
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 1553–1565https://doi.org/10.1145/2882903.2915227Deterministic database systems have been shown to yield high throughput on a cluster of commodity machines while ensuring the strong consistency between replicas, provided that the data can be well-partitioned on these machines. However, data ...
- research-articleJune 2016
GPL: A GPU-based Pipelined Query Processing Engine
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 1935–1950https://doi.org/10.1145/2882903.2915224Graphics Processing Units (GPUs) have evolved as a powerful query co-processor for main memory On-Line Analytical Processing (OLAP) databases. However, existing GPU-based query processors adopt a kernel-based execution approach which optimizes ...
- research-articleJune 2016
Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 1567–1581https://doi.org/10.1145/2882903.2915222Using indexes for query execution is crucial for achieving high performance in modern on-line transaction processing databases. For a main-memory database, however, these indexes consume a large fraction of the total memory available and are thus a major ...
- research-articleJune 2016
Generating Preview Tables for Entity Graphs
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 1797–1811https://doi.org/10.1145/2882903.2915221Users are tapping into massive, heterogeneous entity graphs for many applications. It is challenging to select entity graphs for a particular need, given abundant datasets from many sources and the oftentimes scarce information for them. We propose ...
- research-articleJune 2016
Speedup Graph Processing by Graph Ordering
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 1813–1828https://doi.org/10.1145/2882903.2915220The CPU cache performance is one of the key issues to efficiency in database systems. It is reported that cache miss latency takes a half of the execution time in database systems. To improve the CPU cache performance, there are studies to support ...
- research-articleJune 2016
DBSherlock: A Performance Diagnostic Tool for Transactional Databases
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 1599–1614https://doi.org/10.1145/2882903.2915218Running an online transaction processing (OLTP) system is one of the most daunting tasks required of database administrators (DBAs). As businesses rely on OLTP databases to support their mission-critical and real-time applications, poor database ...
- research-articleJune 2016
Enabling Incremental Query Re-Optimization
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 1705–1720https://doi.org/10.1145/2882903.2915212As declarative query processing techniques expand to the Web, data streams, network routers, and cloud platforms, there is an increasing need to re-plan execution in the presence of unanticipated performance changes. New runtime information may affect ...
- research-articleJune 2016
Local Similarity Search for Unstructured Text
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 1991–2005https://doi.org/10.1145/2882903.2915211With the growing popularity of electronic documents, replication can occur for many reasons. People may copy text segments from various sources and make modifications. In this paper, we study the problem of local similarity search to find partially ...
- research-articleJune 2016
Transaction Healing: Scaling Optimistic Concurrency Control on Multicores
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 1689–1704https://doi.org/10.1145/2882903.2915202Today's main-memory databases can support very high transaction rate for OLTP applications. However, when a large number of concurrent transactions contend on the same data records, the system performance can deteriorate significantly. This is ...
- posterJune 2016
Adaptive Data Skipping in Main-Memory Systems
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 2255–2256https://doi.org/10.1145/2882903.2914836As modern main-memory optimized data systems increasingly rely on fast scans, lightweight indexes that allow for data skipping play a crucial role in data filtering to reduce system I/O. Scans benefit from data skipping when the data order is sorted, ...
- posterJune 2016
Main Memory Adaptive Denormalization
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 2253–2254https://doi.org/10.1145/2882903.2914835Joins have traditionally been the most expensive database operator, but they are required to query normalized schemas. In turn, normalized schemas are necessary to minimize update costs and space usage. Joins can be avoided altogether by using a ...
- posterJune 2016
K-means Split Revisited: Well-grounded Approach and Experimental Evaluation
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 2251–2252https://doi.org/10.1145/2882903.2914833R-tree is a data structure used for multidimensional indexing. Essentially, it is a balanced tree consisting of nested hyper-rectangles which are used to locate the data. One of the most performance sensitive parts of this data structure is its split ...
- posterJune 2016
Minimizing Average Regret Ratio in Database
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 2265–2266https://doi.org/10.1145/2882903.2914831We propose "average regret ratio" as a metric to measure users' satisfaction after a user sees k selected points of a database, instead of all of the points in the database. We introduce the average regret ratio as another means of multi-criteria ...
- posterJune 2016
Vectorizing an In Situ Query Engine
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 2261–2262https://doi.org/10.1145/2882903.2914829Database systems serve a wide range of use cases efficiently, but require data to be loaded and adapted to the system's execution engine. This pre-processing step is a bottleneck to the analysis of the increasingly large and heterogeneous datasets. ...
- research-articleJune 2016
Querying Geo-Textual Data: Spatial Keyword Queries and Beyond
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 2207–2212https://doi.org/10.1145/2882903.2912572Over the past decade, we have moved from a predominantly desktop based web to a predominantly mobile web, where users most often access the web from mobile devices such as smartphones. In addition, we are witnessing a proliferation of geo-located, ...