Efficient Computation of Search Computing Queries

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:1c5565bcd6e93ca6a30bf97dbb1d48d3

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

@incollection{Braga2011Effic-25151, title={Efficient Computation of Search Computing Queries}, year={2011}, doi={10.1007/978-3-642-19668-3_14}, number={6585}, isbn={978-3-642-19667-6}, address={Berlin, Heidelberg}, publisher={Springer 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 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/25151"> <dc:creator>Corcoglioniti, Francesco</dc:creator> <dc:contributor>Corcoglioniti, Francesco</dc:contributor> <dc:creator>Vadacca, Salvatore</dc:creator> <dc:contributor>Braga, Daniele</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-11-20T08:21:46Z</dc:date> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> <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> <dc:rights>deposit-license</dc:rights> <dc:creator>Grossniklaus, Michael</dc:creator> <dcterms:issued>2011</dcterms:issued> <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> <dc:contributor>Vadacca, Salvatore</dc:contributor> <dc:creator>Braga, Daniele</dc:creator> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/25151"/> <dc:language>eng</dc:language> <dc:contributor>Grossniklaus, Michael</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-11-20T08:21:46Z</dcterms:available> <dcterms:title>Efficient Computation of Search Computing Queries</dcterms:title> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Braga_251511.pdf 63

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto