2008 IEEE 24th International Conference on Data Engineering 2008
DOI: 10.1109/icde.2008.4497468
|View full text |Cite
|
Sign up to set email alerts
|

Robust Runtime Optimization of Data Transfer in Queries over Web Services

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2009
2009
2013
2013

Publication Types

Select...
5
1
1

Relationship

3
4

Authors

Journals

citations
Cited by 26 publications
(16 citation statements)
references
References 16 publications
0
16
0
Order By: Relevance
“…In this way, the computation and the communication costs overlap resulting in decreased query total response time. Note that mitigating the impact of high data transmission in service based systems is an ongoing activity already yielding significant results (see [14,15,35]) from which our unifying architectural proposal can benefit.…”
Section: Query Plan Generationmentioning
confidence: 99%
See 1 more Smart Citation
“…In this way, the computation and the communication costs overlap resulting in decreased query total response time. Note that mitigating the impact of high data transmission in service based systems is an ongoing activity already yielding significant results (see [14,15,35]) from which our unifying architectural proposal can benefit.…”
Section: Query Plan Generationmentioning
confidence: 99%
“…First, the service oriented architecture and the SOAP-based communication protocol incur a high overhead when large data sets are transmitted. This drawback has been partly ameliorated through the development of adaptive techniques [14,15] that continuously track the optimum size of data chunks. Second, as users typically do not have enough information about the semantics of the data in the autonomous, third-party resources to which they are provided access, they find it difficult to formulate semantically correct queries that combine data from multiple sources.…”
Section: Motivation and Contributionsmentioning
confidence: 99%
“…This is a part of the general rewriting algorithm (Algorithm 1, lines [13][14]. There are additional rewriting rules for Fork, Savepoint and Reply operators, which we omitted here because they are straight-forward.…”
Section: Algorithm 1 Process Plan Vectorizationmentioning
confidence: 99%
“…There, request documents are divided into chunks, and services are called for every single chunk [13]. An automatic chunk-size computation using the extremum-control approach was addressed in [14]. On the process level, pipeline scheduling was incorporated in [15] into a general workflow model to show the valuable benefit of pipelining in business processes.…”
Section: Related Workmentioning
confidence: 99%
“…The service-wrapped database receives the query and prepares the results. Typically, the results are not sent in a single message, but are split into chunks [10,3]. More specifically, in Step 2a, the client asks for the next chunk of the results specifying the exact chunk size (measured in number of tuples) as a parameter.…”
Section: Introductionmentioning
confidence: 99%