Database Paper Browser

Back to papers

Fast Search-By-Classification for Large-Scale Databases Using Index-Aware Decision Trees and Random Forests

Summary: Index-aware construction of decision trees and random forests that produces leaf predicates as axis-aligned hyperrectangles, turning inference into multidimensional range queries executed via existing indexes. Enables interactive search-by-classification over hundreds of millions of records in seconds without full scans. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13127
Venue
VLDB
Year
2023
Pagerank
4.1945683e-05
Overall Rank
11,251 | 21.73%
DOI
10.14778/3611479.3611492

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 6 of 6 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers