Database Paper Browser

Back to papers

B+ Trees and Indexed Sequential Files: A Performance Comparison

Summary: Analytic model compares B+ trees and indexed sequential files (ISFs) performance. Preliminary results suggest ISFs can outperform B+ trees in some workloads, highlighting application-specific choice beyond conventional tree indexing. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2141
Venue
SIGMOD
Year
1981
Pagerank
-
Overall Rank
14,356 | 0.23%
DOI
-

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

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
7,703 Efficient B-tree Based Indexing for Cloud Data Processing 2010 VLDB 5.6217522e-05
13,086 Experiments With B-Tree Reorganization 1980 SIGMOD 5.1725247e-05
14,362 Multi-Table Search For B-Tree Files 1979 SIGMOD -
1,517 BF-Tree: Approximate Tree Indexing 2014 VLDB 0.00010572807
8,580 Adaptive Index Structures 2002 VLDB 5.4685936e-05
6,958 Making In-Memory Learned Indexes Efficient on Disk 2024 SIGMOD 5.7990776e-05
9,405 Revisiting B-tree Compression: An Experimental Study 2024 SIGMOD 5.3341661e-05
1,047 On B-tree Indices for Skewed Distributions 1992 VLDB 0.00012541017
14,292 An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees 1984 SIGMOD -
14,296 Performance Comparison Of Index Structures For Multi-Key Retrieval 1984 SIGMOD -