메뉴 건너뛰기




Volumn 35, Issue 1, 2010, Pages

Analyses of multi-level and multi-component compressed bitmap indexes

Author keywords

Compression; Multi component bitmap index; Multi level bitmap index; Performance analysis

Indexed keywords

ANSWERING QUERIES; BITMAP INDEXES; CLOSED FORM; COMMERCIAL PRODUCTS; INDEXING METHODS; MULTI-LEVEL; MULTICOMPONENTS; OPTIMAL COMPUTATIONAL COMPLEXITY; PERFORMANCE ANALYSIS; RANGE QUERY; WORST CASE;

EID: 77249148544     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1670243.1670245     Document Type: Article
Times cited : (52)

References (44)
  • 2
    • 0001269082 scopus 로고    scopus 로고
    • Query processing and optimization in ORACLE RDB
    • ANTOSHENKOV, G. AND ZIAUDDIN, M. 1996. Query processing and optimization in ORACLE RDB. VLDB J. 5, 229-237.
    • (1996) VLDB J. , vol.5 , pp. 229-237
    • Antoshenkov, G.1    Ziauddin, M.2
  • 4
    • 0025673004 scopus 로고
    • Using bitmaps for medium sized information retrieval systems
    • BOOKSTEIN, A. AND KLEIN, S. T. 1990. Using bitmaps for medium sized information retrieval systems. Inform. Process. Manag. 26, 525-533.
    • (1990) Inform. Process. Manag. , vol.26 , pp. 525-533
    • Bookstein, A.1    Klein, S.T.2
  • 5
    • 3843056012 scopus 로고    scopus 로고
    • Simple Bayesian model for bitmap compression
    • BOOKSTEIN, A., KLEIN, S. T., AND RAITA, T. 2000. Simple Bayesian model for bitmap compression. Inform. Retriev. 1, 4, 315-328.
    • (2000) Inform. Retriev. , vol.1 , Issue.4 , pp. 315-328
    • Bookstein, A.1    Klein, S.T.2    Raita, T.3
  • 8
    • 0035577915 scopus 로고    scopus 로고
    • Database technology for decision support systems
    • CHAUDHURI, S., DAYAL, U., AND GANTI, V. 2001. Database technology for decision support systems. Comput. 34, 12, 48-55.
    • (2001) Comput. , vol.34 , Issue.12 , pp. 48-55
    • Chaudhuri, S.1    Dayal, U.2    Ganti, V.3
  • 9
    • 0018480749 scopus 로고
    • The ubiquitous B-tree
    • COMER, D. 1979. The ubiquitous B-tree. Comput. Surv. 11, 2, 121-137.
    • (1979) Comput. Surv. , vol.11 , Issue.2 , pp. 121-137
    • Comer, D.1
  • 11
    • 84976690119 scopus 로고
    • Signature files: An access method for documents and its analytical performance evaluation
    • FALOUTSOS, C. AND CHRISTODOULAKIS, S. 1984. Signature files: An access method for documents and its analytical performance evaluation. ACM Trans. Inform. Syst. 2, 4, 267-288.
    • (1984) ACM Trans. Inform. Syst. , vol.2 , Issue.4 , pp. 267-288
    • Faloutsos, C.1    Christodoulakis, S.2
  • 14
    • 77249157916 scopus 로고    scopus 로고
    • K. Böhm, C. S. Jensen, L. M. Haas, M. L. Kersten, P.-°A Larson, and B. C. Ooi Eds., ACM Press, New York 1140-1151
    • K. Böhm, C. S. Jensen, L. M. Haas, M. L. Kersten, P.-°A. Larson, and B. C. Ooi Eds., ACM Press, New York, 1140-1151.
  • 15
    • 0002010303 scopus 로고    scopus 로고
    • Performance measurements of compressed bitmap indices
    • M. P. Atkinson, M. E. Orlowska, P. Valduriez, S. B. Zdonik, and M. L. Brodie Eds. Morgan Kaufmann, San Francisco, CA
    • JOHNSON, T. 1999. Performance measurements of compressed bitmap indices. In Proceedings of the 25th International Conference on Very Large Data Bases (VLDB'99). M. P. Atkinson, M. E. Orlowska, P. Valduriez, S. B. Zdonik, and M. L. Brodie Eds. Morgan Kaufmann, San Francisco, CA, 278-289.
    • (1999) Proceedings of the 25th International Conference on Very Large Data Bases (VLDB'99) , pp. 278-289
    • Johnson, T.1
  • 18
    • 17044407557 scopus 로고    scopus 로고
    • Supernova simulations with boltzmann neutrino transport: A comparison of methods
    • LIEBENDöRFER, M., RAMPP, M., JANKA, H.-T., ANDMEZZACAPPA, A. 2005. Supernova simulations with boltzmann neutrino transport: A comparison of methods. Astrophys. J. 620, 840-860.
    • (2005) Astrophys. J. , vol.620 , pp. 840-860
    • Liebendörfer, M.1    Rampp, M.2    Janka, H.-T.3    Mezzacappa, A.4
  • 19
    • 0033312160 scopus 로고    scopus 로고
    • Applying on-line bitmap indexing to reduce counting costs in mining association rules
    • LIN, X., LI, Y., AND TSANG, C. P. 1999. Applying on-line bitmap indexing to reduce counting costs in mining association rules. Inform. Sci. 120, 1-4, 197-208.
    • (1999) Inform. Sci. , vol.120 , Issue.1-4 , pp. 197-208
    • Lin, X.1    Li, Y.2    Tsang, C.P.3
  • 22
    • 77249084813 scopus 로고    scopus 로고
    • NASCIMENTO M. A., OöZSU M. T., KOSSMANN, D., MILLER, R. J., BLAKELEY, J. A., AND SCHIEFER, K. B., EDS. Morgan Kaufmann
    • NASCIMENTO, M. A., öZSU, M. T., KOSSMANN, D., MILLER, R. J., BLAKELEY, J. A., AND SCHIEFER, K. B., EDS. 2004. In Proceedings of the 30th International Conference on Very Large Data Bases (VLDB'04). Morgan Kaufmann.
    • (2004) Proceedings of the 30th International Conference on Very Large Data Bases (VLDB'04)
  • 23
    • 47949128591 scopus 로고    scopus 로고
    • Bitmap index design choices and their performance implications
    • O'NEIL, E., O'NEIL, P., AND WU, K. 2007. Bitmap index design choices and their performance implications. In Proceedings of IDEAS'07. 72-84.
    • (2007) Proceedings of IDEAS'07 , pp. 72-84
    • O'Neil, E.1    O'Neil, P.2    Wu, K.3
  • 25
    • 0346050293 scopus 로고    scopus 로고
    • Informix indexing support for data warehouses
    • O'NEIL, P. 1997. Informix indexing support for data warehouses. Datab. Program. Des. 10, 2, 38-43.
    • (1997) Datab. Program. Des. , vol.10 , Issue.2 , pp. 38-43
    • O'Neil, P.1
  • 27
    • 84941188232 scopus 로고
    • Multi-Table joins through bitmapped join indices
    • O'NEIL, P. E. AND GRAEFE, G. 1995. Multi-Table joins through bitmapped join indices. SIGMOD Rec. 24, 3, 8-11.
    • (1995) SIGMOD Rec. , vol.24 , Issue.3 , pp. 8-11
    • O'Neil, P.E.1    Graefe, G.2
  • 30
    • 34548455871 scopus 로고    scopus 로고
    • Multi-Resolution bitmap indexes for scientific data
    • SINHA, R. R. AND WINSLETT, M. 2007. Multi-Resolution bitmap indexes for scientific data. ACM Trans. Datab. Syst. 32, 3, 16.
    • (2007) ACM Trans. Datab. Syst. , vol.32 , Issue.3 , pp. 16
    • Sinha, R.R.1    Winslett, M.2
  • 36
    • 24344486420 scopus 로고    scopus 로고
    • Fast Bit: An efficient indexing technology for accelerating data-intensive science
    • WU, K. 2005. FastBit: An efficient indexing technology for accelerating data-intensive science. J. Phys.: Conf. Ser. 16, 556-560.
    • (2005) J. Phys.: Conf. Ser. , vol.16 , pp. 556-560
    • Wu, K.1
  • 37
    • 77249127591 scopus 로고    scopus 로고
    • Compressed bitmap indices for efficient query processing
    • Lawrence Berkeley National Laboratory, Berkeley, CA
    • WU, K., OTOO, E., AND SHOSHANI, A. 2001a. Compressed bitmap indices for efficient query processing. Tech. rep. LBNL-47807, Lawrence Berkeley National Laboratory, Berkeley, CA.
    • (2001) Tech. Rep. LBNL-47807
    • Wu, K.1    Otoo, E.2    Shoshani, A.3
  • 40
    • 33745215599 scopus 로고    scopus 로고
    • Optimizing bitmap indices with efficient compression
    • WU, K., OTOO, E., AND SHOSHANI, A. 2006. Optimizing bitmap indices with efficient compression. ACM Trans. Datab. Syst. 31, 1-38.
    • (2006) ACM Trans. Datab. Syst. , vol.31 , pp. 1-38
    • Wu, K.1    Otoo, E.2    Shoshani, A.3
  • 41
    • 0004033205 scopus 로고    scopus 로고
    • Range-Based bitmap indexing for high cardinality attributes with skew
    • IBM Watson Research Division, Yorktown Heights, NY
    • WU, K.-L. AND YU, P. 1996. Range-Based bitmap indexing for high cardinality attributes with skew. Tech. rep. RC 20449, IBM Watson Research Division, Yorktown Heights, NY.
    • (1996) Tech. Rep. RC 20449
    • Wu, K.-L.1    Yu, P.2
  • 44
    • 0032268976 scopus 로고    scopus 로고
    • Inverted files versus signature files for text indexing
    • ZOBEL, J., MOFFAT, A., AND RAMAMOHANARAO, K. 1998. Inverted files versus signature files for text indexing. ACM Trans. Datab. Syst. 23, 4, 453-490.
    • (1998) ACM Trans. Datab. Syst. , vol.23 , Issue.4 , pp. 453-490
    • Zobel, J.1    Moffat, A.2    Ramamohanarao, K.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.