[DB Seminar] Fall 2015: Bryan Hooi / Hyun Ah Song

Speaker:

Bryan Hooi / Hyun Ah Song

Suppose you are a teacher, and have to convey a set of object-property pairs (‘lions eat meat’; or ‘aspirin is a blood- thinner’). A good teacher will convey a lot of information, with little effort on the student side. Specifically, given a list of objects (like animals or medical drugs) and their associated properties, what is the best and most... Read More

SQL Anywhere: Data Management for Occasionally Connected Devices (Ivan T. Bowman)

Speaker:

Ivan T. Bowman

System:

SQL Anywhere

Video:

YouTube

SQL Anywhere is an embedded SQL database engine designed from its first release in 1992 to give good performance "out of the box" in a range of environments from small devices (Raspberry Pi and handhelds) up to server class machines supporting databases of hundreds of gigabytes and thousands of users. From the beginning, SQL Anywhere was designed to offer self-management... Read More

[DB Seminar] Fall 2015: Prashanth Menon

Speaker:

Prashanth Menon

Modern write-intensive key-value stores have emerged as the prevailing data storage system for many big applications. However, these systems often sacrifice their read performance to cope with high data ingestion rates. Solid-state drives (SSD) can lend their help, but their limited capacity and their peculiar characteristics make their exclusive use uneconomical. Hence, hybrid storage environments with both SSDs and hard-disk... Read More

[DB Seminar] Fall 2015: Round table

Seeing as I've not been able to get a speaker for today, I think we can default to a round table discussion.  I think it would be nice to briefly discuss what we are all working on now, after the WWW/SDM deadlines.  We can additionally discuss the focus of some of the works we submitted to these conferences, if there is interest in that. Next week,... Read More

The Journey from Faster to Better (Igor Canadi + Mark Callaghan)

Speakers:

Igor Canadi , Mark Callaghan

System:

RocksDB

Video:

YouTube

RocksDB has been adapted to a wide range of workloads. Early adopters needed a DBMS for low-latency & high-throughput workloads. Using RocksDB as an embedded DBMS eliminates network latency per request. When using RocksDB with a fast SSD we are able to get more IO throughput compared to other open-source DBMS that we use in production. We continue to get... Read More

Charlie Swanson (MongoDB)

Speaker:

Charlie Swanson

System:

MongoDB

From "How many documents are in my collection?" to "What state has the highest percentage of people living in its most populous city?", there are many questions MongoDB can answer about your data. In this talk, we'll see what sorts of questions can be asked, and how MongoDB finds the most efficient way to answer them. Determining the best way... Read More

[DB Seminar] Fall 2015: Alex Beutel

Speaker:

Alex Beutel

Which seems more suspicious: 5,000 tweets from 200 users on 5 IP addresses, or 10,000 tweets from 500 users on 500 IP addresses but all with the same trending topic and all in 10 minutes?  The literature has many methods that try to find dense blocks in matrices, and, recently, tensors, but no method gives a principled way to score... Read More

DB Seminar [Fall 2015]: more WIN discussion

We'll continue last week's theme of discussing more cool talks from WIN.  Other WIN attendees -- please bring some notes about the talks you liked/didn't like or thought-provoking questions from the workshop. Read More

The Lightning Memory-Mapped Database (Howard Chu)

Speaker:

Howard Chu

System:

LMDB

Video:

YouTube

The Lightning Memory-Mapped Database (LMDB) was introduced at LDAPCon 2011 and has been enjoying tremendous success in the intervening time. LMDB was written for the OpenLDAP Project and has proved to be the world's smallest, fastest, and most reliable transactional embedded data store. It has cemented OpenLDAP's position as world's fastest directory server, and its adoption outside the OpenLDAP Project... Read More

DB Seminar [Fall 2015]: Kijung Shin

Speaker:

Kijung Shin

Given a large graph, how can we calculate the relevance between nodes fast and accurately? Random walk with restart (RWR) provides a good measure for this purpose and has been applied to diverse data mining applications including ranking, community detection, link prediction, and anomaly detection. Since calculating RWR from scratch takes long, various preprocessing methods, most of which are related... Read More