B+ tree (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "B+ tree" in English language version.

refsWebsite

Global rank English rank

6doi.org

2^nd place

4web.archive.org

1^st place

3semanticscholar.org

11^th place

8^th place

3worldcat.org

5^th place

2acm.org

1,185^th place

840^th place

1helsinki.fi

1,670^th place

2,355^th place

1uni-tuebingen.de

8,201^st place

low place

1kb.se

564^th place

1,445^th place

1ucdavis.edu

1,873^rd place

1,347^th place

1nobius.org

low place

1apple.com

67^th place

64^th place

1sqlite.org

low place

1couchdb.org

low place

11978th.net

low place

1ieee.org

652^nd place

515^th place

1978th.net

Tokyo Cabinet reference Archived September 12, 2009, at the Wayback Machine

acm.org

dl.acm.org

Bayer, R.; McCreight, E. (November 1970). "Organization and maintenance of large ordered indices". Proceedings of the 1970 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control - SIGFIDET '70. pp. 107–141. doi:10.1145/1734663.1734671. ISBN 978-1-4503-7941-0.
Jagadish, H. V.; Ooi, Beng Chin; Tan, Kian-Lee; Yu, Cui; Zhang, Rui (June 2005). "iDistance: An adaptive B+-tree based indexing method for nearest neighbor search". ACM Transactions on Database Systems. 30 (2): 364–397. doi:10.1145/1071610.1071612. ISSN 0362-5915. S2CID 967678.

apple.com

developer.apple.com

"B-Trees". Apple File System Reference (PDF). Apple Inc. 2020-06-22. p. 122. Retrieved 2021-03-10.

couchdb.org

guide.couchdb.org

CouchDB Guide (see note after 3rd paragraph)

doi.org

Bayer, R.; McCreight, E. (November 1970). "Organization and maintenance of large ordered indices". Proceedings of the 1970 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control - SIGFIDET '70. pp. 107–141. doi:10.1145/1734663.1734671. ISBN 978-1-4503-7941-0.
Comer, Douglas (1979). "Ubiquitous B-Tree". ACM Computing Surveys. 11 (2): 121–137. doi:10.1145/356770.356776. S2CID 101673.
Zeitler, Erik; Risch, Tore (2010). "Scalable Splitting of Massive Data Streams". Database Systems for Advanced Applications. Lecture Notes in Computer Science. Vol. 5982. pp. 184–198. doi:10.1007/978-3-642-12098-5_15. ISBN 978-3-642-12097-8.
Xu, Chang; Shou, Lidan; Chen, Gang; Yan, Cheng; Hu, Tianlei (2010). "Update Migration: An Efficient B+ Tree for Flash Storage". Database Systems for Advanced Applications. Lecture Notes in Computer Science. Vol. 5982. pp. 276–290. doi:10.1007/978-3-642-12098-5_22. ISBN 978-3-642-12097-8.
Jagadish, H. V.; Ooi, Beng Chin; Tan, Kian-Lee; Yu, Cui; Zhang, Rui (June 2005). "iDistance: An adaptive B+-tree based indexing method for nearest neighbor search". ACM Transactions on Database Systems. 30 (2): 364–397. doi:10.1145/1071610.1071612. ISSN 0362-5915. S2CID 967678.
Dharamjeet; Chen, Tseng-Yi; Chang, Yuan-Hao; Wu, Chun-Feng; Lee, Chi-Heng; Shih, Wei-Kuan (December 2021). "Beyond Write-Reduction Consideration: A Wear-Leveling-Enabled B⁺-Tree Indexing Scheme Over an NVRAM-Based Architecture". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 40 (12): 2455–2466. doi:10.1109/TCAD.2021.3049677. ISSN 0278-0070. S2CID 234157183.

helsinki.fi

cs.helsinki.fi

Pollari-Malmi, Kerttu. ""B+ trees"" (PDF). Computer Science, Faculty of Science, University of Helsinki. p. 3. Archived from the original (PDF) on 2021-04-14.

ieee.org

ieeexplore.ieee.org

Dharamjeet; Chen, Tseng-Yi; Chang, Yuan-Hao; Wu, Chun-Feng; Lee, Chi-Heng; Shih, Wei-Kuan (December 2021). "Beyond Write-Reduction Consideration: A Wear-Leveling-Enabled B⁺-Tree Indexing Scheme Over an NVRAM-Based Architecture". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 40 (12): 2455–2466. doi:10.1109/TCAD.2021.3049677. ISSN 0278-0070. S2CID 234157183.

kb.se

urn.kb.se

Zeitler, Erik; Risch, Tore (2010). "Scalable Splitting of Massive Data Streams". Database Systems for Advanced Applications. Lecture Notes in Computer Science. Vol. 5982. pp. 184–198. doi:10.1007/978-3-642-12098-5_15. ISBN 978-3-642-12097-8.

nobius.org

Giampaolo, Dominic (1999). Practical File System Design with the Be File System (PDF). Morgan Kaufmann. ISBN 1-55860-497-9. Archived from the original (PDF) on 2017-02-13. Retrieved 2014-07-29.

semanticscholar.org

api.semanticscholar.org

Comer, Douglas (1979). "Ubiquitous B-Tree". ACM Computing Surveys. 11 (2): 121–137. doi:10.1145/356770.356776. S2CID 101673.
Jagadish, H. V.; Ooi, Beng Chin; Tan, Kian-Lee; Yu, Cui; Zhang, Rui (June 2005). "iDistance: An adaptive B+-tree based indexing method for nearest neighbor search". ACM Transactions on Database Systems. 30 (2): 364–397. doi:10.1145/1071610.1071612. ISSN 0362-5915. S2CID 967678.
Dharamjeet; Chen, Tseng-Yi; Chang, Yuan-Hao; Wu, Chun-Feng; Lee, Chi-Heng; Shih, Wei-Kuan (December 2021). "Beyond Write-Reduction Consideration: A Wear-Leveling-Enabled B⁺-Tree Indexing Scheme Over an NVRAM-Based Architecture". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 40 (12): 2455–2466. doi:10.1109/TCAD.2021.3049677. ISSN 0278-0070. S2CID 234157183.

sqlite.org

SQLite Version 3 Overview

ucdavis.edu

web.cs.ucdavis.edu

"ECS 165B: Database System Implementation Lecture 6" (PDF). UC Davis CS department. April 9, 2010. pp. 21–23.

uni-tuebingen.de

db.inf.uni-tuebingen.de

Grust, Torsten (Summer 2013). ""Tree-Structured Indexing: ISAM and B+-trees"" (PDF). Logo der Universität Tübingen Department of Computer Science: Database Systems. p. 84. Archived from the original (PDF) on 2020-10-31.

web.archive.org

Pollari-Malmi, Kerttu. ""B+ trees"" (PDF). Computer Science, Faculty of Science, University of Helsinki. p. 3. Archived from the original (PDF) on 2021-04-14.
Grust, Torsten (Summer 2013). ""Tree-Structured Indexing: ISAM and B+-trees"" (PDF). Logo der Universität Tübingen Department of Computer Science: Database Systems. p. 84. Archived from the original (PDF) on 2020-10-31.
Giampaolo, Dominic (1999). Practical File System Design with the Be File System (PDF). Morgan Kaufmann. ISBN 1-55860-497-9. Archived from the original (PDF) on 2017-02-13. Retrieved 2014-07-29.
Tokyo Cabinet reference Archived September 12, 2009, at the Wayback Machine

worldcat.org

search.worldcat.org

Ramakrishnan, Raghu; Johannes Gehrke (2003). Database management systems (3rd ed.). Boston: McGraw-Hill. ISBN 0-07-246563-8. OCLC 49977005.
Jagadish, H. V.; Ooi, Beng Chin; Tan, Kian-Lee; Yu, Cui; Zhang, Rui (June 2005). "iDistance: An adaptive B+-tree based indexing method for nearest neighbor search". ACM Transactions on Database Systems. 30 (2): 364–397. doi:10.1145/1071610.1071612. ISSN 0362-5915. S2CID 967678.
Dharamjeet; Chen, Tseng-Yi; Chang, Yuan-Hao; Wu, Chun-Feng; Lee, Chi-Heng; Shih, Wei-Kuan (December 2021). "Beyond Write-Reduction Consideration: A Wear-Leveling-Enabled B⁺-Tree Indexing Scheme Over an NVRAM-Based Architecture". IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 40 (12): 2455–2466. doi:10.1109/TCAD.2021.3049677. ISSN 0278-0070. S2CID 234157183.