Misc3028: Unterschied zwischen den Versionen
Mac (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorNachname=Acosta |ErsterAutorVorname=Maribel }} {{Publikation Author |Rank=2 |Author=Maria-Esther Vidal }} {{Misc |Title=Eva…“) |
Mac (Diskussion | Beiträge) |
||
Zeile 8: | Zeile 8: | ||
}} | }} | ||
{{Misc | {{Misc | ||
− | |Title=Evaluating Adaptive Query Processing Techniques for Federations of SPARQL Endpoints | + | |Title=Evaluating Adaptive Query Processing Techniques for Federations of SPARQL Endpoints |
|Year=2011 | |Year=2011 | ||
|Month=November | |Month=November | ||
− | |Howpublished | + | |Howpublished=10th International Semantic Web Conference (ISWC) Demo Session |
− | |||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
Zeile 26: | Zeile 25: | ||
mance with respect to a variety of RDF engines for queries of diverse | mance with respect to a variety of RDF engines for queries of diverse | ||
complexity, and show that ANAPSID may outperform existing engines. | complexity, and show that ANAPSID may outperform existing engines. | ||
− | |||
|Link=http://iswc2011.semanticweb.org/fileadmin/iswc/Papers/PostersDemos/iswc11pd_submission_95.pdf | |Link=http://iswc2011.semanticweb.org/fileadmin/iswc/Papers/PostersDemos/iswc11pd_submission_95.pdf | ||
|Forschungsgruppe=Wissensmanagement | |Forschungsgruppe=Wissensmanagement | ||
}} | }} |
Aktuelle Version vom 18. Juni 2012, 16:41 Uhr
Veröffentlichung: 2011
November
Art der Veröffentlichung: 10th International Semantic Web Conference (ISWC) Demo Session
BibTeX
Kurzfassung
We present ANAPSID and illustrate the benefits of adap-
tive semantic data management techniques for accessing a federation
of SPARQL endpoints. ANAPSID adapts query execution schedulers to
data availability and runtime conditions, implements physical SPARQL
operators that detect when an endpoint becomes blocked or data traf-
fic is bursty, and opportunistically produces results as quickly as data
arrives from the sources. Additionally, ANAPSID operators implement
main memory replacement policies to move previous computed matches
to secondary memory avoiding duplicates. We show ANAPSID perfor-
mance with respect to a variety of RDF engines for queries of diverse
complexity, and show that ANAPSID may outperform existing engines.
Weitere Informationen unter: Link