default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael H. Böhlen
Person information
- affiliation: University of Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j34]Qing Chen
, Michael H. Böhlen, Sven Helmer:
An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs. Proc. ACM Manag. Data 3(1): 10:1-10:26 (2025)- [i10]Qing Chen, Michael H. Böhlen, Sven Helmer:
An experimental comparison of tree-data structures for connectivity queries on fully-dynamic undirected graphs (Extended Version). CoRR abs/2501.02278 (2025) - 2024
- [c95]Jamal Mohammed, Michael H. Böhlen, Sven Helmer:
Quantifying and Estimating the Predictability Upper Bound of Univariate Numeric Time Series. KDD 2024: 2236-2247 - 2023
- [j33]AmirReza Alizade Nikoo, Michael H. Böhlen, Sven Helmer:
Correlation Joins over Time Series Data Streams Utilizing Complementary Dimension Reduction and Transformation. Proc. ACM Manag. Data 1(4): 235:1-235:26 (2023) - [j32]Kevin Wellenzohn, Michael H. Böhlen, Sven Helmer, Antoine Pietri, Stefano Zacchiroli:
Robust and scalable content-and-structure indexing. VLDB J. 32(4): 689-715 (2023) - [c94]Kevin Wellenzohn, Michael H. Böhlen, Sven Helmer, Marcel Reutegger:
Workload-Aware Contention-Management in Indexes for Hierarchical Data. BTW 2023: 71-92 - 2022
- [j31]Bezaye Tesfaye, Nikolaus Augsten, Mateusz Pawlik, Michael H. Böhlen, Christian S. Jensen:
Speeding Up Reachability Queries in Public Transport Networks Using Graph Partitioning. Inf. Syst. Frontiers 24(1): 11-29 (2022) - [j30]Qing Chen, Oded Lachish, Sven Helmer, Michael H. Böhlen:
Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs. Proc. VLDB Endow. 15(11): 3263-3276 (2022) - [j29]Anton Dignös, Michael H. Böhlen, Johann Gamper, Christian S. Jensen, Peter Moser:
Leveraging range joins for the computation of overlap joins. VLDB J. 31(1): 75-99 (2022) - [j28]Pei Li, Jaroslaw Szlichta, Michael H. Böhlen, Divesh Srivastava:
ABC of order dependencies. VLDB J. 31(5): 825-849 (2022) - [c93]Pei Li, Jessica Jessica, Naida Tania, Michael H. Böhlen, Divesh Srivastava, Jaroslaw Szlichta:
abcOD: Mining Band Order Dependencies. ICDE 2022: 3162-3165 - [i9]Qing Chen, Oded Lachish, Sven Helmer, Michael H. Böhlen:
Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs (Extended version). CoRR abs/2207.06887 (2022) - [i8]Kevin Wellenzohn, Michael H. Böhlen, Sven Helmer, Antoine Pietri, Stefano Zacchiroli:
Robust and Scalable Content-and-Structure Indexing (Extended Version). CoRR abs/2209.05126 (2022) - 2021
- [c92]Kevin Wellenzohn, Luka Popovic, Michael H. Böhlen, Sven Helmer:
Inserting Keys into the Robust Content-and-Structure (RCAS) Index. ADBIS 2021: 121-135 - [c91]Muhammad Saad, Abraham Bernstein, Michael H. Böhlen, Daniele Dell'Aglio:
Single Point Incremental Fourier Transform on 2D Data Streams. ICDE 2021: 852-863 - 2020
- [j27]Mourad Khayati, Philippe Cudré-Mauroux, Michael H. Böhlen:
Scalable recovery of missing blocks in time series with high and low cross-correlations. Knowl. Inf. Syst. 62(6): 2257-2280 (2020) - [j26]Kevin Wellenzohn, Michael H. Böhlen, Sven Helmer:
Dynamic Interleaving of Content and Structure for Robust Indexing of Semi-Structured Hierarchical Data. Proc. VLDB Endow. 13(10): 1641-1653 (2020) - [c90]Bezaye Tesfaye, Nikolaus Augsten, Mateusz Pawlik, Michael H. Böhlen, Christian S. Jensen:
An Efficient Index for Reachability Queries in Public Transport Networks. ADBIS 2020: 34-48 - [c89]Michael H. Böhlen, Oksana Dolmatova, Michael Krauthammer, Alphonse Mariyagnanaseelan, Jonathan Stahl, Timo Surbeck:
Iterations for Propensity Score Matching in MonetDB. ADBIS 2020: 189-203 - [c88]Yvonne Mülle, Michael H. Böhlen:
Query Results over Ongoing Databases that Remain Valid as Time Passes By. ICDE 2020: 1429-1440 - [c87]Pei Li, Jaroslaw Szlichta, Michael H. Böhlen, Divesh Srivastava:
Discovering Band Order Dependencies. ICDE 2020: 1878-1881 - [c86]Oksana Dolmatova, Nikolaus Augsten, Michael H. Böhlen:
Preserving Contextual Information in Relational Matrix Operations. ICDE 2020: 1894-1897 - [c85]Oksana Dolmatova, Nikolaus Augsten, Michael H. Böhlen:
A Relational Matrix Algebra and its Implementation in a Column Store. SIGMOD Conference 2020: 2573-2587 - [i7]Yvonne Mülle, Michael H. Böhlen:
Query Results over Ongoing Databases that Remain Valid as Time Passes By (Extended Version). CoRR abs/2001.05722 (2020) - [i6]Oksana Dolmatova, Nikolaus Augsten, Michael H. Böhlen:
A Relational Matrix Algebra and its Implementation in a Column Store. CoRR abs/2004.05517 (2020) - [i5]Kevin Wellenzohn, Michael H. Böhlen, Sven Helmer:
Dynamic Interleaving of Content and Structure for Robust Indexing of Semi-Structured Hierarchical Data (Extended Version). CoRR abs/2006.05134 (2020)
2010 – 2019
- 2019
- [j25]Anton Dignös, Boris Glavic, Xing Niu, Johann Gamper, Michael H. Böhlen:
Snapshot Semantics for Temporal Multiset Relations. Proc. VLDB Endow. 12(6): 639-652 (2019) - [c84]Katerina Papaioannou, Martin Theobald, Michael H. Böhlen:
Outer and Anti Joins in Temporal-Probabilistic Databases. ICDE 2019: 1742-1745 - [c83]Michael H. Böhlen, Muhammad Saad:
Computing the Fourier Transformation over Temporal Data Streams (Invited Talk). TIME 2019: 1:1-1:4 - [i4]Katerina Papaioannou, Martin Theobald, Michael H. Böhlen:
Generalized Lineage-Aware Temporal Windows: Supporting Outer and Anti Joins in Temporal-Probabilistic Databases. CoRR abs/1902.04379 (2019) - [i3]Anton Dignös, Boris Glavic, Xing Niu, Michael H. Böhlen, Johann Gamper:
Snapshot Semantics for Temporal Multiset Relations (Extended Version). CoRR abs/1902.04938 (2019) - [i2]Pei Li, Michael H. Böhlen, Jaroslaw Szlichta, Divesh Srivastava:
Discovery of Band Order Dependencies. CoRR abs/1905.11948 (2019) - [i1]Katerina Papaioannou, Martin Theobald, Michael H. Böhlen:
Lineage-Aware Temporal Windows: Supporting Set Operations in Temporal-Probabilistic Databases. CoRR abs/1910.00474 (2019) - 2018
- [c82]Katerina Papaioannou, Martin Theobald, Michael H. Böhlen:
Supporting Set Operations in Temporal-Probabilistic Databases. ICDE 2018: 1180-1191 - [c81]Michael H. Böhlen, Anton Dignös, Johann Gamper, Christian S. Jensen:
Database Technology for Processing Temporal Data (Invited Paper). TIME 2018: 2:1-2:7 - [e5]Michael H. Böhlen, Reinhard Pichler, Norman May, Erhard Rahm, Shan-Hung Wu, Katja Hose:
Proceedings of the 21st International Conference on Extending Database Technology, EDBT 2018, Vienna, Austria, March 26-29, 2018. OpenProceedings.org 2018, ISBN 978-3-89318-078-3 [contents] - [e4]Dimitris Sacharidis, Johann Gamper, Michael H. Böhlen:
Proceedings of the 30th International Conference on Scientific and Statistical Database Management, SSDBM 2018, Bozen-Bolzano, Italy, July 09-11, 2018. ACM 2018 [contents] - [r16]Michael H. Böhlen:
Temporal Coalescing. Encyclopedia of Database Systems (2nd ed.) 2018 - [r15]Michael H. Böhlen:
Temporal Query Processing. Encyclopedia of Database Systems (2nd ed.) 2018 - [r14]Michael H. Böhlen, Johann Gamper, Christian S. Jensen, Richard T. Snodgrass:
SQL-Based Temporal Query Languages. Encyclopedia of Database Systems (2nd ed.) 2018 - [r13]Michael H. Böhlen, Christian S. Jensen:
Sequenced Semantics. Encyclopedia of Database Systems (2nd ed.) 2018 - [r12]Michael H. Böhlen, Christian S. Jensen, Richard T. Snodgrass:
Current Semantics. Encyclopedia of Database Systems (2nd ed.) 2018 - [r11]Michael H. Böhlen, Christian S. Jensen, Richard T. Snodgrass:
Nonsequenced Semantics. Encyclopedia of Database Systems (2nd ed.) 2018 - [r10]Michael H. Böhlen, Christian S. Jensen, Richard T. Snodgrass:
Temporal Compatibility. Encyclopedia of Database Systems (2nd ed.) 2018 - [r9]Johann Gamper, Michael H. Böhlen, Christian S. Jensen:
Temporal Aggregation. Encyclopedia of Database Systems (2nd ed.) 2018 - 2017
- [j24]Francesco Cafagna, Michael H. Böhlen, Annelies Bracher:
Category- and selection-enabled nearest neighbor joins. Inf. Syst. 68: 3-16 (2017) - [j23]Francesco Cafagna, Michael H. Böhlen:
Disjoint interval partitioning. VLDB J. 26(3): 447-466 (2017) - [c80]Michael H. Böhlen, Anton Dignös, Johann Gamper, Christian S. Jensen:
Temporal Data Management - An Overview. eBISS 2017: 51-83 - [c79]Kevin Wellenzohn, Michael H. Böhlen, Anton Dignös, Johann Gamper, Hannes Mitterer:
Continuous Imputation of Missing Values in Streams of Pattern-Determining Time Series. EDBT 2017: 330-341 - [c78]Giovanni Mahlknecht, Michael H. Böhlen, Anton Dignös, Johann Gamper:
VISOR: Visualizing Summaries of Ordered Data. SSDBM 2017: 40:1-40:5 - 2016
- [j22]Anton Dignös, Michael H. Böhlen, Johann Gamper, Christian S. Jensen:
Extending the Kernel of a Relational DBMS with Comprehensive Support for Sequenced Temporal Queries. ACM Trans. Database Syst. 41(4): 26:1-26:46 (2016) - [c77]Katerina Papaioannou, Michael H. Böhlen:
TemProRA: Top-k temporal-probabilistic results analysis. ICDE 2016: 1382-1385 - 2015
- [j21]Michael H. Böhlen, Christoph Koch:
Special issue on best papers of VLDB 2013. VLDB J. 24(5): 609-610 (2015) - [c76]Francesco Cafagna, Michael H. Böhlen, Annelies Bracher:
Nearest Neighbour Join with Groups and Predicates. DOLAP 2015: 39-48 - [c75]Mourad Khayati, Michael H. Böhlen, Philippe Cudré-Mauroux:
Using Lowly Correlated Time Series to Recover Missing Values in Time Series: A Comparison Between SVD and CD. SSTD 2015: 237-254 - 2014
- [c74]Bruno Cadonna, Johann Gamper, Michael H. Böhlen:
A Robust Skip-Till-Next-Match Selection Strategy for Event Pattern Matching. ADBIS 2014: 177-191 - [c73]Kevin Wellenzohn, Hannes Mitterer, Johann Gamper, Michael H. Böhlen, Mourad Khayati:
Missing Value Imputation in Time Series Using Top-k Case Matching. Grundlagen von Datenbanken 2014: 77-82 - [c72]Mourad Khayati, Michael H. Böhlen, Johann Gamper:
Memory-efficient centroid decomposition for long time series. ICDE 2014: 100-111 - [c71]Anton Dignös, Michael H. Böhlen, Johann Gamper:
Overlap interval partition join. SIGMOD Conference 2014: 1459-1470 - 2013
- [b2]Nikolaus Augsten, Michael H. Böhlen:
Similarity Joins in Relational Database Systems. Synthesis Lectures on Data Management, Morgan & Claypool Publishers 2013, ISBN 9781627050289, pp. 1-124 - [j20]Nikolaus Augsten, Michael H. Böhlen, Johann Gamper:
The address connector: noninvasive synchronization of hierarchical data sources. Knowl. Inf. Syst. 37(3): 639-663 (2013) - [j19]Michael H. Böhlen, Christoph Koch:
Front Matter. Proc. VLDB Endow. 6(1): i-x (2013) - [c70]Christian Ammendola, Michael H. Böhlen, Johann Gamper:
Efficient Evaluation of Ad-Hoc Range Aggregates. DaWaK 2013: 46-59 - [c69]Anton Dignös, Michael H. Böhlen, Johann Gamper:
Query time scaling of attribute values in interval timestamped databases. ICDE 2013: 1304-1307 - [c68]Markus Innerebner, Michael H. Böhlen, Johann Gamper:
ISOGA: A System for Geographical Reachability Analysis. W2GIS 2013: 180-189 - 2012
- [j18]Mourad Khayati, Jay Martin Anderson, Michael H. Böhlen, Johann Gamper, Manfred Mitterer:
Similarity of chemotherapy histories based on imputed values. Int. J. Medical Eng. Informatics 4(3): 282-298 (2012) - [j17]Juozas Gordevicius, Johann Gamper, Michael H. Böhlen:
Parsimonious temporal aggregation. VLDB J. 21(3): 309-332 (2012) - [j16]Nikolaus Augsten, Michael H. Böhlen, Curtis E. Dyreson, Johann Gamper:
Windowed pq-grams for approximate joins of data-centric XML. VLDB J. 21(4): 463-488 (2012) - [j15]Sven Helmer, Nikolaus Augsten, Michael H. Böhlen:
Measuring structural similarity of semistructured data based on information-theoretic approaches. VLDB J. 21(5): 677-702 (2012) - [c67]Mourad Khayati, Michael H. Böhlen:
REBOM: Recovery of Blocks of Missing Values in Time Series. COMAD 2012: 44-55 - [c66]Bruno Cadonna, Johann Gamper, Michael H. Böhlen:
Efficient event pattern matching with match windows. KDD 2012: 471-479 - [c65]Anton Dignös, Michael H. Böhlen, Johann Gamper:
Temporal alignment. SIGMOD Conference 2012: 433-444 - [c64]Johann Gamper, Michael H. Böhlen, Markus Innerebner:
Scalable Computation of Isochrones with Network Expiration. SSDBM 2012: 526-543 - 2011
- [j14]Michael O. Akinde, Michael H. Böhlen, Damianos Chatziantoniou, Johann Gamper:
theta-Constrained multi-dimensional aggregation. Inf. Syst. 36(2): 341-358 (2011) - [j13]Nikolaus Augsten, Denilson Barbosa, Michael H. Böhlen, Themis Palpanas:
Efficient Top-k Approximate Subtree Matching in Small Memory. IEEE Trans. Knowl. Data Eng. 23(8): 1123-1137 (2011) - [j12]Igor Timko, Michael H. Böhlen, Johann Gamper:
Sequenced spatiotemporal aggregation for coarse query granularities. VLDB J. 20(5): 721-741 (2011) - [c63]Dietrich Christopeit, Michael H. Böhlen, Carl-Christian Kanne, Arturas Mazeika:
Querying Versioned Software Repositories. ADBIS 2011: 42-55 - [c62]Christian Tilgner, Boris Glavic, Michael H. Böhlen, Carl-Christian Kanne:
Declarative Serializable Snapshot Isolation. ADBIS 2011: 170-184 - [c61]Christian Tilgner, Boris Glavic, Michael H. Böhlen, Carl-Christian Kanne:
Smile: Enabling Easy and Fast Development of Domain-Specific Scheduling Protocols. BNCOD 2011: 128-131 - [c60]Johann Gamper, Michael H. Böhlen, Willi Cometti, Markus Innerebner:
Defining isochrones in multimodal spatial networks. CIKM 2011: 2381-2384 - [c59]Bruno Cadonna, Johann Gamper, Michael H. Böhlen:
Sequenced event set pattern matching. EDBT 2011: 33-44 - 2010
- [j11]Nikolaus Augsten, Michael H. Böhlen, Johann Gamper:
The pq-gram distance between ordered labeled trees. ACM Trans. Database Syst. 35(1): 4:1-4:36 (2010) - [c58]Nikolaus Augsten, Denilson Barbosa, Michael H. Böhlen, Themis Palpanas:
TASM: Top-k Approximate Subtree Matching. ICDE 2010: 353-364 - [c57]Romans Kasperovics, Michael H. Böhlen, Johann Gamper:
On the Efficient Construction of Multislices from Recurrences. SSDBM 2010: 42-59
2000 – 2009
- 2009
- [c56]Igor Timko, Michael H. Böhlen, Johann Gamper:
Sequenced spatio-temporal aggregation in road networks. EDBT 2009: 48-59 - [c55]Juozas Gordevicius, Johann Gamper, Michael H. Böhlen:
Parsimonious temporal aggregation. EDBT 2009: 1006-1017 - [c54]Romans Kasperovics, Michael H. Böhlen, Johann Gamper:
Evaluating Exceptions on Time Slices. ER 2009: 251-264 - [c53]Andrej Taliun, Michael H. Böhlen, Arturas Mazeika:
CORE: Nonparametric Clustering of Large Numeric Databases. SDM 2009: 14-25 - [r8]Michael H. Böhlen, Christian S. Jensen, Richard T. Snodgrass:
Current Semantics. Encyclopedia of Database Systems 2009: 544-545 - [r7]Michael H. Böhlen, Christian S. Jensen, Richard T. Snodgrass:
Nonsequenced Semantics. Encyclopedia of Database Systems 2009: 1913-1915 - [r6]Michael H. Böhlen, Christian S. Jensen:
Sequenced Semantics. Encyclopedia of Database Systems 2009: 2619-2621 - [r5]Michael H. Böhlen, Johann Gamper, Christian S. Jensen, Richard T. Snodgrass:
SQL-Based Temporal Query Languages. Encyclopedia of Database Systems 2009: 2762-2768 - [r4]Johann Gamper, Michael H. Böhlen, Christian S. Jensen:
Temporal Aggregation. Encyclopedia of Database Systems 2009: 2924-2929 - [r3]Michael H. Böhlen:
Temporal Coalescing. Encyclopedia of Database Systems 2009: 2932-2936 - [r2]Michael H. Böhlen, Christian S. Jensen, Richard T. Snodgrass:
Temporal Compatibility. Encyclopedia of Database Systems 2009: 2936-2939 - [r1]Michael H. Böhlen:
Temporal Query Processing. Encyclopedia of Database Systems 2009: 3012-3015 - 2008
- [c52]Arturas Mazeika, Michael H. Böhlen, Daniel Trivellato:
Analysis and Interpretation of Visual Hierarchical Heavy Hitters of Binary Relations. ADBIS 2008: 168-183 - [c51]Michael H. Böhlen, Johann Gamper, Christian S. Jensen:
Towards General Temporal Aggregation. BNCOD 2008: 257-269 - [c50]Nikolaus Augsten, Michael H. Böhlen, Curtis E. Dyreson, Johann Gamper:
Approximate Joins for Data-Centric XML. ICDE 2008: 814-823 - [c49]Romans Kasperovics, Michael H. Böhlen, Johann Gamper:
Representing Public Transport Schedules as Repeating Trips. TIME 2008: 54-58 - [c48]Juozas Gordevicius, Johann Gamper, Michael H. Böhlen:
A Greedy Approach Towards Parsimonious Temporal Aggregation. TIME 2008: 88-92 - [p6]Simeon J. Simoff, Michael H. Böhlen, Arturas Mazeika:
Visual Data Mining: An Introduction and Overview. Visual Data Mining 2008: 1-12 - [p5]Michael H. Böhlen, Linas Bukauskas, Arturas Mazeika, Peer Mylov:
The 3DVDM Approach: A Case Study with Clickstream Data. Visual Data Mining 2008: 13-29 - [p4]Arturas Mazeika, Michael H. Böhlen, Peer Mylov:
Using Nested Surfaces for Visual Detection of Structures in Databases. Visual Data Mining 2008: 91-102 - [p3]Daniel Trivellato, Arturas Mazeika, Michael H. Böhlen:
Using 2D Hierarchical Heavy Hitters to Investigate Binary Relationships. Visual Data Mining 2008: 215-235 - [p2]Simeon J. Simoff, Michael H. Böhlen, Arturas Mazeika:
Assisting Human Cognition in Visual Data Mining. Visual Data Mining 2008: 264-280 - [e3]Simeon J. Simoff, Michael H. Böhlen, Arturas Mazeika:
Visual Data Mining - Theory, Techniques and Tools for Visual Analytics. Lecture Notes in Computer Science 4404, Springer 2008, ISBN 978-3-540-71079-0 [contents] - 2007
- [j10]Arturas Mazeika, Michael H. Böhlen, Nick Koudas, Divesh Srivastava:
Estimating the selectivity of approximate string queries. ACM Trans. Database Syst. 32(2): 12 (2007) - [c47]Peter Sune Jørgensen, Michael H. Böhlen:
Versioned Relations: Support for Conditional Schema Changes and Schema Versioning. DASFAA 2007: 1058-1061 - [c46]Markus Innerebner, Michael H. Böhlen, Igor Timko:
A web-enabled extension of a spatio-temporal DBMS. GIS 2007: 34 - 2006
- [j9]Michael H. Böhlen, Johann Gamper, Christian S. Jensen:
An algebraic framework for temporal attribute characteristics. Ann. Math. Artif. Intell. 46(3): 349-374 (2006) - [c45]Stefania Leone, Ela Hunt, Thomas B. Hodel, Michael H. Böhlen, Klaus R. Dittrich:
Design and Implementation of a Document Database Extension. ADBIS Research Communications 2006 - [c44]Arturas Mazeika, Janis Petersons, Michael H. Böhlen:
PPPA: Push and Pull Pedigree Analyzer for Large and Complex Pedigree Databases. ADBIS 2006: 339-352 - [c43]Arturas Mazeika, Michael H. Böhlen:
Cleansing Databases of Misspelled Proper Nouns. CleanDB 2006 - [c42]Romans Kasperovics, Michael H. Böhlen:
Querying Multi-granular Compact Representations. DASFAA 2006: 111-124 - [c41]Michael H. Böhlen, Johann Gamper, Christian S. Jensen:
Multi-dimensional Aggregation for Temporal Data. EDBT 2006: 257-275 - [c40]Stefania Leone, Thomas B. Hodel-Widmer, Michael H. Böhlen, Klaus R. Dittrich:
TeNDaX, a Collaborative Database-Based Real-Time Editor System. EDBT 2006: 1135-1138 - [c39]Linas Baltrunas, Arturas Mazeika, Michael H. Böhlen:
Multi-dimensional Histograms with Tight Bounds for the Error. IDEAS 2006: 105-112 - [c38]Carme Martín, Michael H. Böhlen, Carlos López:
Extending ATSQL to Support Temporally Dependent Information. JISBD 2006: 161-170 - [c37]Michael H. Böhlen, Johann Gamper, Christian S. Jensen:
How Would You Like to Aggregate Your Temporal Data? TIME 2006: 121-136 - [c36]Nikolaus Augsten, Michael H. Böhlen, Johann Gamper:
An Incrementally Maintainable Index for Approximate Lookups in Hierarchical Data. VLDB 2006: 247-258 - [c35]Arturas Mazeika, Michael H. Böhlen, Andrej Taliun:
Adaptive Density Estimation. VLDB 2006: 1191-1194 - 2005
- [c34]Nikolaus Augsten, Michael H. Böhlen, Johann Gamper:
Approximate Matching of Hierarchical Data Using pq-Grams. VLDB 2005: 301-312 - [e2]Michael H. Böhlen, Johann Gamper, Wolfgang Polasek, Maria A. Wimmer:
E-Government: Towards Electronic Democracy, International Conference, TCGOV 2005, Bolzano, Italy, March 2-4, 2005, Proceedings. Lecture Notes in Computer Science 3416, Springer 2005, ISBN 3-540-25016-6 [contents] - 2004
- [c33]Linas Bukauskas, Michael H. Böhlen:
Incremental Observer Relative Data Extraction. BNCOD 2004: 165-177 - [c32]Nikolaus Augsten, Michael H. Böhlen, Johann Gamper:
Reducing the Integration of Public Administration Databases to Approximate Tree Matching. EGOV 2004: 102-107 - [c31]Ole Guttorm Jensen, Michael H. Böhlen:
Multitemporal Conditional Schema Evolution. ER (Workshops) 2004: 441-456 - [c30]Ole Guttorm Jensen, Michael H. Böhlen:
Lossless Conditional Schema Evolution. ER 2004: 610-623 - [c29]Albrecht Schmidt, Michael H. Böhlen:
Parameter Estimation Using B-Trees. IDEAS 2004: 325-333 - [c28]Linas Bukauskas, Michael H. Böhlen:
Query Load Balancing for Incremental Visible Object Extraction. IDEAS 2004: 344-353 - [c27]Michael H. Böhlen:
Toward a Unifying View of Point and Interval Temporal Data Model. TIME 2004: 3-4 - 2003
- [j8]Michael H. Böhlen, Linas Bukauskas, Poul Svante Eriksen, Steffen L. Lauritzen, Arturas Mazeika, Peter Musaeus, Peer Mylov:
3D visual data mining - goals and experiences. Comput. Stat. Data Anal. 43(4): 445-469 (2003) - [j7]Michael O. Akinde, Michael H. Böhlen, Theodore Johnson, Laks V. S. Lakshmanan, Divesh Srivastava:
Efficient OLAP query processing in distributed data warehouses. Inf. Syst. 28(1-2): 111-135 (2003) - [c26]Ralf Hartmut Güting, Michael H. Böhlen, Martin Erwig, Christian S. Jensen, Nikos A. Lorentzos, Enrico Nardelli, Markus Schneider, José Ramon Rios Viqueira:
Spatio-temporal Models and Languages: An Approach Based on Data Types. Spatio-Temporal Databases: The CHOROCHRONOS Approach 2003: 117-176 - [c25]Martin Breunig, Can Türker, Michael H. Böhlen, Stefan Dieker, Ralf Hartmut Güting, Christian S. Jensen, Lukas Relly, Philippe Rigaux, Hans-Jörg Schek, Michel Scholl:
Architectures and Implementations of Spatio-temporal Database Management Systems. Spatio-Temporal Databases: The CHOROCHRONOS Approach 2003: 263-318 - [c24]Linas Bukauskas, Leo Mark, Edward Omiecinski, Michael H. Böhlen:
iTopN: incremental extraction of the N most visible objects. CIKM 2003: 461-468 - [c23]Michael O. Akinde, Michael H. Böhlen:
Efficient Computation of Subqueries in Complex OLAP. ICDE 2003: 163-174 - 2002
- [c22]Ole Guttorm Jensen, Michael H. Böhlen:
Current, Legacy, and Invalid Tuples in Conditionally Evolving Databases. ADVIS 2002: 65-82 - [c21]Michael O. Akinde, Michael H. Böhlen, Theodore Johnson, Laks V. S. Lakshmanan, Divesh Srivastava:
Efficient OLAP Query Processing in Distributed Data Warehouses. EDBT 2002: 336-353 - [c20]Michael O. Akinde, Michael H. Böhlen, Theodore Johnson, Laks V. S. Lakshmanan, Divesh Srivastava:
Efficient OLAP Query Processing in Distributed Data Warehouse. ICDE 2002: 262 - [p1]Michael H. Böhlen, Christian S. Jensen:
Temporal Data Model and Query Language Concepts. Encyclopedia of Information Systems 2002: 437-453 - 2001
- [j6]Curtis E. Dyreson, Michael H. Böhlen, Christian S. Jensen:
MetaXPath. J. Digit. Inf. 2(2) (2001) - [j5]Jan Chomicki, David Toman, Michael H. Böhlen:
Querying ATSQL databases with temporal logic. ACM Trans. Database Syst. 26(2): 145-178 (2001) - [c19]Michael O. Akinde, Michael H. Böhlen:
Generalized MD-Joins: Evaluation and Reduction to SQL. Databases in Telecommunications 2001: 52-67 - [c18]Curtis E. Dyreson, Michael H. Böhlen, Christian S. Jensen:
MetaXPath. Dublin Core Conference 2001: 17-23 - [c17]Mikkel Agesen, Michael H. Böhlen, Lasse Poulsen, Kristian Torp:
A Split Operator for Now-Relative Bitemporal Databases. ICDE 2001: 41-50 - 2000
- [j4]Ralf Hartmut Güting, Michael H. Böhlen, Martin Erwig, Christian S. Jensen, Nikos A. Lorentzos, Markus Schneider, Michalis Vazirgiannis:
A foundation for representing and querying moving objects. ACM Trans. Database Syst. 25(1): 1-42 (2000) - [j3]Michael H. Böhlen, Christian S. Jensen, Richard T. Snodgrass:
Temporal statement modifiers. ACM Trans. Database Syst. 25(4): 407-456 (2000) - [c16]Ole Guttorm Jensen, Michael H. Böhlen:
Evolving Relations. FMLDO 2000: 115-132
1990 – 1999
- 1999
- [c15]Michael O. Akinde, Michael H. Böhlen:
Constructing GPSJ View Graphs. DMDW 1999: 8 - [c14]Michael H. Böhlen, Linas Bukauskas, Curtis E. Dyreson:
The Jungle Database Search Engine. SIGMOD Conference 1999: 584-586 - [c13]Curtis E. Dyreson, Michael H. Böhlen, Christian S. Jensen:
Capturing and Querying Multiple Aspects of Semistructured Data. VLDB 1999: 290-301 - [e1]Michael H. Böhlen, Christian S. Jensen, Michel Scholl:
Spatio-Temporal Database Management, International Workshop STDBM'99, Edinburgh, Scotland, September 10-11, 1999, Proceedings. Lecture Notes in Computer Science 1678, Springer 1999, ISBN 3-540-66401-7 [contents] - 1998
- [c12]Michael O. Akinde, Ole Guttorm Jensen, Michael H. Böhlen:
Minimizing Detail Data in Data Warehouses. EDBT 1998: 293-307 - [c11]Michael H. Böhlen, Renato Busatto, Christian S. Jensen:
Point-Versus Interval-Based Temporal Data Models. ICDE 1998: 192-200 - [c10]Michael H. Böhlen, Christian S. Jensen, Bjørn Skjellaug:
Spatio-temporal database support for legacy applications. SAC 1998: 226-234 - 1997
- [j2]John Bair, Michael H. Böhlen, Christian S. Jensen, Richard T. Snodgrass:
Notions of Upward Compatibility of Temporal Query Languages. Wirtschaftsinf. 39(1): 25-34 (1997) - [c9]Richard T. Snodgrass, Michael H. Böhlen, Christian S. Jensen, Andreas Steiner:
Transitioning Temporal Support in TSQL2 to SQL3. Temporal Databases, Dagstuhl 1997: 150-194 - [c8]Christian S. Jensen, Curtis E. Dyreson, Michael H. Böhlen, James Clifford, Ramez Elmasri, Shashi K. Gadia, Fabio Grandi, Patrick J. Hayes, Sushil Jajodia, Wolfgang Käfer, Nick Kline, Nikos A. Lorentzos, Yannis G. Mitsopoulos, Angelo Montanari, Daniel A. Nonen, Elisa Peressi, Barbara Pernici, John F. Roddick, Nandlal L. Sarda, Maria Rita Scalas, Arie Segev, Richard T. Snodgrass, Michael D. Soo, Abdullah Uz Tansel, Paolo Tiberio, Gio Wiederhold:
The Consensus Glossary of Temporal Database Concepts - February 1998 Version. Temporal Databases, Dagstuhl 1997: 367-405 - [c7]Kristian Torp, Christian S. Jensen, Michael H. Böhlen:
Layered Temporal DBMS: Concepts and Techniques. DASFAA 1997: 371-380 - 1996
- [c6]Michael H. Böhlen, Jan Chomicki, Richard T. Snodgrass, David Toman:
Querying TSQL2 Databases with Temporal Logic. EDBT 1996: 325-341 - [c5]Michael H. Böhlen, Richard T. Snodgrass, Michael D. Soo:
Coalescing in Temporal Databases. VLDB 1996: 180-191 - 1995
- [j1]Michael H. Böhlen:
Temporal Database System Implementations. SIGMOD Rec. 24(4): 53-60 (1995) - [c4]Michael H. Böhlen, Christian S. Jensen, Richard T. Snodgrass:
Evaluating the Completeness of TSQL2. Temporal Databases 1995: 153-172 - [c3]James Clifford, Christian S. Jensen, Richard T. Snodgrass, Michael H. Böhlen, Hasan Dewan, Duri Schmidt:
Panel: The State-of-the-Art in Temporal Data Management: Perspectives from the Research and Financial Applications Communities. Temporal Databases 1995: 356-357 - 1994
- [b1]Michael H. Böhlen:
The Temporal Deductive Database System ChronoLog. Departement Informatik, ETH Zürich, 1994 - [c2]Michael H. Böhlen, Robert W. Marti:
On the Completeness of Temporal Database Query Languages. ICTL 1994: 283-300 - 1993
- [c1]Michael H. Böhlen, Robert W. Marti:
Handling Temporal Knowledge in a Deductive Database System. BTW 1993: 334-345
Coauthor Index
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 2025-04-03 01:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
