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

8doi.org

2^nd place

8semanticscholar.org

11^th place

8^th place

3usc.edu

1,077^th place

761^st place

3worldcat.org

5^th place

3web.archive.org

1^st place

3archive.org

6^th place

2ghostarchive.org

32^nd place

21^st place

2lwn.net

4,423^rd place

2,925^th place

1vimeo.com

1,015^th place

717^th place

1stanford.edu

179^th place

183^rd place

1elpub.ru

low place

1greenend.org.uk

low place

1seagate.com

low place

1academia.edu

121^st place

142^nd place

1alexdelis.eu

low place

1rhodes.edu

low place

1sunysb.edu

9,785^th place

9,347^th place

1microsoft.com

153^rd place

151^st place

1dragonflybsd.org

low place

1dtic.mil

833^rd place

567^th place

1github.com

383^rd place

320^th place

1freepatentsonline.com

5,449^th place

3,875^th place

1kernel.org

4,558^th place

3,044^th place

academia.edu

Kleppmann, Martin (2017). Designing Data-Intensive Applications. Sebastopol, California: O'Reilly Media. p. 80. ISBN 978-1-449-37332-0.

alexdelis.eu

Jan Jannink. "Implementing Deletion in B+-Trees". Section "4 Lazy Deletion".

archive.org

Folk & Zoellick 1992, p. 362. Folk, Michael J.; Zoellick, Bill (1992). File Structures (2nd ed.). Addison-Wesley. ISBN 0-201-55713-4..
Folk & Zoellick 1992, p. 363. Folk, Michael J.; Zoellick, Bill (1992). File Structures (2nd ed.). Addison-Wesley. ISBN 0-201-55713-4..
Folk & Zoellick 1992, p. 379. Folk, Michael J.; Zoellick, Bill (1992). File Structures (2nd ed.). Addison-Wesley. ISBN 0-201-55713-4..

doi.org

Bayer, R.; McCreight, E. (July 1970). "Organization and maintenance of large ordered indices" (PDF). Proceedings of the 1970 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control - SIGFIDET '70. Boeing Scientific Research Laboratories. p. 107. doi:10.1145/1734663.1734671. S2CID 26930249.
Comer 1979. Comer, Douglas (June 1979). "The Ubiquitous B-Tree". Computing Surveys. 11 (2): 123–137. doi:10.1145/356770.356776. ISSN 0360-0300. S2CID 101673..
Bayer & McCreight 1972. Bayer, R.; McCreight, E. (1972). "Organization and Maintenance of Large Ordered Indexes" (PDF). Acta Informatica. 1 (3): 173–189. doi:10.1007/bf00288683. S2CID 29859053..
Comer 1979, p. 123 footnote 1. Comer, Douglas (June 1979). "The Ubiquitous B-Tree". Computing Surveys. 11 (2): 123–137. doi:10.1145/356770.356776. ISSN 0360-0300. S2CID 101673..
Bayer & McCreight (1972) avoided the issue by saying an index element is a (physically adjacent) pair of (x, a) where x is the key, and a is some associated information. The associated information might be a pointer to a record or records in a random access, but what it was didn't really matter. Bayer & McCreight (1972) states, "For this paper the associated information is of no further interest." Bayer, R.; McCreight, E. (1972). "Organization and Maintenance of Large Ordered Indexes" (PDF). Acta Informatica. 1 (3): 173–189. doi:10.1007/bf00288683. S2CID 29859053.. Bayer, R.; McCreight, E. (1972). "Organization and Maintenance of Large Ordered Indexes" (PDF). Acta Informatica. 1 (3): 173–189. doi:10.1007/bf00288683. S2CID 29859053..
Rigin A. M., Shershakov S. A. (2019-09-10). "SQLite RDBMS Extension for Data Indexing Using B-tree Modifications". Proceedings of the Institute for System Programming of the RAS. 31 (3). Institute for System Programming of the RAS (ISP RAS): 203–216. doi:10.15514/ispras-2019-31(3)-16. S2CID 203144646. Retrieved 2021-08-29.
Comer 1979, p. 127; Cormen et al. 2001, pp. 439–440 Comer, Douglas (June 1979). "The Ubiquitous B-Tree". Computing Surveys. 11 (2): 123–137. doi:10.1145/356770.356776. ISSN 0360-0300. S2CID 101673.. Cormen, Thomas; Leiserson, Charles; Rivest, Ronald; Stein, Clifford (2001). Introduction to Algorithms (Second ed.). MIT Press and McGraw-Hill. pp. 434–454. ISBN 0-262-03293-7. Chapter 18: B-Trees.
Lehman, Philip L.; Yao, s. Bing (1981). "Efficient locking for concurrent operations on B-trees". ACM Transactions on Database Systems. 6 (4): 650–670. doi:10.1145/319628.319663. S2CID 10756181.

