Proceedings of the 2013 SIGMOD/PODS Ph.D. Symposium 2013
DOI: 10.1145/2483574.2483576
|View full text |Cite
|
Sign up to set email alerts
|

Learning queries for relational, semi-structured, and graph databases

Abstract: Web applications store their data within various database models, such as relational, semi-structured, and graph data models to name a few. We study learning algorithms for queries for the above mentioned models. As a further goal, we aim to apply the results to learning cross-model database mappings, which can also be seen as queries across different schemas.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
1
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 45 publications
0
1
0
Order By: Relevance
“…In general, an MMQ q is a mapping that spans a collection of multi-model data D = {d 1 , … , d k } and maps it to the query result q(D). The evaluation of q is a challenging task and we say it as cross-model query processing [2,12,77] when an MMQ spans multiple data models. Roughly, we can identify two feasible approaches for cross-model query processing: (1) the mediator-wrapper fashion in Polystore systems, and (2) a holistic evaluation in MMDB systems.…”
Section: Cross-model Query Processingmentioning
confidence: 99%
See 1 more Smart Citation
“…In general, an MMQ q is a mapping that spans a collection of multi-model data D = {d 1 , … , d k } and maps it to the query result q(D). The evaluation of q is a challenging task and we say it as cross-model query processing [2,12,77] when an MMQ spans multiple data models. Roughly, we can identify two feasible approaches for cross-model query processing: (1) the mediator-wrapper fashion in Polystore systems, and (2) a holistic evaluation in MMDB systems.…”
Section: Cross-model Query Processingmentioning
confidence: 99%
“…Cross-model query processing via schema mapping Cross-model query processing in both polystores and MMDBs may incur expensive data exchange [77,88]. Figure 2 gives a visual representation of the MMQ Query 1, in which data fragments from the property graph, JSON document, and key-value pairs should be assembled into an intact query result with a graph-JSON join and a JSON-KV join.…”
Section: Cross-model Query Processingmentioning
confidence: 99%
“…Moreover, the problem of learning schema mappings from simple user interactions has been studied in [33], but only in the relation-to-relational case. Interactive query learning on heterogeneous data models is a fundamental step towards interactive learning of cross-model schema mappings [15]. We believe that designing efficient algorithms for mapping big data instances to any other model that is easier to manipulate by the non-expert user (e.g., a common schema that the user feels confident to query) can bring the most value of the big data to the users.…”
Section: Challenges and Perspectivesmentioning
confidence: 99%