Остановите войну!
for scientists:
default search action
Frank Dehne
- > Home > Persons > Frank Dehne
Publications
- 2018
- [j69]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]Neil Burke, Frank Dehne, Andrew Rau-Chaplin, David E. Robillard:
Quantifying Eventual Consistency For Aggregate Queries. IDEAS 2017: 274-282 - 2016
- [c87]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]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 - 2015
- [j65]Frank K. H. A. Dehne, Q. Kong, Andrew Rau-Chaplin, Hamidreza Zaboli, R. Zhou:
Scalable real-time OLAP on cloud architectures. J. Parallel Distributed Comput. 79-80: 31-41 (2015) - 2013
- [j62]Oliver Baltzer, Frank Dehne, Andrew Rau-Chaplin:
OLAP for moving object data. Int. J. Intell. Inf. Database Syst. 7(1): 79-112 (2013) - [c81]Frank K. H. A. Dehne, Q. Kong, Andrew Rau-Chaplin, Hamidreza Zaboli, R. Zhou:
A distributed tree data structure for real-time OLAP on cloud architectures. IEEE BigData 2013: 499-505 - 2010
- [j57]Frank K. H. A. Dehne, Glenn Hickey, Andrew Rau-Chaplin, Mark Byrne:
Parallel catastrophe modelling on a Cell/BE. Int. J. Parallel Emergent Distributed Syst. 25(5): 401-410 (2010) - [p1]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
RCUBE. Strategic Advancements in Utilizing Data Mining and Warehousing Technologies 2010: 107-120 - 2009
- [j56]Frank Dehne, Michael Lawrence, Andrew Rau-Chaplin:
Cooperative caching for grid-enabled OLAP. Int. J. Grid Util. Comput. 1(2): 169-181 (2009) - [c75]Frank K. H. A. Dehne, Glenn Hickey, Andrew Rau-Chaplin, Mark Byrne:
Parallel catastrophe modelling on a cell processor. CASCON 2009: 24-31 - 2008
- [j54]Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
PnP: sequential, external memory, and parallel iceberg cube computation. Distributed Parallel Databases 23(2): 99-126 (2008) - [j52]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
RCUBE: Parallel Multi-Dimensional ROLAP Indexing. Int. J. Data Warehous. Min. 4(3): 1-14 (2008) - [c73]Oliver Baltzer, Frank K. H. A. Dehne, Susanne E. Hambrusch, Andrew Rau-Chaplin:
OLAP for Trajectories. DEXA 2008: 340-347 - 2007
- [c70]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Efficient computation of view subsets. DOLAP 2007: 65-72 - [c69]Michael Lawrence, Frank K. H. A. Dehne, Andrew Rau-Chaplin:
Implementing OLAP Query Fragment Aggregation and Recombination for the OLAP Enabled Grid. IPDPS 2007: 1-8 - 2006
- [j46]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
The cgmCUBE project: Optimizing parallel data cube generation for ROLAP. Distributed Parallel Databases 19(1): 29-62 (2006) - [j45]Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Improved Data Partitioning for Building Large ROLAP Data Cubes in Parallel. Int. J. Data Warehous. Min. 2(1): 1-26 (2006) - [c66]Ying Chen, Andrew Rau-Chaplin, Frank K. H. A. Dehne, Todd Eavis, D. Green, E. Sithirasenan:
cgmOLAP: Efficient Parallel Generation and Querying of Terabyte Size ROLAP Data Cubes. ICDE 2006: 164 - 2005
- [c59]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Parallel querying of ROLAP cubes in the presence of hierarchies. DOLAP 2005: 89-96 - [c58]Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
PnP: Parallel And External Memory Iceberg Cubes. ICDE 2005: 576-577 - 2004
- [j42]Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Parallel ROLAP Data Cube Construction on Shared-Nothing Multiprocessors. Distributed Parallel Databases 15(3): 219-236 (2004) - [c55]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Top-Down Computation of Partial ROLAP Data Cubes. HICSS 2004 - [c54]Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Building Large ROLAP Data Cubes in Parallel. IDEAS 2004: 367-377 - 2003
- [j40]James Cheetham, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon:
Solving large FPT problems on coarse-grained parallel machines. J. Comput. Syst. Sci. 67(4): 691-706 (2003) - [c52]James Cheetham, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon:
A Parallel FPT Application For Clusters. CCGRID 2003: 70-77 - [c51]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Parallel Multi-Dimensional ROLAP Indexing. CCGRID 2003: 86-93 - [c49]James Cheetham, Frank K. H. A. Dehne, Sylvain Pitre, Andrew Rau-Chaplin, Peter J. Taillon:
Parallel CLUSTAL W for PC Clusters. ICCSA (2) 2003: 300-309 - [c48]Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors. IPDPS 2003: 70 - 2002
- [j38]Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin:
Parallelizing the Data Cube. Distributed Parallel Databases 11(2): 181-201 (2002) - 2001
- [c41]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
A Cluster Architecture for Parallel Data Warehousing. CCGRID 2001: 161-168 - [c40]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Coarse Grained Parallel On-Line Analytical Processing (OLAP) for Data Mining. International Conference on Computational Science (2) 2001: 589-598 - [c39]Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin:
Parallelizing the Data Cube. ICDT 2001: 129-143 - [c38]Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin:
Computing Partial Data Cubes for Parallel Data Warehousing Applications. PVM/MPI 2001: 319-326 - 1999
- [j33]Albert Chan, Frank K. H. A. Dehne, Andrew Rau-Chaplin:
Coarse-Grained Parallel Geometric Search. J. Parallel Distributed Comput. 57(2): 224-235 (1999) - 1998
- [c31]Vassil Alexandrov, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Keith Taft:
Coarse Grained Parallel Monte Carlo Algorithms for Solving SLAE Using PVM. PVM/MPI 1998: 323-330 - 1997
- [c28]Albert Chan, Frank K. H. A. Dehne, Andrew Rau-Chaplin:
Coarse Grained Parallel Next Element Search. IPPS 1997: 320- - [e6]Frank K. H. A. Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, Roberto Tamassia:
Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings. Lecture Notes in Computer Science 1272, Springer 1997, ISBN 3-540-63307-3 [contents] - 1996
- [j27]Frank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin:
Scalable parallel computational geometry for coarse grained multicomputers. Int. J. Comput. Geom. Appl. 6(3): 379-400 (1996) - 1995
- [j26]Frank K. H. A. Dehne, Andrew Rau-Chaplin, Afonso Ferreira:
Hypercube Algorithms for Parallel Processing of Pointer-Based Quadtrees. Comput. Vis. Image Underst. 62(1): 1-10 (1995) - 1994
- [j24]Mikhail J. Atallah, Frank K. H. A. Dehne, Russ Miller, Andrew Rau-Chaplin, Jyh-Jong Tsay:
Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers. J. Parallel Distributed Comput. 20(1): 1-13 (1994) - [j23]Frank K. H. A. Dehne, Andreas Fabri, Mostafa Nassar, Andrew Rau-Chaplin, Rada Valiveti:
Construction of d-Dimensional Hyperoctrees on a Hypercube Multiprocessor. J. Parallel Distributed Comput. 23(2): 256-262 (1994) - [j22]Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin:
A Massively Parallel Knowledge-Base Server Using a Hypercube Multiprocessor. Parallel Comput. 20(9): 1369-1382 (1994) - 1993
- [c20]Frank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin:
Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. SCG 1993: 298-307 - 1992
- [j20]Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin:
Parallel Fractional Cascading on Hypercube Multiprocessors. Comput. Geom. 2: 141-167 (1992) - 1991
- [j17]Frank Dehne, Russ Miller, Andrew Rau-Chaplin:
Optical clustering on a mesh-connected computer. Int. J. Parallel Program. 20(6): 475-486 (1991) - [c18]Frank K. H. A. Dehne, Andrew Rau-Chaplin:
Parallel algorithms for color image quantization on hypercubes and meshes. Algorithms and Parallel VLSI Architectures 1991: 91-96 - [c17]Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin:
Efficient Parallel Construction and Manipulation of Quadtrees. ICPP (3) 1991: 255-262 - [c16]Mikhail J. Atallah, Frank K. H. A. Dehne, Russ Miller, Andrew Rau-Chaplin, Jyh-Jong Tsay:
Multisearch Techniques for Implementing Data Structures on a Mesh-Connected Computer (Preliminary Version). SPAA 1991: 204-214 - 1990
- [j13]Frank K. H. A. Dehne, Andrew Rau-Chaplin:
Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry. J. Parallel Distributed Comput. 8(4): 367-375 (1990) - [j11]Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin:
A. G. Ferreira Parallel branch and bound on fine-grained hypercube multiprocessors. Parallel Comput. 15(1-3): 201-209 (1990) - [c14]Frank Dehne, Afonso G. Ferreira, Andrew Rau-Chaplin:
A massively parallel knowledge-base server using a hypercube multiprocessor. TAI 1990: 660-666 - 1989
- [c11]Frank Dehne, Afonso G. Ferreira, Andrew Rau-Chaplin:
Parallel branch and bound on fine-grained hypercube multiprocessors. TAI 1989: 616-622 - [c9]Frank K. H. A. Dehne, Andrew Rau-Chaplin:
Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry. WG 1989: 316-329
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint