Chapter 10 : Join Methods and Query Optimization

Cite This

Files in this item

Checksum: MD5:6c6252ce17eb19f8b4b8d0bc22157e39

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

@incollection{Braga2010Chapt-25150, title={Chapter 10 : Join Methods and Query Optimization}, year={2010}, doi={10.1007/978-3-642-12310-8_10}, number={5950}, isbn={978-3-642-12309-2}, address={Berlin, Heidelberg}, publisher={Springer 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 xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dspace:hasBitstream rdf:resource=""/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Ceri, Stefano</dc:contributor> <bibo:uri rdf:resource=""/> <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> <dc:creator>Braga, Daniele</dc:creator> <dcterms:available rdf:datatype="">2013-11-20T08:09:34Z</dcterms:available> <dc:contributor>Grossniklaus, Michael</dc:contributor> <dcterms:title>Chapter 10 : Join Methods and Query Optimization</dcterms:title> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:hasPart rdf:resource=""/> <dc:contributor>Braga, Daniele</dc:contributor> <dc:creator>Ceri, Stefano</dc:creator> <dc:language>eng</dc:language> <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> <dcterms:issued>2010</dcterms:issued> <dc:rights>terms-of-use</dc:rights> <dc:date rdf:datatype="">2013-11-20T08:09:34Z</dc:date> <dcterms:isPartOf rdf:resource=""/> <dcterms:rights rdf:resource=""/> <dc:creator>Grossniklaus, Michael</dc:creator> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

Braga_251503.pdf 331

This item appears in the following Collection(s)

Search KOPS


My Account