Minimum leaf spanning tree

Details Minimum leaf spanning tree Minimum leaf spanning tree

1998-03-26

2000-08-15

Black, Thomas G.

Data processing: database and file management or data structures

Database design

Data structure types

707 5, 707 4, 707 3, 707 1, G06F 1730

Patent

active

061050180

ABSTRACT:
An efficient set of indexes to cover a plurality of anticipated query types is determined by building a directed acyclic graph whose nodes correspond to anticipated query types. A minimum leaf spanning tree for the equivalent graph is determined by repeatedly finding an augmenting path for a current spanning tree and producing a reduced leaf spanning tree based on the current spanning tree and the augmenting path until an augmenting path can no longer be found. The leaves of the minimum leaf spanning tree indicate which indexes should be built.

REFERENCES:
patent: 5701467 (1997-12-01), Freeston
patent: 5781906 (1998-07-01), Aggarwal et al.
patent: 6006233 (1999-12-01), Schultz
CRC Dictionary of of Computer Science, Engineering and Technology, Mar. 2000.

Affiliated with

Also associated with

Rating

Minimum leaf spanning tree does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Minimum leaf spanning tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum leaf spanning tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2018209