Database Paper Browser

Back to papers

Efficient Search in Very Large Databases

Summary: Novel data structuring enables efficient branch-and-bound search in very large databases; pruning reduces the search space with modest storage overhead. Also enables successive-approximation results, lowering total search cost. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7870
Venue
VLDB
Year
1988
Pagerank
4.7953551e-05
Overall Rank
7,226 | 49.74%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
4,852 Distributed Transitive Closure Computations: The Disconnection Set Approach 1990 VLDB 5.8764777e-05
5,756 Query Processing for Distance Metrics 1990 VLDB 5.3401202e-05
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.

Previous Page 1 / 1 Next

Semantically Similar Papers