Difference between revisions of "TTT"

From MonetDB
Jump to navigationJump to search
Line 26: Line 26:
 
:Analyzing a textual trace is a difficult task. Would the job be relatively easy if the textual information is presented in a graphical format? This talk presents a GUI front end to visualize the textual trace of MonetDB MAL instructions produced by a tool titled "Stethoscope". The trace could be analysed in an offline and on-line manner. The talk presents a demo of the offline version of GUI along with architecture of the entire tool.
 
:Analyzing a textual trace is a difficult task. Would the job be relatively easy if the textual information is presented in a graphical format? This talk presents a GUI front end to visualize the textual trace of MonetDB MAL instructions produced by a tool titled "Stethoscope". The trace could be analysed in an offline and on-line manner. The talk presents a demo of the offline version of GUI along with architecture of the entire tool.
  
== February 2, 2012: Scilens Cluster ==
+
== February 2, 2012: The Scilens Cluster Machine ==
; Speaker: Arjen  
+
; Speaker: Arjen de Rijke
 
; Abstract
 
; Abstract
MISSING!
+
Now that the Scilens Machine is up and running, it is time to present it in more details. We will discuss the design, the selection of the hardware, the setup of the software and the intended way the machine is supposed to be used. We will also discuss the selection of the second half of the hardware and ideas on how to use the machine.
  
 
== February 9, 2012: Sinterklaas ==
 
== February 9, 2012: Sinterklaas ==

Revision as of 14:15, 27 January 2012


Agenda

December 15, 2011: Concurrency Control for Adaptive Indexing

Speaker
Felix Halim
Abstract
Adaptive indexing constructs and optimizes indexes incrementally, as a side effect of query processing. The goal is to give all performance benefits from indexing while protecting workload performance from the costs. However, read-only queries that result in index optimization now resemble update transactions, in that termination of a read-only transaction implies lock contention, logging, and possibly rollback and recovery after system failures.
The present paper considers adaptive indexing in the context of concurrency control. We apply and extend prior work to reduce concurrency control conflicts and overheads to practical—or even negligible— levels. In order to achieve this, the design and implementation of adaptive indexing must separate index structures from index contents, which relaxes the constraints and requirements during adaptive indexing compared to those of traditional index updates. Furthermore, we observe that even within the context of structural changes, index refinement is optional. Our experiments demonstrate that the performance overhead of concurrency control during structural updates is minimal and that adaptive early termination alleviates problems with concurrency control.

January 12, 2012: SRBench: A Benchmark for Streaming RDF Storage Engines

Speaker
Jennie
Abstract
Processing streaming RDF data is gaining increasing attention from the semantic web community. Work has been done on building stream RDF processing engines, and several extensions to the SPARQL language have been proposed to query streaming RDF data. The growing number of proposals calls for a benchmark for streaming RDF engines to make comparison among different systems possible. However, existing benchmarks, both in the streaming data processing area and in the RDF data processing area, are not sufficient. The existing benchmarks on streaming data processing do not capture the properties of the RDF data; while the existing benchmarks on RDF data processing do not capture the properties of streaming data. To advance the state-of-the-art in streaming RDF data processing, we propose SRBench, a benchmark especially designed for streaming RDF storage engines. As both the SPARQL and the streaming SPARQL languages are still evolving, the first version of SRBench targets at examining the expressiveness of the language for querying streaming RDF data. This presentation gives an overview of the current status of SRBench.

January 19, 2012: Subquery plan reuse based Query Optimization

Speaker
Vamsi
Abstract

In this presentation, we revisit the problem of query optimization in relational DBMS. We propose a scheme to reduce the search space of Dynamic Programming based on reuse of query plans among similar subqueries. The method generates the cover set of similar subgraphs present in the query graph and allows their corresponding subqueries to share query plans among themselves in the search space. Numerous variants to this scheme have been developed for enhanced memory efficiency. Our implementation and experimental study in PostgreSQL show that one of the schemes is better suited to improve the performance of (Iterative) Dynamic Programming.

January 26, 2012: Stethoscope GUI

Speaker
Mrunal Gawande
Abstract
Analyzing a textual trace is a difficult task. Would the job be relatively easy if the textual information is presented in a graphical format? This talk presents a GUI front end to visualize the textual trace of MonetDB MAL instructions produced by a tool titled "Stethoscope". The trace could be analysed in an offline and on-line manner. The talk presents a demo of the offline version of GUI along with architecture of the entire tool.

February 2, 2012: The Scilens Cluster Machine

Speaker
Arjen de Rijke
Abstract

Now that the Scilens Machine is up and running, it is time to present it in more details. We will discuss the design, the selection of the hardware, the setup of the software and the intended way the machine is supposed to be used. We will also discuss the selection of the second half of the hardware and ideas on how to use the machine.

February 9, 2012: Sinterklaas

Speaker
Thibault
Abstract

MISSING!

February 16, 2012

Speaker
Fabian
Abstract

MISSING!