Constructing Optimal Bushy Processing Trees for Join Queries is NP-hard

to connected objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: Technical Reports ; TR-1996-011

Classification: Informatik

Keyword: Join-Operation ; Baum ; NP-hartes Problem

Event: Veröffentlichung

(where): Mannheim

(who): Universitätsbibliothek Mannheim

(when): 1996

Creator: Moerkotte, Guido
Scheufele, Wolfgang

URN: urn:nbn:de:bsz:180-madoc-7958

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 25.03.2025, 1:47 PM CET

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Moerkotte, Guido
Scheufele, Wolfgang
Universitätsbibliothek Mannheim

Time of origin

1996

Other Objects (12)

Functions computable with nonadaptive queries to NP

zweidimensionales bewegtes Bild

Automating Resolution is NP-Hard

Robust Geometric Programming is co-NP hard

Disk Scheduling for Intermediate Results of Large Join Queries in Shared-Disk Parallel Database Systems

Hochschulschrift

NP-hard networking problems : exact and approximate algorithms

Leveraging Path Structures in NP-hard Graph Problems

Graffiti | Streetart

join

Approximating good simultaneous diophantine approximations is almost NP-hard

Deadlock-Detection in Component-Based Systems is NP-hard.

Deciding Liveness in Component-Based Systems is NP-hard

Novel Machine Learning Algorithms for NP-hard Combinatorial Problems

Graffiti | Streetart

Join Krt

Functions computable with nonadaptive queries to NP

zweidimensionales bewegtes Bild

Automating Resolution is NP-Hard

Robust Geometric Programming is co-NP hard

Disk Scheduling for Intermediate Results of Large Join Queries in Shared-Disk Parallel Database Systems

Hochschulschrift

NP-hard networking problems : exact and approximate algorithms

Leveraging Path Structures in NP-hard Graph Problems

Graffiti | Streetart

join

Approximating good simultaneous diophantine approximations is almost NP-hard

Deadlock-Detection in Component-Based Systems is NP-hard.

Deciding Liveness in Component-Based Systems is NP-hard

Novel Machine Learning Algorithms for NP-hard Combinatorial Problems

Graffiti | Streetart

Join Krt

Functions computable with nonadaptive queries to NP

zweidimensionales bewegtes Bild

Automating Resolution is NP-Hard

Robust Geometric Programming is co-NP hard

Disk Scheduling for Intermediate Results of Large Join Queries in Shared-Disk Parallel Database Systems

Hochschulschrift

NP-hard networking problems : exact and approximate algorithms

Leveraging Path Structures in NP-hard Graph Problems

Graffiti | Streetart

join

Approximating good simultaneous diophantine approximations is almost NP-hard

Deadlock-Detection in Component-Based Systems is NP-hard.

Deciding Liveness in Component-Based Systems is NP-hard

Novel Machine Learning Algorithms for NP-hard Combinatorial Problems

Graffiti | Streetart

Join Krt

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Constructing Optimal Bushy Processing Trees for Join Queries is NP-hard

Object Details

References and Relationships

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Functions computable with nonadaptive queries to NP

Automating Resolution is NP-Hard

Robust Geometric Programming is co-NP hard

Disk Scheduling for Intermediate Results of Large Join Queries in Shared-Disk Parallel Database Systems

NP-hard networking problems : exact and approximate algorithms

Leveraging Path Structures in NP-hard Graph Problems

join

Approximating good simultaneous diophantine approximations is almost NP-hard

Deadlock-Detection in Component-Based Systems is NP-hard.

Deciding Liveness in Component-Based Systems is NP-hard

Novel Machine Learning Algorithms for NP-hard Combinatorial Problems

Join Krt

Functions computable with nonadaptive queries to NP

Automating Resolution is NP-Hard

Robust Geometric Programming is co-NP hard

Disk Scheduling for Intermediate Results of Large Join Queries in Shared-Disk Parallel Database Systems

NP-hard networking problems : exact and approximate algorithms

Leveraging Path Structures in NP-hard Graph Problems

join

Approximating good simultaneous diophantine approximations is almost NP-hard

Deadlock-Detection in Component-Based Systems is NP-hard.

Deciding Liveness in Component-Based Systems is NP-hard

Novel Machine Learning Algorithms for NP-hard Combinatorial Problems

Join Krt

Functions computable with nonadaptive queries to NP

Automating Resolution is NP-Hard

Robust Geometric Programming is co-NP hard

Disk Scheduling for Intermediate Results of Large Join Queries in Shared-Disk Parallel Database Systems

NP-hard networking problems : exact and approximate algorithms

Leveraging Path Structures in NP-hard Graph Problems

join

Approximating good simultaneous diophantine approximations is almost NP-hard

Deadlock-Detection in Component-Based Systems is NP-hard.

Deciding Liveness in Component-Based Systems is NP-hard

Novel Machine Learning Algorithms for NP-hard Combinatorial Problems

Join Krt

Related objects

Reset password