Database Paper Browser

Back to papers

A Novel Index Supporting High Volume Data Warehouse Insertions

Summary: Y-tree, a novel index for high-volume data warehouse insertions, supports single-attribute point and range queries with retrieval comparable to B+-tree. Insertion speedups up to 100× over batched B+-tree mitigate disk-seek bottlenecks in million-per-day workloads. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8568
Venue
VLDB
Year
1999
Pagerank
8.8946187e-05
Overall Rank
2,391 | 83.39%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Rank Citing Paper Year Venue Pagerank
562 Tree Indexing on Solid State Drives 2010 VLDB 0.00020035385
1,195 Buffering Accesses to Memory-Resident Index Structures 2003 VLDB 0.00013404419
1,472 Online Maintenance of Very Large Random Samples on Flash Storage 2008 VLDB 0.00011798842
1,524 Sorting And Indexing With Partitioned B-Trees 2003 CIDR 0.00011509464
4,032 Spatial Online Sampling and Aggregation 2016 VLDB 6.5131946e-05
5,294 An Evaluation of Generic Bulk Loading Techniques 2001 VLDB 5.5777973e-05
8,764 Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes 2009 PODS 4.4520434e-05
11,772 Write-Optimized Skip Lists 2017 PODS 4.1905499e-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.

Rank Cited Paper Year Venue Pagerank
121 Improved Query Performance with Variant Indexes 1997 SIGMOD 0.00045429472
1,071 Incremental Organization for Data Recording and Warehousing 1997 VLDB 0.00014265647
Previous Page 1 / 1 Next

Semantically Similar Papers