Database Paper Browser

Back to papers

Database-friendly Random Projections

Summary: Replaces classic JL random hyperplane projection with a DB-friendly construction computing k simple aggregates over random attribute partitions. Preserves JL dimensionality guarantees (k = O(log n)) while enabling implementation via standard relational/aggregation operators. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1243
Venue
PODS
Year
2001
Pagerank
6.8484436e-05
Overall Rank
3,682 | 74.39%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
428 Latent Semantic Indexing: A Probabilistic Analysis 1998 PODS 0.00023512226
Previous Page 1 / 1 Next

Semantically Similar Papers