6 Search Results for "Grust, Torsten"


Document
In-Memory Object Graph Stores

Authors: Aditya Thimmaiah, Zijian Yi, Joseph Kenis, Christopher J Rossbach, and Milos Gligoric

Published in: LIPIcs, Volume 333, 39th European Conference on Object-Oriented Programming (ECOOP 2025)


Abstract
We present a design and implementation of an in-memory object graph store, dubbed εStore. Our key innovation is a storage model - epsilon store - that equates an object on the heap to a node in a graph store. Thus any object on the heap (without changes) can be a part of one, or multiple, graph stores, and vice versa, any node in a graph store can be accessed like any other object on the heap. Specifically, each node in a graph is an object (i.e., instance of a class), and its properties and its edges are the primitive and reference fields declared in its class, respectively. Necessary classes, which are instantiated to represent nodes, are created dynamically by εStore. εStore uses a subset of the Cypher query language to query the graph store. By design, the result of any query is a table (ResultSet) of references to objects on the heap, which users can manipulate the same way as any other object on the heap in their programs. Moreover, a developer can include (transitively) an arbitrary object to become a part of a graph store. Finally, εStore introduces compile-time rewriting of Cypher queries into imperative code to improve the runtime performance. εStore can be used for a number of tasks including implementing methods for complex in-memory structures, writing complex assertions, or a stripped down version of a graph database that can conveniently be used during testing. We implement εStore in Java and show its application using the aforementioned tasks.

Cite as

Aditya Thimmaiah, Zijian Yi, Joseph Kenis, Christopher J Rossbach, and Milos Gligoric. In-Memory Object Graph Stores. In 39th European Conference on Object-Oriented Programming (ECOOP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 333, pp. 30:1-30:30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)


Copy BibTex To Clipboard

@InProceedings{thimmaiah_et_al:LIPIcs.ECOOP.2025.30,
  author =	{Thimmaiah, Aditya and Yi, Zijian and Kenis, Joseph and Rossbach, Christopher J and Gligoric, Milos},
  title =	{{In-Memory Object Graph Stores}},
  booktitle =	{39th European Conference on Object-Oriented Programming (ECOOP 2025)},
  pages =	{30:1--30:30},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-373-7},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{333},
  editor =	{Aldrich, Jonathan and Silva, Alexandra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2025.30},
  URN =		{urn:nbn:de:0030-drops-233225},
  doi =		{10.4230/LIPIcs.ECOOP.2025.30},
  annote =	{Keywords: Object stores, Graph stores, Cypher}
}
Document
Database Theory in Action
Database Theory in Action: Making Provenance and Probabilistic Database Theory Work in Practice (Invited Talk)

Authors: Silviu Maniu and Pierre Senellart

Published in: LIPIcs, Volume 328, 28th International Conference on Database Theory (ICDT 2025)


Abstract
There has been a rich literature in database theory on how to model and manage the provenance of data (for instance using the semiring framework) and its uncertainty (in particular via probabilistic databases). In this article, we explain how these results have been used as the basis for practical implementations, notably in the ProvSQL system, and how these implementations need to be adapted for the efficient management of provenance and probability for real-world data.

Cite as

Silviu Maniu and Pierre Senellart. Database Theory in Action: Making Provenance and Probabilistic Database Theory Work in Practice (Invited Talk). In 28th International Conference on Database Theory (ICDT 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 328, pp. 33:1-33:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)


Copy BibTex To Clipboard

@InProceedings{maniu_et_al:LIPIcs.ICDT.2025.33,
  author =	{Maniu, Silviu and Senellart, Pierre},
  title =	{{Database Theory in Action: Making Provenance and Probabilistic Database Theory Work in Practice (Invited Talk)}},
  booktitle =	{28th International Conference on Database Theory (ICDT 2025)},
  pages =	{33:1--33:6},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-364-5},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{328},
  editor =	{Roy, Sudeepa and Kara, Ahmet},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2025.33},
  URN =		{urn:nbn:de:0030-drops-229746},
  doi =		{10.4230/LIPIcs.ICDT.2025.33},
  annote =	{Keywords: provenance, probabilistic data, ProvSQL}
}
Document
Programming Languages for Big Data (PlanBig) (Dagstuhl Seminar 14511)

