Niwan Wattanakitrungroj

Learn More
Indexing techniques based on bitmap representations are known to improve query response time in a data warehouse environment. Specifically, bitmap indexing is a good method for improving complex and ad hoc queries without adding additional hardware. This method improves query processing using large numbers of fast Boolean operations and multiple index(More)
Bitmap Indexes are well-known method to improve processing time for complex and interactive queries in a data warehouse. They significant improve query processing time by utilizing low-cost Boolean operations and performing predicate conditions on the index level before accessing to the primary source data. In this paper, we propose an efficient algorithm(More)
The challenge of clustering on data stream is the ability to deal with the continuous incoming data which are unlimited and unable to store all of them. To manage the storage crisis, the data must be processed in a single pass or only once after the arrival and are thrown away outer. All previously clustered data must be mathematically captured in terms of(More)
Indexing techniques based on bitmap representations are well suited to a warehouse system. They significantly improve query processing time by utilizing low-cost Boolean operations and multiple index scans, executing queries by performing simple predicate conditions on the index level before going to the primary data source. To optimize existing Encoded(More)
  • 1