ACM Home Page
Please provide us with feedback. Feedback
Pixel-oriented database visualizations
Full text PdfPdf (744 KB)
Source ACM SIGMOD Record archive
Volume 25 ,  Issue 4  (December 1996) table of contents
Pages: 35 - 39  
Year of Publication: 1996
ISSN:0163-5808
Author
Daniel A. Keim  Institute for Computer Science, University of Munich, Germany
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 64,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/245882.245896
What is a DOI?

ABSTRACT

In this paper, we provide an overview of several pixel-oriented visualization techniques which have been developed over the last years to support an effective querying and exploration of large databases. Pixel-oriented techniques use each pixel of the display to visualize one data value and therefore allow the visualization of the largest amount of data possible. The techniques may be divided into query-independent techniques which directly visualize the data (or a certain portion of it) and query-dependent techniques which visualize the relevance of the data with respect to a specific query. An example for the class of query-independent techniques is the recursive pattern technique which is based on a generic recursive scheme generalizing a wide range of pixel-oriented arrangements for visualizing large databases. Examples for the class of query-dependent techniques are the generalized spiral and circle-segments techniques, which visualize the distance with respect to a database query and arrange the most relevant data items in the center of the display.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
[AKK 96] Ankerst M., Keim D. A., Kriegel H.-P.: 'Circle-Segments: A Technique for Visually Exploring Large Multidimensional Data Sets', Visualization '96, Hot Topic Session, San Francisco CA, 1996.
 
2
 
3
[BCW 88] Becker R., Chambers J. M., Wilks A. R.: 'The New S Language', Wadsworth & Brooks/Cole Advanced Books and Software, Pacific Grove, CA., 1988.
 
4
[GPW 89] Grinstein G., Pickett R., Williams M. G.: 'EXVIS: An Exploratory Visualization Environment', Proc. Graphics Interface '89, London, Ontario, Canada, 1989.
 
5
[Hil91] Hilbert D.: 'Über stetige Abbildung einer Line auf ein Flächenstück', Math. Annalen, Vol. 38, 1891, pp. 459-460.
 
6
 
7
[Ins 81] Inselberg A.: 'N-Dimensional Graphics Part I: Lines & Hyperplanes', IBM LA Science Center Report, # G320-2711, 1981.
 
8
[Kei 94] Keim D. A.: 'Visual Support for Query Specification and Data Mining', Ph.D. Dissertation, University of Munich, July 1994, Shaker-Publishing Company, Aachen, Germany, 1995, ISBN 3-8265-0594-8.
 
9
10
 
11
12
 
13
 
14
 
15
 
16
[Mor 66] Morton.: 'A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing', IBM Ltd. Ottawa, Canada, 1966.
 
17
[Pea 90] Peano G.: 'Sur une courbe qui remplit toute une aire plaine', Math. Annalen, Vol. 36, 1890, pp. 157-160.
 
18
[PG 88] Pickett R. M., Grinstein G. G.: 'Iconographic Displays for Visualizing Multidimensional Data', Proc. IEEE Conf. on Systems, Man and Cybernetics, IEEE Press, Piscataway, NJ, 1988, pp. 514-519.
 
19
[SCB 92] Swayne D. F., Cook D., Buja A.: 'User's Manual for XGobi, a Dynamic Graphics Program for Data Analysis ', Bellcore Technical Memorandum, 1992.
 
20
[SGI 96] Database Mining and Visualization Group: 'Mine-Set TM: A System for High-End Data Mining and Visualization ', Silicon Graphics Inc., VLDB 1996, p. 595.
21
 
22
 
23
 
24
[Vel 92] Velleman P. F: 'Data Desk 4.2: Data Description', Ithaca, NY, 1992.
 
25