Authors: James Cheney, Torsten Grust, and Dimitrios Vytiniotis

Published in: Dagstuhl Reports, Volume 4, Issue 12 (2015)


Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 14511 "Programming Languages for Big Data (PlanBig)". The seminar was motivated by recent developments in programming languages, databases, machine learning, and cloud computing, and particularly by the opportunities offered by research drawing on more than one of these areas. Participants included researchers working in each of these areas and several who have previously been involved in research in the intersection of databases and programming languages. The seminar included talks, demos and free time for discussion or collaboration. This report collects the abstracts of talks and other activities, a summary of the group discussions at the seminar, and a list of outcomes.

Cite as

James Cheney, Torsten Grust, and Dimitrios Vytiniotis. Programming Languages for Big Data (PlanBig) (Dagstuhl Seminar 14511). In Dagstuhl Reports, Volume 4, Issue 12, pp. 48-67, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)


Copy BibTex To Clipboard

@Article{cheney_et_al:DagRep.4.12.48,
  author =	{Cheney, James and Grust, Torsten and Vytiniotis, Dimitrios},
  title =	{{Programming Languages for Big Data (PlanBig) (Dagstuhl Seminar 14511)}},
  pages =	{48--67},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{4},
  number =	{12},
  editor =	{Cheney, James and Grust, Torsten and Vytiniotis, Dimitrios},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.12.48},
  URN =		{urn:nbn:de:0030-drops-50055},
  doi =		{10.4230/DagRep.4.12.48},
  annote =	{Keywords: Programming languages, databases, data-centric computation, machine learning, cloud computing}
}
Document
06472 Abstracts Collection – XQuery Implementation Paradigms

Authors: Peter A. Boncz, Torsten Grust, Jérôme Siméon, and Maurice van Keulen

Published in: Dagstuhl Seminar Proceedings, Volume 6472, XQuery Implementation Paradigms (2007)


Abstract
From 19.11.2006 to 22.11.2006, the Dagstuhl Seminar 06472 ``XQuery Implementation Paradigms'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Peter A. Boncz, Torsten Grust, Jérôme Siméon, and Maurice van Keulen. 06472 Abstracts Collection – XQuery Implementation Paradigms. In XQuery Implementation Paradigms. Dagstuhl Seminar Proceedings, Volume 6472, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)


Copy BibTex To Clipboard

