Publikation:

Chapter 10 : Join Methods and Query Optimization

Vorschaubild

Dateien

Braga_251503.pdf
Braga_251503.pdfGröße: 365.19 KBDownloads: 348

Datum

2010

Autor:innen

Braga, Daniele
Ceri, Stefano

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
http://nbn-resolving.de/urn:nbn:de:bsz:352-251503
DOI (zitierfähiger Link)
https://doi.org/10.1007/978-3-642-12310-8_10
ArXiv-ID

Internationale Patentnummer

Link zur Lizenz
Urheberrechtlich geschützt

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Green

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Sammelband
Publikationsstatus
Published

Erschienen in

CERI, Stefano, ed., Marco BRAMBILLA, ed.. Search Computing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 188-210. Lecture Notes in Computer Science. 5950. ISBN 978-3-642-12309-2. Available under: doi: 10.1007/978-3-642-12310-8_10

Zusammenfassung

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.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690BRAGA, 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, 2010, pp. 188-210. Lecture Notes in Computer Science. 5950. 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>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen