English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products

Moerkotte, G., & Neumann, T. (2006). Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products. In Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB 2006) (pp. 930-941). New York, USA: ACM.

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-000F-21F9-9 Version Permalink: http://hdl.handle.net/11858/00-001M-0000-0015-7E47-5
Genre: Conference Paper

Files

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

Locators

show

Creators

show
hide
 Creators:
Moerkotte, Guido, Author
Neumann, Thomas1, Author              
Dayal, Umeshwar, Editor
Whang, Kyu-Young, Editor
Lomet, David B., Editor
Alonso, Gustavo, Editor
Lohman, Guy M., Editor
Kersten, Martin L., Editor
Cha, Sang Kyun, Editor
Kim, Young-Kuk, Editor
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Content

show
hide
Free keywords: -
 Abstract: Two approaches to derive dynamic programming algorithms for constructing join trees are described in the literature. We show analytically and experimentally that these two variants exhibit vastly diverging runtime behaviors for different query graphs. More specifically, each variant is superior to the other for one kind of query graph (chain or clique), but fails for the other. Moreover, neither of them handles star queries well. This motivates us to derive an algorithm that is superior to the two existing algorithms because it adapts to the search space implied by the query graph.

Details

show
hide
Language(s): eng - English
 Dates: 2007-03-302006
 Publication Status: Published in print
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 314661
Other: Local-ID: C1256DBF005F876D-AB1C7CF900B91D5FC125721100325A49-Neumann2006a
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Seoul, Korea
Start-/End Date: 2006-09-12

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB 2006)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 930 - 941 Identifier: ISBN: 1-59593-385-9