Atomic-key B-trees

• Autorzy: Drozdek A. , Vujanović D.
• Języki publikacji: EN

Abstrakty

EN

Atomic-key B-trees are B-trees with keys of different sizes. This note presents two versions of an insertion algorithm and a deletion algorithm for atomic-key B-trees.

Słowa kluczowe

EN

atomic-key B-tree; data structures; database management

• Wydawca: Wydawnictwo Uniwersytetu Przyrodniczo-Humanistycznego w Siedlcach
• Czasopismo: Studia Informatica : systems and information technology
• Rocznik: 2015
• Tom: Vol. 1-2(19)
• Strony: 15--26
• Opis fizyczny: Bibliogr. 5 poz., rys., tab.

Twórcy

autor

Drozdek A.

• Duquesne University, Department of Mathematics and Computer Science, Pittsburgh, PA 15282, USA

autor

Vujanović D.

• Duquesne University, Department of Mathematics and Computer Science, Pittsburgh, PA 15282, USA

Bibliografia

• 1. Bender M.A., Hu H., Kuszmaul B.C., Performance guarantees for B-trees with different-sized atomic keys, Proceedings of the 29th ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems (PODS), New York, ACM 2010, pp. 305-316.
• 2. Drozdek A., Data structures and algorithms in C++, Boston, Cengage Learning 2013.
• 3. Ferragina P., Grossi R., The string B-tree: A new data structure for string search in external memory and its applications, Journal of the ACM 46 (1999), pp. 1-46.
• 4. Hu H., Cache-oblivious data structures for massive data sets, PhD diss., New York, Stony Brook University 2007.
• 5. Na J.Ch., Park K., Simple implementation of string B-trees, in: Apostolico A., Melucci M. (eds.), String Processing and Information Retrieval, Berlin, Springer 2004, pp. 214--215.