DBScholar

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
1242
Venue
PODS
Year
2001
Pagerank
7.1736703e-05
Overall Rank
3,721 | 74.48%
DOI
10.1145/375551.375608

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{achlioptas_pods01,
        address = {New York, NY, USA},
        series = {{PODS} '01},
        title = {{Database-friendly Random Projections}},
        url = {https://dl.acm.org/doi/10.1145/375551.375608},
        doi = {10.1145/375551.375608},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Achlioptas, Dimitris},
        year = {2001}
}

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
1,119 Latent Semantic Indexing: A Probabilistic Analysis 1998 PODS 0.00012097985
Previous Page 1 / 1 Next

Semantically Similar Papers