DSG Seminar Series • Enumerating Tree Decompositions: Why and How
Benny Kimelfeld, Technion
Benny Kimelfeld, Technion
Anil Pacaci, PhD candidate
David R. Cheriton School of Computer Science
Dallas Fraser, Master’s candidate
David R. Cheriton School of Computer Science
Combining text and mathematics when searching in a corpus with extensive mathematical notation remains an open problem. Recent results for math information retrieval systems on the math and text retrieval task at NTCIR-12, for example, show room for improvement, even though formula retrieval appears to be fairly successful.
Babar Naveed Memon, Master’s candidate
David R. Cheriton School of Computer Science
Remote Direct Memory Access (RDMA) can be used to implement a shared storage abstraction or a shared nothing abstraction for distributed applications. We argue that the shared storage abstraction is an overkill for loosely coupled applications and that the shared nothing abstraction does not leverage all the benefits of RDMA.
Panos K. Chrysanthis, University of Pittsburgh
Abstract: Online analytics, in most advanced scientific, business, and defense applications, rely heavily on the efficient execution of large numbers of Aggregate Continuous Queries (ACQs). ACQs continuously aggregate streaming data and periodically produce results such as max or average over a given window of the latest data. It was shown that in processing ACQs it is beneficial to use incremental evaluation, which involves storing and reusing calculations performed over the unchanged parts of the window, rather than performing the re-evaluation of the entire window after each update.
Jennifer Widom
Frederick Emmons Terman Dean, School of Engineering
Fletcher Jones Professor, Computer Science and Electrical Engineering
Stanford University
Paolo Atzeni, Database Professor and Head of the Department of Engineering
Università Roma Tre
NoSQL systems have gained their popularity for many reasons, including the flexibility they provide with modeling, which tries to relax the rigidity provided by the relational model and by the other structured models.
Torben Bach Pedersen, Professor of Computer Science
Aalborg University, Denmark
Data collected from new sources such as sensors and smart devices is large, fast, and often complex. There is a universal wish to perform multidimensional OLAP-style analytics on such data, i.e., to turn it into “Big Multidimensional Data”. Supporting this is a multi-stage journey, requiring new tools and systems, and forming a new, extended data cycle with models as a key concept.
Panos Ipeirotis, Professor and George A. Kellner Faculty Fellow
Department of Information, Operations, and Management Sciences
New York University
Daniel Lemire
Université Télug
Maximizing performance in data engineering is a daunting challenge. We present some of our work on designing faster indexes, with a particular emphasis on compressed indexes. Some of our prior work includes (1) Roaring indexes which are part of multiple big-data systems such as Spark, Hive, Druid, Atlas, Pinot, Kylin, (2) EWAH indexes are part of Git (GitHub) and included in major Linux distributions.