Archived Events

Archived Events

Mar 20

2017

Mar 20 2017
[DB Seminar] Spring 2017: Alex Poms
Speaker:
Alex Poms

A growing number of visual computing applications depend on the analysis of large video collections. The challenge is that scaling applications to operate on these datasets requires highly efficient systems for pixel data access and parallel processing. Few programmers have the capability to operate efficiently at these scales, limiting the field's ability to explore new applications that analyze large video... Read More

Mar 6

2017

Mar 6 2017
[DB Seminar] Spring 2017: Xiangyao Yu
Speaker:
Xiangyao Yu

Strong consistency in parallel systems provides high programmability, but requires expensive coordination and scales poorly. This challenge exists in multiple layers of abstraction across the whole hardware and software stack. Examples include multicore processors, parallel transaction processing, and distributed systems. In this talk, I will introduce a simple primitive called logical leases to achieve strong consistency while maintaining good scalability... Read More

Feb 27

2017

Feb 27 2017
[DB Seminar] Spring 2017: Huanchen Zhang
Speaker:
Huanchen Zhang

Succinct data structures are those that require, asymptotically, only the minimum number of bits required by information theory, while still answering queries efficiently. Despite the importance of space efficiency, particularly for today’s massive-scale data services, succinct data structures remain primarily of theoretical interest outside of a few application areas. Our goal in this paper is to make succinct tries practical... Read More

Feb 20

2017

Feb 20 2017
[DB Seminar] Spring 2017: Round table discussion

We will have a round table discussion. Read More

Feb 13

2017

Feb 13 2017
[DB Seminar] Spring 2017: Wei (David) Dai
Speaker:
Wei (David) Dai

Machine Learning (ML) systems depend on data engineering – the practice of transforming a small set of raw measurements to a large number of features – to substantially increase the accuracy of their results. However, as ML problem grow in both data size (number of instances) and model size (number of dimensions), existing systems that support data engineering have not... Read More

Feb 6

2017

Feb 6 2017
[DB Seminar] Spring 2017: Round table discussion

We will have a round table discussion. Read More

Jan 30

2017

Jan 30 2017
[DB Seminar] Spring 2017: Joy Arulraj
Speaker:
Joy Arulraj

Joy will give a talk on his work.The difference in the performance characteristics of volatile (DRAM) and non-volatile storage devices (HDD/SSDs) influences the design of database management systems. The key assumption has always been that the latter is much slower than the former. This affects all aspects of a DBMS's runtime architecture. But the arrival of new non-volatile memory (NVM)... Read More

Dec 5

2016

Dec 5 2016
[DB Seminar] Fall 2016: Kijung Shin
Speaker:
Kijung Shin

How do the k-core structures of real-world graphs look like? What are the common patterns and the anomalies?  How can we use them for algorithm design and applications? A k-core is the maximal subgraph where all vertices have degree at least k. This concept has been applied to such diverse areas as hierarchical structure analysis, graph visualization, and graph clustering.... Read More

Nov 28

2016

Nov 28 2016
[DB Seminar] Fall 2016: Michael Zhang
Speaker:
Michael Zhang

Current architectures for main-memory online transaction processing (OLTP) database management systems (DBMS) are based on one of two design choices. In the partition choice, the data is assumed to be well partitioned. Transactions run with little or no concurrency control inside a partition. In the non-partition choice, the data is not required to be partitioned and the system carefully controls... Read More

Nov 21

2016

Nov 21 2016
[DB Seminar] Fall 2016: Ziqi Wang
Speaker:
Ziqi Wang

As multicore architecture is becoming the new normal of today’s computers, many traditional programming paradigms for mutual exclusion has become a major source of scalability bottleneck. To counter such bottlenecks for our in-memory database prototype at Carnegie Mellon University [1], we implemented a lock-free B+Tree multimap index based on BwTree, which was originally proposed by Microsoft Research [2]. In this... Read More