Chapter 12 : Panta Rhei ; Flexible Execution Engine for Search Computing Queries

Lade...
Vorschaubild
Dateien
Braga_251428.pdf
Braga_251428.pdfGröße: 830.35 KBDownloads: 398
Datum
2010
Autor:innen
Braga, Daniele
Ceri, Stefano
Corcoglioniti, Francesco
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
ArXiv-ID
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Gesperrt bis
Titel in einer weiteren Sprache
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Publikationstyp
Beitrag zu einem Sammelband
Publikationsstatus
Published
Erschienen in
CERI, Stefano, ed., Marco BRAMBILLA, ed.. Search Computing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 225-243. Lecture Notes in Computer Science. 5950. ISBN 978-3-642-12309-2. Available under: doi: 10.1007/978-3-642-12310-8_12
Zusammenfassung

The efficient execution of data-intensive computations over services is a challenging task: data are retrieved from remote sources and therefore are not available in the query engine until after the execution of these calls, but the system must be inherently efficient thereafter, by guaranteeing that data is immediately cached and processed efficiently, according to the best query plan. In this chapter, we present a flexible execution model for search computing queries, named Panta Rhei. The proposed execution engine paradigm adopts the producer/consumer model and supports both data-driven and event-driven synchronization, and their interplay. Query plans are modeled as directed graphs, whose nodes are processing units and whose edges are either control or data flows. While control flows synchronize service calls and unit execution, data flows transfer data between units that process data flows to produce query results. We present the specification of Panta Rhei by formally defining the units for data production, consumption, manipulation, and caching, as well as the control and data flows. Finally, we discuss how a query plan is expressed in terms of a query execution plan.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690BRAGA, Daniele, Stefano CERI, Francesco CORCOGLIONITI, Michael GROSSNIKLAUS, 2010. Chapter 12 : Panta Rhei ; Flexible Execution Engine for Search Computing Queries. In: CERI, Stefano, ed., Marco BRAMBILLA, ed.. Search Computing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 225-243. Lecture Notes in Computer Science. 5950. ISBN 978-3-642-12309-2. Available under: doi: 10.1007/978-3-642-12310-8_12
BibTex
@incollection{Braga2010Chapt-25142,
  year={2010},
  doi={10.1007/978-3-642-12310-8_12},
  title={Chapter 12 : Panta Rhei ; Flexible Execution Engine for Search Computing Queries},
  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={225--243},
  editor={Ceri, Stefano and Brambilla, Marco},
  author={Braga, Daniele and Ceri, Stefano and Corcoglioniti, Francesco 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/25142">
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-11-20T08:01:13Z</dcterms:available>
    <dcterms:abstract xml:lang="eng">The efficient execution of data-intensive computations over services is a challenging task: data are retrieved from remote sources and therefore are not available in the query engine until after the execution of these calls, but the system must be inherently efficient thereafter, by guaranteeing that data is immediately cached and processed efficiently, according to the best query plan. In this chapter, we present a flexible execution model for search computing queries, named Panta Rhei. The proposed execution engine paradigm adopts the producer/consumer model and supports both data-driven and event-driven synchronization, and their interplay. Query plans are modeled as directed graphs, whose nodes are processing units and whose edges are either control or data flows. While control flows synchronize service calls and unit execution, data flows transfer data between units that process data flows to produce query results. We present the specification of Panta Rhei by formally defining the units for data production, consumption, manipulation, and caching, as well as the control and data flows. Finally, we discuss how a query plan is expressed in terms of a query execution plan.</dcterms:abstract>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:issued>2010</dcterms:issued>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Braga, Daniele</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:rights>terms-of-use</dc:rights>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/25142"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/25142/1/Braga_251428.pdf"/>
    <dc:creator>Corcoglioniti, Francesco</dc:creator>
    <dc:contributor>Ceri, Stefano</dc:contributor>
    <dcterms:title>Chapter 12 : Panta Rhei ; Flexible Execution Engine for Search Computing Queries</dcterms:title>
    <dc:creator>Ceri, Stefano</dc:creator>
    <dc:creator>Grossniklaus, Michael</dc:creator>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/25142/1/Braga_251428.pdf"/>
    <dc:creator>Braga, Daniele</dc:creator>
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-11-20T08:01:13Z</dc:date>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:bibliographicCitation>Search computing - challenges and directions / Stefano Ceri, Marco Brambilla (eds.). - Berlin [u.a.] : Springer, 2010. - S. 225-243. - (Lecture notes in computer science ; 5950). - ISBN 978-3-642-12309-2</dcterms:bibliographicCitation>
    <dc:contributor>Grossniklaus, Michael</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Corcoglioniti, Francesco</dc:contributor>
  </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