dragonflybsd.org

Matthew Dillon (2008-06-21). "The HAMMER Filesystem" (PDF). Archived (PDF) from the original on 2022-10-09.

dtic.mil

Wang, Paul (1 February 1991). "An In-Depth Analysis of Concurrent B-tree Algorithms" (PDF). dtic.mil. Archived from the original (PDF) on 4 June 2011. Retrieved 21 October 2022.

elpub.ru

ispranproceedings.elpub.ru

Rigin A. M., Shershakov S. A. (2019-09-10). "SQLite RDBMS Extension for Data Indexing Using B-tree Modifications". Proceedings of the Institute for System Programming of the RAS. 31 (3). Institute for System Programming of the RAS (ISP RAS): 203–216. doi:10.15514/ispras-2019-31(3)-16. S2CID 203144646. Retrieved 2021-08-29.

freepatentsonline.com

"Lockless concurrent B-tree index meta access method for cached nodes".

ghostarchive.org

"Deletion in a B-tree" (PDF). cs.rhodes.edu. Archived (PDF) from the original on 2022-10-09. Retrieved 24 May 2022.
Matthew Dillon (2008-06-21). "The HAMMER Filesystem" (PDF). Archived (PDF) from the original on 2022-10-09.

github.com

"Downloads - high-concurrency-btree - High Concurrency B-Tree code in C - GitHub Project Hosting". GitHub. Retrieved 2014-01-27.

greenend.org.uk

chiark.greenend.org.uk

Counted B-Trees, retrieved 2010-01-25

kernel.org

docs.kernel.org

Maple Tree (The Linux Kernel documentation)

lwn.net

microsoft.com

msdn2.microsoft.com

Mark Russinovich (30 June 2006). "Inside Win2K NTFS, Part 1". Microsoft Developer Network. Archived from the original on 13 April 2008. Retrieved 2008-04-18.

rhodes.edu

cs.rhodes.edu

"Deletion in a B-tree" (PDF). cs.rhodes.edu. Archived (PDF) from the original on 2022-10-09. Retrieved 24 May 2022.

seagate.com

Product Manual: Barracuda ES.2 Serial ATA, Rev. F., publication 100468393 (PDF). Seagate Technology LLC. 2008. p. 6.

semanticscholar.org

api.semanticscholar.org

Bayer, R.; McCreight, E. (July 1970). "Organization and maintenance of large ordered indices" (PDF). Proceedings of the 1970 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control - SIGFIDET '70. Boeing Scientific Research Laboratories. p. 107. doi:10.1145/1734663.1734671. S2CID 26930249.
Comer 1979. Comer, Douglas (June 1979). "The Ubiquitous B-Tree". Computing Surveys. 11 (2): 123–137. doi:10.1145/356770.356776. ISSN 0360-0300. S2CID 101673..
Bayer & McCreight 1972. Bayer, R.; McCreight, E. (1972). "Organization and Maintenance of Large Ordered Indexes" (PDF). Acta Informatica. 1 (3): 173–189. doi:10.1007/bf00288683. S2CID 29859053..
Comer 1979, p. 123 footnote 1. Comer, Douglas (June 1979). "The Ubiquitous B-Tree". Computing Surveys. 11 (2): 123–137. doi:10.1145/356770.356776. ISSN 0360-0300. S2CID 101673..
Bayer & McCreight (1972) avoided the issue by saying an index element is a (physically adjacent) pair of (x, a) where x is the key, and a is some associated information. The associated information might be a pointer to a record or records in a random access, but what it was didn't really matter. Bayer & McCreight (1972) states, "For this paper the associated information is of no further interest." Bayer, R.; McCreight, E. (1972). "Organization and Maintenance of Large Ordered Indexes" (PDF). Acta Informatica. 1 (3): 173–189. doi:10.1007/bf00288683. S2CID 29859053.. Bayer, R.; McCreight, E. (1972). "Organization and Maintenance of Large Ordered Indexes" (PDF). Acta Informatica. 1 (3): 173–189. doi:10.1007/bf00288683. S2CID 29859053..
Rigin A. M., Shershakov S. A. (2019-09-10). "SQLite RDBMS Extension for Data Indexing Using B-tree Modifications". Proceedings of the Institute for System Programming of the RAS. 31 (3). Institute for System Programming of the RAS (ISP RAS): 203–216. doi:10.15514/ispras-2019-31(3)-16. S2CID 203144646. Retrieved 2021-08-29.
Comer 1979, p. 127; Cormen et al. 2001, pp. 439–440 Comer, Douglas (June 1979). "The Ubiquitous B-Tree". Computing Surveys. 11 (2): 123–137. doi:10.1145/356770.356776. ISSN 0360-0300. S2CID 101673.. Cormen, Thomas; Leiserson, Charles; Rivest, Ronald; Stein, Clifford (2001). Introduction to Algorithms (Second ed.). MIT Press and McGraw-Hill. pp. 434–454. ISBN 0-262-03293-7. Chapter 18: B-Trees.
Lehman, Philip L.; Yao, s. Bing (1981). "Efficient locking for concurrent operations on B-trees". ACM Transactions on Database Systems. 6 (4): 650–670. doi:10.1145/319628.319663. S2CID 10756181.

