Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Best Effort Top-K Query Processing Under Budgetary Constraints

Shmueli-Scheuer, M., Li, C., Mass, Y., Roitman, H., Schenkel, R., & Weikum, G. (2009). Best Effort Top-K Query Processing Under Budgetary Constraints. In Y. Ioannidis, D. Lee, & R. Ng (Eds.), Proceedings of the 25th IEEE International Conference on Data Engineering (pp. 928-939). Los Alamitos, CA: IEEE.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-18F8-0 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-34BB-2
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Shmueli-Scheuer, Michal1, Autor           
Li, Chen2, Autor
Mass, Yosi2, Autor
Roitman, Haggai2, Autor
Schenkel, Ralf1, Autor           
Weikum, Gerhard1, Autor           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              
2External Organizations, ou_persistent22              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: We consider a novel problem of top-k query processing under budget constraints. We provide both a framework and a set of algorithms to address this problem. Existing algorithms for top-k processing are budget-oblivious, i.e., they do not take budget constraints into account when making scheduling decisions, but focus on the performance to compute the final top-k results. Under budget constraints, these algorithms therefore often return results that are a lot worse than the results that can be achieved with a clever, budget-aware scheduling algorithm. This paper introduces novel algorithms for budget-aware top-k processing that produce results that are significantly better than those of state-of-the-art budget-obvlivious solutions.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2009
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 520435
Anderer: Local-ID: C1256DBF005F876D-3D5E15B84ADBCC48C12574CD00494CC6-ShmueliSLMRSW09
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: 25th IEEE International Conference on Data Engineering
Veranstaltungsort: Shanghai, China
Start-/Enddatum: 2009-03-29 - 2009-04-04

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Proceedings of the 25th IEEE International Conference on Data Engineering
  Kurztitel : ICDE 2009
Genre der Quelle: Konferenzband
 Urheber:
Ioannidis, Yannis1, Herausgeber
Lee, Dik1, Herausgeber
Ng, Raymong1, Herausgeber
Affiliations:
1 External Organizations, ou_persistent22            
Ort, Verlag, Ausgabe: Los Alamitos, CA : IEEE
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 928 - 939 Identifikator: ISBN: 978-0-7695-3545-6