Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3122831acmotherconferencesBook PagePublication PagessplashConference Proceedingsconference-collections
DBPL '17: Proceedings of The 16th International Symposium on Database Programming Languages
ACM2017 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
DBPL 2017: The 16th International Symposium on Database Programming Languages Munich Germany 1 September 2017
ISBN:
978-1-4503-5354-0
Published:
01 September 2017
Sponsors:
SAP, ORACLE
Reflects downloads up to 14 Oct 2024Bibliometrics
Skip Abstract Section
Abstract

DBPL is a biennial symposium that aims to foster exchange of ideas and discussion about current trends and open problems between the database management (DB) and the programming languages (PL) research communities. For over 30 years, DBPL has established itself as the principal venue for publishing and discussing new ideas and problems at the intersection of data management and programming languages.

Skip Table Of Content Section
invited-talk
Take everything from me, but leave me the comprehension: invited talk

For more than twenty years now I am roaming the frontier between the database query and programming language fields. During all that time, one trusty companion has never let me down: the comprehension. Its elegant, concise syntactic form and flexible ...

invited-talk
Modern stored procedures using GraalVM: invited talk

Stored procedures provide a way to centralize business logic involving multiple SQL statements and running them inside a database management system. They are typically executed inside the address space of the database. Doing so helps avoid expensive ...

invited-talk
Bridging the semantical gap between relational data and application-level business objects with core data services: invited talk

Bringing computations close to the data source is one of the key concepts of high-performance database management systems. This specifically holds true for state-of-the-art systems like HyPer, Microsoft SQL Server, or SAP HANA that are making efficient ...

research-article
DDO-Free XQuery
Article No.: 4, Pages 1–13https://doi.org/10.1145/3122831.3122832

XQuery has an order-sensitive semantics in the sense that it requires nodes to be sorted in document order without duplicates (or in Distinct Document Order, DDO for short). This paper shows that for a given XQuery expression and a nested-relational DTD,...

research-article
Public Access
From relation algebra to semi-join algebra: an approach for graph query optimization
Article No.: 5, Pages 1–10https://doi.org/10.1145/3122831.3122833

Many graph query languages rely on the composition operator to navigate graphs and select nodes of interests, even though evaluating compositions of relations can be costly. Often, this need for composition can be reduced by rewriting towards queries ...

research-article
The data cube as a typed linear algebra operator
Article No.: 6, Pages 1–11https://doi.org/10.1145/3122831.3122834

There is a need for a typed notation for linear algebra applicable to the fields of econometrics and data mining. In this paper we show that such a notation exists and can be useful in formalizing and reasoning about data aggregation operations.

One ...

research-article
AL: unified analytics in domain specific terms
Article No.: 7, Pages 1–9https://doi.org/10.1145/3122831.3122835

Data driven organizations gather information on various aspects of their endeavours and analyze that information to gain valuable insights or to increase automatization. Today, these organizations can choose from a wealth of specialized analytical ...

research-article
Property-based testing of SPARQL queries
Article No.: 8, Pages 1–11https://doi.org/10.1145/3122831.3122836

In this paper we describe a property-based testing tool for SPARQL. Given a SPARQL query, the tool randomly generates test cases which consist on instances of an ontology. The tool checks the well typed-ness of the SPARQL query as well as the ...

research-article
Counting types for massive JSON datasets
Article No.: 9, Pages 1–12https://doi.org/10.1145/3122831.3122837

Type systems express structural information about data, are human readable and hence crucial for understanding code, and are endowed with a formal definition that makes them a fundamental tool when proving program properties. Internal data structures of ...

research-article
Public Access
Temporal graph algebra
Article No.: 10, Pages 1–12https://doi.org/10.1145/3122831.3122838

Graph representations underlie many modern computer applications, capturing the structure of such diverse networks as the Internet, personal associations, roads, sensors, and metabolic pathways. While analysis of static graphs is a well-explored field, ...

short-paper
Variational databases
Article No.: 11, Pages 1–4https://doi.org/10.1145/3122831.3122839

Data variations are prevalent in real-world applications. For example, software vendors handle variations in the business requirements, conventions, and environmental settings of a software product using hundreds of features each combination of which ...

research-article
Locomotor: transparent migration of client-side database code
Article No.: 12, Pages 1–5https://doi.org/10.1145/3122831.3122840

Server-side execution is a well-known method for improving the performance of database applications. Running code on the database server eliminates round trips to the client application resulting in significantly reduced latency. However, the common ...

short-paper
GraphScript: implementing complex graph algorithms in SAP HANA
Article No.: 13, Pages 1–4https://doi.org/10.1145/3122831.3122841

Real-world graph applications are typically domain-specific and model complex business processes in the property graph data model. To implement a domain-specific graph algorithm in the context of such a graph application, simply providing a set of built-...

Contributors
  • Purdue University
  • Amazon.com, Inc.
Index terms have been assigned to the content through auto-classification.

Recommendations

Acceptance Rates

DBPL '17 Paper Acceptance Rate 10 of 15 submissions, 67%;
Overall Acceptance Rate 10 of 15 submissions, 67%
YearSubmittedAcceptedRate
DBPL '17151067%
Overall151067%