Publications

DBLP

We include the papers to ensure timely dissemination of scholarly work on a noncommercial basis. Copyright and all rights therein are retained by the copyright holders, notwithstanding that the works are offered here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by the copyrights. These works may not be reposted without the explicit permission of the copyright holder. The final versions of Springer publications are available at link.springer.com

F. Cafagna, M. Böhlen VLDBJ 2017
Disjoint Interval Partitioning
A. Dignös, M. H. Böhlen, J. Gamper, C. S. Jensen TODS 2016
A. Dignös, M. H. Böhlen, J. Gamper SIGMOD 2014
M. Khayati, M. Böhlen and J. Gamper ICDE 2014
Memory-efficient Centroid Decomposition for Long Time Series
S. Helmer, N. Augsten, M. Böhlen VLDBJ 2012
Measuring structural similarity of semistructured data based on information-theoretic approaches
N. Augsten, C. Dyresen, M. Böhlen, J. Gamper VLDBJ 2012
Windowed pq-Grams for Approximate Joins of Data-Centric XML
A. Dignös, M. H. Böhlen, J. Gamper SIGMOD 2012
J. Gordevicius, J. Gamper, M. Böhlen VLDBJ 2012
Parsimonious Temporal Aggregation
B. Cadonna, J. Gamper, M. Böhlen EDBT 2011
I. Timko, M. Böhlen, J. Gamper VLDBJ 2011
Sequenced Spatiotemporal Aggregation for Coarse Query Granularities
N. Augsten, D. Barbosa, M. Böhlen, T. Palpanas ICDE 2010
TASM: Top-k Approximate Subtree Matching
N. Augsten, M. Böhlen, J. Gamper TODS 2010
J. Gordevicius, J. Gamper, M. Böhlen EDBT 2009
I. Timko, M. Böhlen, J. Gamper EDBT 2009
N. Augsten, M. H. Böhlen, C. Dyreson, and J. Gamper ICDE 2008
Approximate Joins for Data Centric XML
A. Mazeika, M. H. Böhlen, N. Koudas, and D. Srivastava TODS 2007
N. Augsten, M. Böhlen, J. Gamper VLDB 2006
An Incrementally Maintainable Index for Approximate Lookups in Hierarchical Data
M. H. Böhlen, J. Gamper, C. S. Jensen EDBT 2006
Multi-Dimensional Aggregation for Temporal Data
N. Augsten, M. H. Böhlen, J. Gamper VLDB 2005
Approximate Matching of Hierarchical Data Using pq-Grams
M. O. Akinde, M. H. Böhlen ICDE 2003
The Efficient Computation of Subqueries in Complex OLAP Queries
M. O. Akinde, M. H. Böhlen, T. Johnson, L. Lakshmanan, D. Srivastava EDBT 2002
Efficient OLAP Query Processing in Distributed Data Warehouses
J. Chomicki, D. Toman, M. H. Böhlen TODS 2001
M. Agesen, M. H. Böhlen, L. O. Poulsen, K. Torp ICDE 2001
A Split Operator for Now-Relative Bitemporal Databases
M. H. Böhlen, C. S. Jensen, R. T. Snodgrass TODS 2000
R. H. Güting, M. H. Böhlen, M. Erwig, C. S. Jensen, N. Lorentzos,M. Schneider, M. Vazirgiannis TODS 2000
C. Dyreson, M. H. Böhlen, C. S. Jensen VLDB 1999
Capturing and Querying Multiple Aspects of Semistructured Data
M. O. Akinde, O. G. Jensen, M. H. Böhlen EDBT 1998
Minimizing Detail Data in Data Warehouses
M. H. Böhlen, R. Busatto, C. S. Jensen ICDE 1998
Point-Versus Interval-Based Temporal Data Models
M. H. Böhlen, R. T. Snodgrass, M. D. Soo VLDB 1996
Coalescing in Temporal Databases
M. H. Böhlen, J. Chomicki, R. T. Snodgrass, D. Toman EDBT 1996
Querying TSQL2 Databases with Temporal Logic