2013
DOI: 10.1016/j.is.2013.07.004
|View full text |Cite
|
Sign up to set email alerts
|

UpSizeR: Synthetically scaling an empirical relational database

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
25
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(26 citation statements)
references
References 24 publications
1
25
0
Order By: Relevance
“…Then, the measured execution times for the evaluation of the benchmark queries over D 0 should be close to the measured execution times for the evaluation of the same queries over D 1 . In [21], the authors do not consider benchmark queries to be available to the generator, since their goal is broader than benchmarking over a pre-defined set of queries. In OBDA benchmarking, however, the (SQL) workload for the database can be estimated from the mapping component.…”
Section: Data Scaling For Obda Benchmarks: the Vig Approachmentioning
confidence: 99%
See 2 more Smart Citations
“…Then, the measured execution times for the evaluation of the benchmark queries over D 0 should be close to the measured execution times for the evaluation of the same queries over D 1 . In [21], the authors do not consider benchmark queries to be available to the generator, since their goal is broader than benchmarking over a pre-defined set of queries. In OBDA benchmarking, however, the (SQL) workload for the database can be estimated from the mapping component.…”
Section: Data Scaling For Obda Benchmarks: the Vig Approachmentioning
confidence: 99%
“…Without loss of generality, we assume that the intervals generated by VIG satisfying the constraints above are I E = [2,11] and I S = [12,21]. These intervals are assigned to columns ew.id and sw.id, respectively.…”
Section: Analysis Phasementioning
confidence: 99%
See 1 more Smart Citation
“…To ensure D is similar to D, previous work [17], [24], [33], [36] typically follows the framework in Fig.1. Each algorithm extracts a fixed set of features F = {F 1 , F 2 , .…”
Section: A Existing Approach and The Limitationsmentioning
confidence: 99%
“…Given this outlook, a tool that scales an empirical dataset D to a synthetic and similar D will be very appealing. This generation of artificial data is necessary if D is larger, and helpful if D is smaller or equal in size [24], [33]. For all cases: D must be similar to D. Moreover, the similarity definition should be application-specific.…”
Section: Introductionmentioning
confidence: 99%