Database Paper Browser

Back to papers

A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix

Summary: Presents a linear-time algorithm for optimal partitioning of an ordered, weighted tree into fixed-capacity partitions, enabling adjacent siblings to share a partition (sibling partitioning). Also provides memory-light near-optimal heuristics; experiments show >90% fewer partitions and >2× faster queries than parent–child-only partitioning. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9503
Venue
VLDB
Year
2006
Pagerank
4.1945683e-05
Overall Rank
12,523 | 12.88%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
98 XMark: A Benchmark for XML Data Management 2002 VLDB 0.00050023808
1,893 On the Performance of Object Clustering Techniques 1992 SIGMOD 0.00010184132
2,069 System RX: One Part Relational, One Part XML 2005 SIGMOD 9.6329563e-05
Previous Page 1 / 1 Next

Semantically Similar Papers