The Common Prefix Problem On Trees

Details The Common Prefix Problem On Trees The Common Prefix Problem On Trees

2006-12-11

arxiv.org/abs/cs/0612060v1

Computer Science

Data Structures and Algorithms

8 pages

Scientific paper

We present a theoretical study of a problem arising in database query
optimization, which we call as The Common Prefix Problem. We present a
$(1-o(1))$ factor approximation algorithm for this problem, when the underlying
graph is a binary tree. We then use a result of Feige and Kogan to show that
even on stars, the problem is hard to approximate.

Affiliated with

Also associated with

No associations

Rating

The Common Prefix Problem On Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Common Prefix Problem On Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Common Prefix Problem On Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-182930