The Common Prefix Problem On Trees
Sreyash Kenkre, Sundar Vishwanathan
TL;DR
This paper investigates the Common Prefix Problem on trees, providing a near-optimal approximation algorithm for binary trees and proving hardness of approximation even on star graphs, relevant for database query optimization.
Contribution
It introduces a $(1-o(1))$ approximation algorithm for binary trees and establishes hardness results for the problem on star graphs, advancing theoretical understanding.
Findings
Approximation algorithm with factor $(1-o(1))$ for binary trees.
Hardness of approximation results for star graphs.
Relevance to database query optimization.
Abstract
We present a theoretical study of a problem arising in database query optimization, which we call as The Common Prefix Problem. We present a 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Algorithms and Data Compression · Complexity and Algorithms in Graphs