Database Paper Browser

Back to papers

A Dynamic Clustering Technique For Physical Database Design

Summary: Dynamic clustering reframed as partitioning of attribute space, directed by a discriminator sequence and analyzed partition count. Extended K-d tree directs partitioning; results show gains vs single-attribute clustering and inverted-file methods. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2135
Venue
SIGMOD
Year
1980
Pagerank
0.00010803302
Overall Rank
1,707 | 88.14%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
123 A Decomposition Storage Model 1985 SIGMOD 0.00045235743
3,065 Query Processing Method for Multi-Attribute Clustered Relations 1990 VLDB 7.6258862e-05
6,473 Efficient Search of Multidimensional B-Trees 1995 VLDB 5.0427056e-05
13,029 MULTIKEY RETRIEVAL from K-d TREES and QUAD-TREES 1985 SIGMOD 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

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

Semantically Similar Papers