Evaluation of B+-Tree and CSB+-Tree in Main Memory Database

Feng Dong Sun; Lan Wang

doi:10.4028/www.scientific.net/AMM.571-572.580

Paper Titles

Software Vulnerabilities Detection Based on Random Programming
p.553

Research on Tibetan Localization Based on Android
p.559

The Selection and Study of HA Cluster Software Design
p.567

Efficiently Subtree Matching between XML and Probabilistic XML Documents
p.575

Evaluation of B+-Tree and CSB+-Tree in Main Memory Database
p.580

Oracle Database Security and Protection
p.586

Research and Implementation of Relational Database Encryption Technology Based on Main Memory Database
p.591

Research on the Spatial Query Technology of Geospatial Database
p.600

Study on Fair Definitions and Application Modes of Big Data
p.606

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 571-572Evaluation of B+-Tree and CSB+-Tree in Main Memory...

Evaluation of B+-Tree and CSB+-Tree in Main Memory Database

Abstract:

Index is indispensable in database system to speeding up data access. Commonly used indexes in main memory databases are B+-Tree, T-Tree and their variants. Cost model of main memory database are more complex than disk-oriental database, and relatively little work has been done on this area. This paper establishes a cost model for B+-Tree and CSB+-Tree, analyzes their main performance factors. We perform several experiment evaluations on the cost model.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 571-572)

Pages:

580-585

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.571-572.580

Citation:

Cite this paper

Online since:

June 2014

Authors:

Feng Dong Sun, Lan Wang

Keywords:

B+-Tree, Cache Sensitive, Cost Mode, CSB+-Tree, Main Memory Database

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Lehman Tobin J et al. A study of index structures for main memory database management systems[C]. Proceedings of the 12th VLDB Conference, Kyoto, Japan, 1986: 294-303.

Google Scholar

[2] Rao Jun, Ross Kenneth A. Making B+-Trees cache conscious in main memory[C]. Proceedings of the 2000 ACM SIGMOD international Conference on Management of Data, Dallas, Texas, USA, 2000: 475-486.

DOI: 10.1145/335191.335449

Google Scholar

[3] Lee lg-Hoon, Shim Junho et al. CST-trees: Cache sensitive T-trees[C]. Proceedings of the 12th International Conference on Database Systems for Advanced Applications, Bangkok, Thailand. 2007: 398-409.

DOI: 10.1007/978-3-540-71703-4_35

Google Scholar

[4] Shan Wang, Yanqin Xiao . Research of main memory database[J]，Computer Application Oct. 2007, vol 27, No. 10 2353-2357, In Chinese.

Google Scholar

[5] Rao Jun, Ross Kenneth A. Making B+-Trees cache conscious in main memory[C]. Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. Dallas, Texas, USA, 2000: 475-486.

DOI: 10.1145/335191.335449

Google Scholar

[6] Rao Jun, Ross Kenneth A. Cache conscious indexing for decision-support in main memory[C]. Proceedings of the 25th VLDB Conference, Edinburgh. Scotland, U K, 1999: 78-89.

Google Scholar

[7] Lee lg-Hoon, Jae-won Lee. Cache Conscious Trees on Mordern Microprocessors[C], Proceedings of the 4th International Conference on Ubiquitous Information Management and Communication, ICUIMC 2010, Suwon, Republic of Korea, January 14-15, (2010).

DOI: 10.1145/2108616.2108668

Google Scholar