English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Advanced Divide-and-Conquer Algorithms for Computing Two-Hop Covers for Large Collections of XML Documents

Broschart, A. (2004). Advanced Divide-and-Conquer Algorithms for Computing Two-Hop Covers for Large Collections of XML Documents. Diploma Thesis, Universität des Saarlandes, Saarbrücken.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2A05-3 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0023-F1BE-B
Genre: Thesis
Latex : Advanced Divide-and-Conquer Algorithms for Computing Two-Hop Covers for Large Collections of {XML} Documents

Files

show Files
hide Files
:
Broschart.pdf (Any fulltext), 734KB
 
File Permalink:
-
Name:
Broschart.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Broschart, Andreas1, Author           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20042004
 Publication Status: Issued
 Pages: -
 Publishing info: Saarbrücken : Universität des Saarlandes
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 231856
BibTex Citekey: Broschart2004
Other: Local-ID: C1256DBF005F876D-C4EFE1E784999AB3C1256F17003B455B-Broschart2004
 Degree: Diploma

Event

show

Legal Case

show

Project information

show

Source

show