Database Paper Browser

Back to papers

On the Optimality of Clustering Properties of Space Filling Curves

Summary: Characterizes the clustering number (average count of contiguous curve segments per query region) for a broad class of space‑filling curves and proves the first non‑trivial lower bounds on clustering. Resolves Jagadish's 1997 open problem on SFC optimality. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1579
Venue
PODS
Year
2012
Pagerank
5.2424347e-05
Overall Rank
5,990 | 58.33%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
216 A Class of Data Structures for Associative Searching 1984 PODS 0.00033542705
2,485 Multiattribute Hashing Using Gray Codes. 1986 SIGMOD 8.6800526e-05
Previous Page 1 / 1 Next

Semantically Similar Papers