Chapter 10 : Join Methods and Query Optimization

Braga, Daniele; Ceri, Stefano; Grossniklaus, Michael

Chapter 10 : Join Methods and Query Optimization

Files

Braga_251503.pdf(365.19 KB)

Date

2010

Authors

Braga, Daniele

Ceri, Stefano

Grossniklaus, Michael

Publication type

Contribution to a collection

Published in

Search Computing / Ceri, Stefano; Brambilla, Marco (ed.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2010. - (Lecture Notes in Computer Science ; 5950). - pp. 188-210. - ISBN 978-3-642-12309-2

Abstract

Joins between data sources are an essential ingredient of multi-domain queries, as they exploit connection patterns defined between service marts or between service interfaces. This chapter moves from the definition of a query language over service interfaces, sketching how queries can be directly expressed over service marts and how these can be translated over service interfaces. The fundamental operation discussed in this chapter is the binary join between two sources, which is influenced by the type (search vs. exact) of services and by the management (parallel vs. sequential) of service calls. Then, this chapter presents an optimization framework for queries over several service interfaces, which considers several cost metrics for mapping queries into query plans, consisting of specific operations over services, and includes a branch and bound approach to the exploration of the combinatorial search space of all possible query plans.

Subject (DDC)

004 Computer Science

Cite This

ISO 690

BRAGA, Daniele, Stefano CERI, Michael GROSSNIKLAUS, 2010. Chapter 10 : Join Methods and Query Optimization. In: CERI, Stefano, ed., Marco BRAMBILLA, ed.. Search Computing. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 188-210. ISBN 978-3-642-12309-2. Available under: doi: 10.1007/978-3-642-12310-8_10

BibTex

@incollection{Braga2010Chapt-25150,
  year={2010},
  doi={10.1007/978-3-642-12310-8_10},
  title={Chapter 10 : Join Methods and Query Optimization},
  number={5950},
  isbn={978-3-642-12309-2},
  publisher={Springer Berlin Heidelberg},
  address={Berlin, Heidelberg},
  series={Lecture Notes in Computer Science},
  booktitle={Search Computing},
  pages={188--210},
  editor={Ceri, Stefano and Brambilla, Marco},
  author={Braga, Daniele and Ceri, Stefano and Grossniklaus, Michael}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/25150">
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:rights>terms-of-use</dc:rights>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/25150/2/Braga_251503.pdf"/>
    <dc:contributor>Grossniklaus, Michael</dc:contributor>
    <dc:creator>Braga, Daniele</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-11-20T08:09:34Z</dc:date>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/25150/2/Braga_251503.pdf"/>
    <dcterms:title>Chapter 10 : Join Methods and Query Optimization</dcterms:title>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-11-20T08:09:34Z</dcterms:available>
    <dc:creator>Grossniklaus, Michael</dc:creator>
    <dc:creator>Ceri, Stefano</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Braga, Daniele</dc:contributor>
    <dcterms:issued>2010</dcterms:issued>
    <dc:contributor>Ceri, Stefano</dc:contributor>
    <dcterms:bibliographicCitation>Search Computing : Challenges and Directions ; Part III / Marco Brambilla; Stefano Ceri. - Springer : Berlin, 2010. - S. 188-210. - (Lecture Notes in Computer Science ; 5950). - ISBN 978-3-642-12309-2</dcterms:bibliographicCitation>
    <dc:language>eng</dc:language>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/25150"/>
    <dcterms:abstract xml:lang="eng">Joins between data sources are an essential ingredient of multi-domain queries, as they exploit connection patterns defined between service marts or between service interfaces. This chapter moves from the definition of a query language over service interfaces, sketching how queries can be directly expressed over service marts and how these can be translated over service interfaces. The fundamental operation discussed in this chapter is the binary join between two sources, which is influenced by the type (search vs. exact) of services and by the management (parallel vs. sequential) of service calls. Then, this chapter presents an optimization framework for queries over several service interfaces, which considers several cost metrics for mapping queries into query plans, consisting of specific operations over services, and includes a branch and bound approach to the exploration of the combinatorial search space of all possible query plans.</dcterms:abstract>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
  </rdf:Description>
</rdf:RDF>

Bibliography of Konstanz

No