DBScholar

Back to papers

Storing Matrices on Disk: Theory and Practice Revisited

Summary: Proposes Linearized Array B-tree (LAB-tree) for on-disk matrices with flexible layouts that adapt to sparsity patterns across portions of an array and over time. Revisits B-tree insert/split strategies and flushing policies, proposing theoretically guaranteed and empirically strong alternatives for scalable matrix storage. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10362
Venue
VLDB
Year
2011
Pagerank
5.2528121e-05
Overall Rank
9,580 | 34.28%
DOI
10.14778/3402707.3402743

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{zhang_vldb11,
        title = {{Storing Matrices on Disk: Theory and Practice Revisited}},
        author = {Zhang, Yi and Munagala, Kamesh and Yang, Jun},
        journal = {PVLDB},
        series = {{VLDB} '11},
        volume = {4},
        number = {11},
        pages = {1075--1086},
        doi = {10.14778/3402707.3402743},
        url = {https://doi.org/10.14778/3402707.3402743},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 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