Synthesizing Document Database Queries using Collection Abstractions

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Liu, Qikang, He, Yang, Cai, Yanwen, Kwak, Byeongguk, Wang, Yuepeng
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909420742508544
author Liu, Qikang
He, Yang
Cai, Yanwen
Kwak, Byeongguk
Wang, Yuepeng
author_facet Liu, Qikang
He, Yang
Cai, Yanwen
Kwak, Byeongguk
Wang, Yuepeng
contents Document databases are increasingly popular in various applications, but their queries are challenging to write due to the flexible and complex data model underlying document databases. This paper presents a synthesis technique that aims to generate document database queries from input-output examples automatically. A new domain-specific language is designed to express a representative set of document database queries in an algebraic style. Furthermore, the synthesis technique leverages a novel abstraction of collections for deduction to efficiently prune the search space and quickly generate the target query. An evaluation of 110 benchmarks from various sources shows that the proposed technique can synthesize 108 benchmarks successfully. On average, the synthesizer can generate document database queries from a small number of input-output examples within tens of seconds.
format Preprint
id arxiv_https___arxiv_org_abs_2412_06102
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Synthesizing Document Database Queries using Collection Abstractions
Liu, Qikang
He, Yang
Cai, Yanwen
Kwak, Byeongguk
Wang, Yuepeng
Databases
Programming Languages
Software Engineering
Document databases are increasingly popular in various applications, but their queries are challenging to write due to the flexible and complex data model underlying document databases. This paper presents a synthesis technique that aims to generate document database queries from input-output examples automatically. A new domain-specific language is designed to express a representative set of document database queries in an algebraic style. Furthermore, the synthesis technique leverages a novel abstraction of collections for deduction to efficiently prune the search space and quickly generate the target query. An evaluation of 110 benchmarks from various sources shows that the proposed technique can synthesize 108 benchmarks successfully. On average, the synthesizer can generate document database queries from a small number of input-output examples within tens of seconds.
title Synthesizing Document Database Queries using Collection Abstractions
topic Databases
Programming Languages
Software Engineering
url https://arxiv.org/abs/2412.06102