Publikation:

Workload aware data partitioning

Lade...
Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2022

Autor:innen

May, Norman
Boehm, Alexander
Moerkotte, Guido
Valiyev, Mahammad
Weber, Nick
Schulze, Robert

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
DOI (zitierfähiger Link)
ArXiv-ID

Internationale Patentnummer

US20220019589

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Patent
Publikationsstatus
Published

Erschienen in

Zusammenfassung

Techniques and solutions are described for partitioning data among different types of computer-readable storage media, such as between RAM and disk-based storage. A measured workload can be used to estimate data access for one or more possible partition arrangements. The partitions arrangements can be automatically enumerated. Scores for the partition arrangements can be calculated, where a score can indicate how efficiently a partition arrangement places frequently accessed data into storage specified for frequently-accessed data and placed infrequently accessed data into storage specified for infrequently accessed data.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690MAY, Norman, Alexander BOEHM, Guido MOERKOTTE, Michael BRENDLE, Mahammad VALIYEV, Nick WEBER, Robert SCHULZE, Michael GROSSNIKLAUS, 2022. Workload aware data partitioning
BibTex
@misc{May2022Workl-56602,
  year={2022},
  title={Workload aware data partitioning},
  url={https://patents.google.com/patent/US20220019589A1/en},
  author={May, Norman and Boehm, Alexander and Moerkotte, Guido and Brendle, Michael and Valiyev, Mahammad and Weber, Nick and Schulze, Robert and Grossniklaus, Michael}
}
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/56602">
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/56602"/>
    <dcterms:issued>2022</dcterms:issued>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-02-21T07:40:53Z</dcterms:available>
    <dc:creator>Valiyev, Mahammad</dc:creator>
    <dc:contributor>May, Norman</dc:contributor>
    <dc:contributor>Grossniklaus, Michael</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:contributor>Brendle, Michael</dc:contributor>
    <dcterms:title>Workload aware data partitioning</dcterms:title>
    <dc:contributor>Boehm, Alexander</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-02-21T07:40:53Z</dc:date>
    <dc:creator>May, Norman</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Moerkotte, Guido</dc:creator>
    <dc:creator>Grossniklaus, Michael</dc:creator>
    <dc:creator>Weber, Nick</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:abstract xml:lang="eng">Techniques and solutions are described for partitioning data among different types of computer-readable storage media, such as between RAM and disk-based storage. A measured workload can be used to estimate data access for one or more possible partition arrangements. The partitions arrangements can be automatically enumerated. Scores for the partition arrangements can be calculated, where a score can indicate how efficiently a partition arrangement places frequently accessed data into storage specified for frequently-accessed data and placed infrequently accessed data into storage specified for infrequently accessed data.</dcterms:abstract>
    <dc:creator>Boehm, Alexander</dc:creator>
    <dc:rights>terms-of-use</dc:rights>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Schulze, Robert</dc:creator>
    <dc:contributor>Valiyev, Mahammad</dc:contributor>
    <dc:contributor>Moerkotte, Guido</dc:contributor>
    <dc:language>eng</dc:language>
    <dc:creator>Brendle, Michael</dc:creator>
    <dc:contributor>Schulze, Robert</dc:contributor>
    <dc:contributor>Weber, Nick</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt

Prüfdatum der URL

2022-02-21

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen