Efficient Computation of Search Computing Queries

Braga, Daniele; Grossniklaus, Michael; Corcoglioniti, Francesco; Vadacca, Salvatore

Efficient Computation of Search Computing Queries

Dateien

Braga_251511.pdf(529.55 KB)

Datum

2011

Autor:innen

Braga, Daniele

Grossniklaus, Michael

Corcoglioniti, Francesco

Vadacca, Salvatore

Publikationstyp

Beitrag zu einem Sammelband

Erschienen in

Search Computing / Ceri, Stefano; Brambilla, Marco (Hrsg.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2011. - (Lecture Notes in Computer Science ; 6585). - S. 141-155. - ISBN 978-3-642-19667-6

Zusammenfassung

This chapter gives a high-level overview of how query processing is carried out in SeCo. At the highest level of abstraction, queries are expressed in a conjunctive declarative query language over service interfaces, named SeCoQL, chosen to be a compact and readable formulation to serve both experts users and system developers. Queries are then expressed at a logical level in the form of acyclic invocation workflows, after a compile-time analysis that decides a cost-driven scheduling of service invocations. At a lower, physical level queries are then translated into executable specifications that distinguish between the data flow and the control flow, support parallelism, account for stateless and stateful computation tasks, and support backward and forward control. The query engine is implemented as an interpreter of these physical plans. A workbench and testing environment is also available in the form of a tool, to monitor the processing of complex queries by inspecting all phases of their analysis and execution, at all levels of abstraction.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

BRAGA, Daniele, Michael GROSSNIKLAUS, Francesco CORCOGLIONITI, Salvatore VADACCA, 2011. Efficient Computation of Search Computing Queries. In: CERI, Stefano, ed., Marco BRAMBILLA, ed.. Search Computing. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 141-155. ISBN 978-3-642-19667-6. Available under: doi: 10.1007/978-3-642-19668-3_14

BibTex

@incollection{Braga2011Effic-25151,
  year={2011},
  doi={10.1007/978-3-642-19668-3_14},
  title={Efficient Computation of Search Computing Queries},
  number={6585},
  isbn={978-3-642-19667-6},
  publisher={Springer Berlin Heidelberg},
  address={Berlin, Heidelberg},
  series={Lecture Notes in Computer Science},
  booktitle={Search Computing},
  pages={141--155},
  editor={Ceri, Stefano and Brambilla, Marco},
  author={Braga, Daniele and Grossniklaus, Michael and Corcoglioniti, Francesco and Vadacca, Salvatore}
}

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/25151">
    <dc:creator>Corcoglioniti, Francesco</dc:creator>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/25151/1/Braga_251511.pdf"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/25151"/>
    <dc:rights>terms-of-use</dc:rights>
    <dc:contributor>Grossniklaus, Michael</dc:contributor>
    <dcterms:abstract xml:lang="eng">This chapter gives a high-level overview of how query processing is carried out in SeCo. At the highest level of abstraction, queries are expressed in a conjunctive declarative query language over service interfaces, named SeCoQL, chosen to be a compact and readable formulation to serve both experts users and system developers. Queries are then expressed at a logical level in the form of acyclic invocation workflows, after a compile-time analysis that decides a cost-driven scheduling of service invocations. At a lower, physical level queries are then translated into executable specifications that distinguish between the data flow and the control flow, support parallelism, account for stateless and stateful computation tasks, and support backward and forward control. The query engine is implemented as an interpreter of these physical plans. A workbench and testing environment is also available in the form of a tool, to monitor the processing of complex queries by inspecting all phases of their analysis and execution, at all levels of abstraction.</dcterms:abstract>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Vadacca, Salvatore</dc:contributor>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/25151/1/Braga_251511.pdf"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:title>Efficient Computation of Search Computing Queries</dcterms:title>
    <dc:creator>Vadacca, Salvatore</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Corcoglioniti, Francesco</dc:contributor>
    <dc:creator>Braga, Daniele</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-11-20T08:21:46Z</dc:date>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:language>eng</dc:language>
    <dcterms:issued>2011</dcterms:issued>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:contributor>Braga, Daniele</dc:contributor>
    <dc:creator>Grossniklaus, Michael</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-11-20T08:21:46Z</dcterms:available>
    <dcterms:bibliographicCitation>Search Computing : Trends and Developments / Marco Brambilla; Stefano Ceri. - Springer : Berlin, 2011. - S. 141-155. - (Lecture Notes in Computer Science ; 6585). - ISBN 978-3-642-19667-6</dcterms:bibliographicCitation>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Nein