Frank Dehne

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Neil Burke

> Home > Persons > Frank Dehne

Publications

2018
[j69]
- view
  authority control:
- export record
  dblp key:
  - journals/tpds/DehneRRB18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tpds/DehneRRB18
Frank Dehne, David E. Robillard, Andrew Rau-Chaplin, Neil Burke:
VOLAP: A Scalable Distributed Real-Time OLAP System for High-Velocity Data. IEEE Trans. Parallel Distributed Syst. 29(1): 226-239 (2018)
2017
[c88]
- view
  authority control:
- export record
  dblp key:
  - conf/ideas/BurkeDRR17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ideas/BurkeDRR17
Neil Burke, Frank Dehne, Andrew Rau-Chaplin, David E. Robillard:
Quantifying Eventual Consistency For Aggregate Queries. IDEAS 2017: 274-282
2016
[c87]
- view
  authority control:
- export record
  dblp key:
  - conf/cluster/DehneRRB16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cluster/DehneRRB16
Frank Dehne, David E. Robillard, Andrew Rau-Chaplin, Neil Burke:
VOLAP: A Scalable Distributed System for Real-Time OLAP with High Velocity Data. CLUSTER 2016: 354-363
[c85]
- view
  authority control:
- export record
  dblp key:
  - conf/ideas/RobillardDRB16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ideas/RobillardDRB16
David E. Robillard, Frank Dehne, Andrew Rau-Chaplin, Neil Burke:
The Hilbert PDC-tree: A High-Velocity Structure for Many-Dimensional Data. IDEAS 2016: 164-172

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.