stanford.edu

scpd.stanford.edu

"Stanford Center for Professional Development". scpd.stanford.edu. Archived from the original on 2014-06-04. Retrieved 2011-01-16.

sunysb.edu

cs.sunysb.edu

"Cache Oblivious B-trees". State University of New York (SUNY) at Stony Brook. Retrieved 2011-01-17.

usc.edu

infolab.usc.edu

Bayer, R.; McCreight, E. (July 1970). "Organization and maintenance of large ordered indices" (PDF). Proceedings of the 1970 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control - SIGFIDET '70. Boeing Scientific Research Laboratories. p. 107. doi:10.1145/1734663.1734671. S2CID 26930249.
Bayer & McCreight 1972. Bayer, R.; McCreight, E. (1972). "Organization and Maintenance of Large Ordered Indexes" (PDF). Acta Informatica. 1 (3): 173–189. doi:10.1007/bf00288683. S2CID 29859053..
Bayer & McCreight (1972) avoided the issue by saying an index element is a (physically adjacent) pair of (x, a) where x is the key, and a is some associated information. The associated information might be a pointer to a record or records in a random access, but what it was didn't really matter. Bayer & McCreight (1972) states, "For this paper the associated information is of no further interest." Bayer, R.; McCreight, E. (1972). "Organization and Maintenance of Large Ordered Indexes" (PDF). Acta Informatica. 1 (3): 173–189. doi:10.1007/bf00288683. S2CID 29859053.. Bayer, R.; McCreight, E. (1972). "Organization and Maintenance of Large Ordered Indexes" (PDF). Acta Informatica. 1 (3): 173–189. doi:10.1007/bf00288683. S2CID 29859053..

vimeo.com

Weiner, Peter G. (30 August 2013). "4- Edward M McCreight" – via Vimeo.

web.archive.org

"Stanford Center for Professional Development". scpd.stanford.edu. Archived from the original on 2014-06-04. Retrieved 2011-01-16.
Mark Russinovich (30 June 2006). "Inside Win2K NTFS, Part 1". Microsoft Developer Network. Archived from the original on 13 April 2008. Retrieved 2008-04-18.
Wang, Paul (1 February 1991). "An In-Depth Analysis of Concurrent B-tree Algorithms" (PDF). dtic.mil. Archived from the original (PDF) on 4 June 2011. Retrieved 21 October 2022.

worldcat.org

Comer 1979. Comer, Douglas (June 1979). "The Ubiquitous B-Tree". Computing Surveys. 11 (2): 123–137. doi:10.1145/356770.356776. ISSN 0360-0300. S2CID 101673..
Comer 1979, p. 123 footnote 1. Comer, Douglas (June 1979). "The Ubiquitous B-Tree". Computing Surveys. 11 (2): 123–137. doi:10.1145/356770.356776. ISSN 0360-0300. S2CID 101673..
Comer 1979, p. 127; Cormen et al. 2001, pp. 439–440 Comer, Douglas (June 1979). "The Ubiquitous B-Tree". Computing Surveys. 11 (2): 123–137. doi:10.1145/356770.356776. ISSN 0360-0300. S2CID 101673.. Cormen, Thomas; Leiserson, Charles; Rivest, Ronald; Stein, Clifford (2001). Introduction to Algorithms (Second ed.). MIT Press and McGraw-Hill. pp. 434–454. ISBN 0-262-03293-7. Chapter 18: B-Trees.