메뉴 건너뛰기




Volumn 180, Issue 1, 2009, Pages

FastBit: Interactively searching massive data

(24)  Wu, K a   Ahern, S b   Bethel, E W a,b   Chen, J d   Childs, H e   Cormier Michel, E a   Geddes, C a   Gu, J a   Hagen, H c,f   Hamann, B a,c   Koegler, W d   Lauret, J g   Meredith, J b   Messmer, P h   Otoo, E a   Perevoztchikov, V g   Poskanzer, A a   Prabhat, a   Rubel O a,c,f   Shoshani, A a   more..


Author keywords

[No Author keywords available]

Indexed keywords

HIGH ENERGY PHYSICS; QUERY LANGUAGES; QUERY PROCESSING;

EID: 77953650310     PISSN: 17426588     EISSN: 17426596     Source Type: Conference Proceeding    
DOI: 10.1088/1742-6596/180/1/012053     Document Type: Conference Paper
Times cited : (97)

References (43)
  • 5
    • 6044224091 scopus 로고
    • STAR collaboration
    • Harris J and STAR collaboration 1994 Nucl. Phys. A 566 277-285
    • (1994) Nucl. Phys. , vol.566 , pp. 277-285
    • Harris, J.1
  • 11
    • 0032090806 scopus 로고    scopus 로고
    • Bitmap index design and evaluation
    • New York, NY, USA: ACM press
    • Chan C Y and Ioannidis Y E 1998 Bitmap index design and evaluation Proceedings of the 1998 ACM SIGMOD (New York, NY, USA: ACM press) p 355-366
    • (1998) Proceedings of the 1998 ACM SIGMOD , pp. 355-366
    • Chan, C.Y.1    Ioannidis, Y.E.2
  • 13
    • 77957063732 scopus 로고    scopus 로고
    • Reiss F R 2007 Data Triage PhD Thesis EECS Department, University of California, Berkeley URL http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS- 2007-79.html
    • (2007) Data Triage
    • Reiss, F.R.1
  • 15
    • 77957080374 scopus 로고    scopus 로고
    • The HDF Group
    • The HDF Group 2007 HDF5 user guide URL http://hdf.ncsa.uiuc.edu/HDF5/doc/ H5.user.html
    • (2007)
  • 16
    • 35948970859 scopus 로고    scopus 로고
    • HDF5-FastQuery: Accelerating complex queries on HDF datasets using fast bitmap indices
    • IEEE Computer Society Press IEEE Computer Society Press.
    • Gosink L, Shalf J, Stockinger K, Wu K and Bethel W 2006 HDF5-FastQuery: Accelerating complex queries on HDF datasets using fast bitmap indices SSDBM 2006 (IEEE Computer Society Press.)
    • (2006) SSDBM 2006
    • Gosink, L.1    Shalf, J.2    Stockinger, K.3    Wu, K.4    Bethel, W.5
  • 20
    • 70349707621 scopus 로고    scopus 로고
    • A spatial bitmap-based index for geographical data warehouses
    • New York, NY, USA: ACM
    • Siqueira T L L, Ciferri R R, Times V C and de Aguiar Ciferri C D 2009 A spatial bitmap-based index for geographical data warehouses SAC '09 (New York, NY, USA: ACM) p 1336-1342
    • (2009) SAC '09 , pp. 1336-1342
    • Siqueira, T.L.L.1    Ciferri, R.R.2    Times, V.C.3    De Aguiar Ciferri, C.D.4
  • 22
    • 0002010303 scopus 로고    scopus 로고
    • Performance measurements of compressed bitmap indices
    • San Francisco: Morgan Kaufmann
    • Johnson T 1999 Performance measurements of compressed bitmap indices VLDB'99 (San Francisco: Morgan Kaufmann) p 278-289
    • (1999) VLDB'99 , pp. 278-289
    • Johnson, T.1
  • 23
    • 33847180773 scopus 로고    scopus 로고
    • On the performance of bitmap indices for high cardinality attributes
    • Wu K, Otoo E and Shoshani A 2004 On the performance of bitmap indices for high cardinality attributes VLDB p 24-35
    • (2004) VLDB , pp. 24-35
    • Wu, K.1    Otoo, E.2    Shoshani, A.3
  • 26
    • 0035747395 scopus 로고    scopus 로고
    • A performance comparison of bitmap indexes
    • Wu K, Otoo E and Shoshani A 2001 A performance comparison of bitmap indexes CIKM 559-561
    • (2001) CIKM , pp. 559-561
    • Wu, K.1    Otoo, E.2    Shoshani, A.3
  • 27
    • 84948655665 scopus 로고    scopus 로고
    • Compressing bitmap indexes for faster search operations
    • Edinburgh, Scotland
    • Wu K, Otoo E and Shoshani A 2002 Compressing bitmap indexes for faster search operations Proceedings of SSDBM'02 (Edinburgh, Scotland) p 99-108
    • (2002) Proceedings of SSDBM'02 , pp. 99-108
    • Wu, K.1    Otoo, E.2    Shoshani, A.3
  • 32
    • 49049105204 scopus 로고    scopus 로고
    • Breaking the curse of cardinality on bitmap indexes
    • Wu K, Stockinger K and Shosani A 2008 Breaking the curse of cardinality on bitmap indexes SSDBM'08 p 348-365
    • (2008) SSDBM'08 , pp. 348-365
    • Wu, K.1    Stockinger, K.2    Shosani, A.3
  • 34
    • 85139618275 scopus 로고    scopus 로고
    • ACM
    • Koudas N 2000 Space efficient bitmap indexing Proc. ninth international conference on Information knowledge management CIKM 2000 November 6 - 11, 2000 (McLean, VA USA) p 194-201 (ACM)
    • (2000) Space Efficient Bitmap Indexing , pp. 194-201
    • Koudas, N.1
  • 35
    • 33745782351 scopus 로고    scopus 로고
    • Optimizing candidate check costs for bitmap indices
    • Rotem D, Stockinger K and Wu K 2005 Optimizing candidate check costs for bitmap indices CIKM
    • (2005) CIKM
    • Rotem, D.1    Stockinger, K.2    Wu, K.3
  • 38
    • 85030321143 scopus 로고    scopus 로고
    • MapReduce: Simplified data processing on large clusters
    • Dean J and Ghemawat S 2004 MapReduce: Simplified data processing on large clusters OSDI'04
    • (2004) OSDI'04
    • Dean, J.1    Ghemawat, S.2
  • 39
    • 84943231752 scopus 로고    scopus 로고
    • Using bitmap index for interactive exploration of large datasets
    • Cambridge, MA, USA
    • Wu K, Koegler W, Chen J and Shoshani A 2003 Using bitmap index for interactive exploration of large datasets Proceedings of SSDBM 2003 (Cambridge, MA, USA) p 65-74
    • (2003) Proceedings of SSDBM 2003 , pp. 65-74
    • Wu, K.1    Koegler, W.2    Chen, J.3    Shoshani, A.4
  • 42
    • 34548211483 scopus 로고    scopus 로고
    • Detecting distributed scans using high-performance query-driven visualization
    • New York, NY, USA: ACM
    • Stockinger K, Bethel E W, Campbell S, Dart E and Wu K 2006 Detecting distributed scans using high-performance query-driven visualization SC '06 (New York, NY, USA: ACM) p 82
    • (2006) SC '06 , pp. 82
    • Stockinger, K.1    Bethel, E.W.2    Campbell, S.3    Dart, E.4    Wu, K.5


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