Database Reference
In-Depth Information
an iterator is a convenient way to access large datasets on parallel systems,
the example demonstrated an effective way of using indexes for parallel data
analysis.
As datasets grow in size, all data analyses are likely to be performed on par-
allel computers. Off-loading some data processing tasks to the disk controller
(as the Netezza system does) or other custom hardware could be an effective
strategy to improve the e
ciency of query processing. However, advanced
indexing techniques will continue to be an indispensable tool for analyzing
massive datasets.
Acknowledgment
This work was supported by the Director, Oce of Advanced Scientific Com-
puting Research, Oce of Science, of the U.S. Department of Energy, under
Contract No. DE-AC02-05CH11231.
References
[1] D. Abadi, S. R. Madden, and M. C. Ferreira. Integrating compression
and execution in column-oriented database systems. In
SIGMOD
. ACM,
2006.
[2] A. V. Aho and J. D. Ullman. Optimal partial-match retrieval when fields
are independently specified.
ACM Trans. Database Syst.
, 4(2):168-179,
1979.
[3] S. Amer-Yahia and T. Johnson. Optimizing queries on compressed
bitmaps. In
International Conference on Very Large Data Bases
, Cairo,
Egypt, September 2000. Morgan Kaufmann.
[4] G. Antoshenkov. Byte-aligned bitmap compression. In
Data Compres-
sion Conference (DCC)
, March 28, 1995.
[5] G. Antoshenkov and M. Ziauddin. Query processing and optimization
in ORACLE RDB.
VLDB Journal
, 5:229-237, 1996.
[6] C. Ballinger and R. Fryer. Born to be parallel: Why parallel origins
give Teradata an enduring performance edge.
IEEE Data Eng. Bull.
,
20(2):3-12, 1997. An updated version of this paper is available at
http://www.teradata.com/library/pdf/eb3053.pdf.
[7] P. Barrett. Application of linear quadtree to astronomical database.
As-
tronomical Data Analysis Software and Systems IV
, 77:1-4, 1995.
