Pixel-oriented Database Visualizations

Keim, Daniel A.

Pixel-oriented Database Visualizations

Dateien

Pixel_oriented_Database_Visualizations.pdfGröße: 612.37 KBDownloads: 592

Datum

1996

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Erschienen in

SIGMOD Record. 1996, 25(4), pp. 35-39. Available under: doi: 10.1145/245882.245896

Zusammenfassung

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 distances with respect to a database query and arrange the most relevant data items in the center of the display.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

Visualizing Large Databases, Visual Data Mining, Visualizing Multidimensional and Multivariate Data

Zitieren

ISO 690

KEIM, Daniel A., 1996. Pixel-oriented Database Visualizations. In: SIGMOD Record. 1996, 25(4), pp. 35-39. Available under: doi: 10.1145/245882.245896

BibTex

@article{Keim1996Pixel-5676,
  year={1996},
  doi={10.1145/245882.245896},
  title={Pixel-oriented Database Visualizations},
  number={4},
  volume={25},
  journal={SIGMOD Record},
  pages={35--39},
  author={Keim, Daniel A.}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/5676">
    <dc:format>application/pdf</dc:format>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5676/1/Pixel_oriented_Database_Visualizations.pdf"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Keim, Daniel A.</dc:creator>
    <dcterms:issued>1996</dcterms:issued>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:16Z</dc:date>
    <dcterms:title>Pixel-oriented Database Visualizations</dcterms:title>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5676"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:59:16Z</dcterms:available>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:abstract xml:lang="eng">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 distances with respect to a database query and arrange the most relevant data items in the center of the display.</dcterms:abstract>
    <dc:language>eng</dc:language>
    <dcterms:bibliographicCitation>First publ. in: SIGMOD Record 25 (1996), 4, pp. 35-39</dcterms:bibliographicCitation>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dc:contributor>Keim, Daniel A.</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5676/1/Pixel_oriented_Database_Visualizations.pdf"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Nein