@InProceedings{boncz_et_al:DagSemProc.06472.1,
  author =	{Boncz, Peter A. and Grust, Torsten and Sim\'{e}on, J\'{e}r\^{o}me and van Keulen, Maurice},
  title =	{{06472 Abstracts Collection – XQuery Implementation Paradigms}},
  booktitle =	{XQuery Implementation Paradigms},
  pages =	{1--22},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6472},
  editor =	{Peter A. Boncz and Torsten Grust and J\'{e}r\^{o}me Sim\'{e}on and Maurice van Keulen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06472.1},
  URN =		{urn:nbn:de:0030-drops-8933},
  doi =		{10.4230/DagSemProc.06472.1},
  annote =	{Keywords: XQuery, XPath, XML, XQuery Benchmarking, XQuery Optimization, XQuery Interoperability, XQuery Hard Nut, Compilation, Benchmarking, XMark, Recursion, Database System, Functional Programming Language, Transaction Management, Distributed Query Processing}
}
Document
06472 Executive Summary – XQuery Implementation Paradigms

Authors: Peter A. Boncz, Torsten Grust, Jérôme Siméon, and Maurice van Keulen

Published in: Dagstuhl Seminar Proceedings, Volume 6472, XQuery Implementation Paradigms (2007)


Abstract
Only a couple of weeks after the participants of seminar No. 06472 met in Dagstuhl, the W3C published the Final Recommendation documents that fix the XQuery 1.0 syntax, data model, formal semantics, built-in function library and the interaction with the XML Schema Recommendations (see W3C's XQuery web site at http://www.w3.org/XML/Query/). With the language's standardization nearing its end and now finally in place, the many efforts to construct correct, complete, and efficient implementations of XQuery finally got rid of the hindering "moving target'' syndrome. This Dagstuhl seminar on the different XQuery implementation paradigms that have emerged in the recent past, thus was as timely as it could have possibly been.

Cite as

Peter A. Boncz, Torsten Grust, Jérôme Siméon, and Maurice van Keulen. 06472 Executive Summary – XQuery Implementation Paradigms. In XQuery Implementation Paradigms. Dagstuhl Seminar Proceedings, Volume 6472, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)


Copy BibTex To Clipboard

@InProceedings{boncz_et_al:DagSemProc.06472.2,
  author =	{Boncz, Peter A. and Grust, Torsten and Sim\'{e}on, J\'{e}r\^{o}me and van Keulen, Maurice},
  title =	{{06472 Executive Summary – XQuery Implementation Paradigms}},
  booktitle =	{XQuery Implementation Paradigms},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6472},
  editor =	{Peter A. Boncz and Torsten Grust and J\'{e}r\^{o}me Sim\'{e}on and Maurice van Keulen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06472.2},
  URN =		{urn:nbn:de:0030-drops-10220},
  doi =		{10.4230/DagSemProc.06472.2},
  annote =	{Keywords: XQuery, XML, Database, Compiler, Functional Programming, Transactions}
}
Document
XPathMark: Functional and Performance Tests for XPath

Authors: Massimo Franceschet

Published in: Dagstuhl Seminar Proceedings, Volume 6472, XQuery Implementation Paradigms (2007)


Abstract
We present a major revision of the XPath benchmark known as XPathMark. The new version splits into a functional test over a small educational document and a more elaborated performance test over XMark documents. We conclude by sharing with the reader our experience on running XPathMark on some popular XSLT/XQuery processors.

Cite as

Massimo Franceschet. XPathMark: Functional and Performance Tests for XPath. In XQuery Implementation Paradigms. Dagstuhl Seminar Proceedings, Volume 6472, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)


Copy BibTex To Clipboard

@InProceedings{franceschet:DagSemProc.06472.3,
  author =	{Franceschet, Massimo},
  title =	{{XPathMark: Functional and Performance Tests for XPath}},
  booktitle =	{XQuery Implementation Paradigms},
  pages =	{1--17},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6472},
  editor =	{Peter A. Boncz and Torsten Grust and J\'{e}r\^{o}me Sim\'{e}on and Maurice van Keulen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06472.3},
  URN =		{urn:nbn:de:0030-drops-8929},
  doi =		{10.4230/DagSemProc.06472.3},
  annote =	{Keywords: XML, XPath, Benchmarking}
}
  • Refine by Type
  • 6 Document/PDF
  • 2 Document/HTML

  • Refine by Publication Year
  • 2 2025
  • 1 2015
  • 3 2007

  • Refine by Author
  • 3 Grust, Torsten
  • 2 Boncz, Peter A.
  • 2 Siméon, Jérôme
  • 2 van Keulen, Maurice
  • 1 Cheney, James
  • Show More...

  • Refine by Series/Journal
  • 2 LIPIcs
  • 1 DagRep
  • 3 DagSemProc

  • Refine by Classification
  • 1 Information systems → Database management system engines
  • 1 Software and its engineering
  • 1 Theory of computation → Data provenance
  • 1 Theory of computation → Incomplete, inconsistent, and uncertain databases

  • Refine by Keyword
  • 3 XML
  • 2 Benchmarking
  • 2 XPath
  • 2 XQuery
  • 1 Compilation
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail