Journal of Intelligent Information Systems

, Volume 17, Issue 2, pp 241–254

BitCube: A Three-Dimensional Bitmap Indexing for XML Documents

Authors

  • Jong P. Yoon
    • Center for Advanced Computer StudiesUniversity of Louisiana
  • Vijay Raghavan
    • Center for Advanced Computer StudiesUniversity of Louisiana
  • Venu Chakilam
    • Center for Advanced Computer StudiesUniversity of Louisiana
  • Larry Kerschberg
    • E-Center for E-Business and Department of Information and Software EngineeringGeorge Mason University
Article

DOI: 10.1023/A:1012861931139

Cite this article as:
Yoon, J.P., Raghavan, V., Chakilam, V. et al. Journal of Intelligent Information Systems (2001) 17: 241. doi:10.1023/A:1012861931139

Abstract

XML is a new standard for exchanging and representing information on the Internet. Documents can be hierarchically represented by XML-elements. In this paper, we propose that an XML document collection be represented and indexed using a bitmap indexing technique. We define the similarity and popularity operations suitable for bitmap indexes. We also define statistical measurements in the BitCube: center, and radius. Based on these measurements, we describe a new bitmap indexing based technique to cluster XML documents. The techniques for clustering are motivated by the fact that the bitmap indexes are expected to be very sparse.

Furthermore, a 2-dimensional bitmap index is extended to a 3-dimensional bitmap index, called the BitCube. Sophisticated querying of XML document collections can be performed using primitive operations such as slice, project, and dice. Experiments show that the BitCube can be created efficiently and the primitive operations can be performed more efficiently with the BitCube than with other alternatives.

XML document retrievaldocument clusteringbitmap indexingbit-wise operations

Copyright information

© Kluwer Academic Publishers 2001