The Research of Distributed Bitmap Index

Yu Ting Liu; Hua Min Yang

doi:10.4028/www.scientific.net/AMM.519-520.49

Paper Titles

Research on SQL Performance Optimization of CRM Stored Procedure
p.28

Design of E-Archives Portfolio System Based on Signature Technology
p.32

MLTwig: A Multi-Layer Tree Pattern Matching Approach for XQuery
p.36

Research and Implementation on Compression, Encryption, Storage and Retrieval System for Massive Data
p.41

The Research of Distributed Bitmap Index
p.49

Analysis of Distributed Computing Architecture Search Principle Based on Hadoop
p.54

Study of Network Public Opinion Classification Method Based on Naive Bayesian Algorithm in Hadoop Environment
p.58

Study on Object-Storage System Metadata Load Balancing
p.62

Research on PPHIIS Based on Ontology Model
p.66

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 519-520The Research of Distributed Bitmap Index

The Research of Distributed Bitmap Index

Abstract:

With the explosive growth of data, the performance of querying the huge amounts of data is more and more important.Simply Method of improving the performance of stand-alone already can't meet the demand.We need to handle huge amounts of data with distributed technology.However, traditional ways are just outrageous abuse of distributed resources, there are a lot of methods to improve efficiency and throughput.In terms of saving resources effectively, index is an indispensable tool.This article embarks from the traditional indexing mechanism, based on the advantage of the traditional methods in combination with the advantages of bitmap index, put forward a kind of extended local index mechanism,which is effective in reducing the traditional local indexes for distributed resources unnecessary overhead.At the same time it also improve the query efficiency. Finally, the test results show that the improved algorithm is efficient.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 519-520)

Pages:

49-53

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.519-520.49

Citation:

Cite this paper

Online since:

February 2014

Authors:

Yu Ting Liu, Hua Min Yang

Keywords:

Bitmapindex, Distributed Index, Massive Data Processing

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Jagadish H V, Ooi Beng Chin, Wu Kun-Lung, Efficient B-tree based indexing for cloud data processing/Proceedings of the VLDB. Singapore , 2010: 1207-1218.

DOI: 10.14778/1920841.1920991

Google Scholar

[2] Canahuate Guadalupe, Apaydin Tan, Sacan Ahmet and Ferbatosmanolu Hakan, Secondary bitmap indexes with vertical and horizontal partitioning/Proceedings of the EDBT. Saint Petersburg , Russia, 2009: 600-611.

DOI: 10.1145/1516360.1516430

Google Scholar

[3] Sdoghi Mohammad, Jacobsen Hans-Arno. B-tree: An index structure to efficiently match boolean expressions over high-dimensional discrete space. /Proceedings of the SIGMOD Conference. Athns, Greece, 2011: 637-648.

DOI: 10.1145/1989323.1989390

Google Scholar

[4] Li HuaZhi: Massive database solution[M]. Beijing: Publishing House Of Electronics Industry, 2011: 53-59.

Google Scholar

[5] Rotem Doron, Stocknger Kurt, Wu Kesheng. Efficient binning for bitmap indices on high-cardinality attributes. Lawrence Berkeley National Laboratory U.S. Department of Energy, Berkeley, California, USA, (2004).

DOI: 10.2172/841113

Google Scholar