is prohibited.
ity queries? How can we automatically select the best combination of encoding,
compression and binning techniques? How can we use bitmap indices to answer
more general join queries?
Research work on bitmap indices so far has concentrated on answering queries ef-
ficiently, but has often neglected the issue of updating the indices. Clearly, there
is a need to update the indices as new records are added. Efficient solutions to this
issue could be the key to gain a wider adaptation of bitmap indices in commercial
applications.
References
Antoshenkov, G. (1994). Byte-aligned bitmap compression (Tech. Rep., U.S. Patent
number 5,363,098). Oracle Corp.
Antoshenkov, G., & Ziauddin, M. (1996). Query processing and optimization in
ORACLE RDB. VLDB Journal, 5, 229-237.
Berchtold, S., Boehm, C., & Kriegl, H.-P. (1998). The pyramid-technique: Towards
breaking the curse of dimensionality. SIGMOD Record, 27(2), 142-153.
Chan, C.-Y., & Ioannidis, Y. E. (1998, June). Bitmap index design and evaluation.
International Conference on Management of Data, SIGMOD, Seattle, Washington
(pp. 355-366). ACM Press.
Chan, C.-Y., & Ioannidis, Y. E. (1999, June). An efficient bitmap encoding scheme
for selection queries. International Conference on Management of Data, SIGMOD,
Philadelphia (pp. 215-226). ACM Press.
Chaudhuri, S., & Dayal, U. (1997).
Pages:
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346