Probabilistic Scheduling for Top-k Query Processing

Moleda, Anna

Local TagsRelease HistoryDetailsSummary

Probabilistic Scheduling for Top-k Query Processing

Moleda, A. (2005). Probabilistic Scheduling for Top-k Query Processing. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2503-B Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0027-D65E-7

Genre: Thesis

Files

show Files

hide Files

:

Moleda_master.pdf (Any fulltext), 960KB

File Permalink:
-

Name:
Moleda_master.pdf

Description:
-

OA-Status:

Visibility:
Restricted (Max Planck Institute for Informatics, MSIN; )

MIME-Type / Checksum:
application/pdf

Technical Metadata:

Copyright Date:
-

Copyright Info:
-

License:
-

Locators

show

Creators

show

hide

Creators:
Moleda, Anna^{1, 2}, Author
Weikum, Gerhard¹, Advisor
Bast, Hannah³, Referee

Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018
2International Max Planck Research School, MPI for Informatics, Max Planck Society, Campus E1 4, 66123 Saarbrücken, DE, ou_1116551
3Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2006-01-20Accepted: 2005-08-26Date issued: 2005

Publication Status: Issued

Pages: -

Publishing info: Saarbrücken : Universität des Saarlandes

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 278879
Other: Local-ID: C1256DBF005F876D-C358CAA736C9613FC12570C1002A6CB8-Moleda2005

Degree: Master

Event

show

Legal Case

show

Project information

show

Source

show