The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael H. Böhlen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (6, 0)][DBLP]
    Temporal Databases, Dagstuhl, 1997, pp:367-405 [Conf]
  2. Michael H. Böhlen, Richard T. Snodgrass, Michael D. Soo
    Coalescing in Temporal Databases. [Citation Graph (5, 20)][DBLP]
    VLDB, 1996, pp:180-191 [Conf]
  3. Michael H. Böhlen, Christian S. Jensen, Richard T. Snodgrass
    Evaluating the Completeness of TSQL2 [Citation Graph (3, 0)][DBLP]
    Temporal Databases, 1995, pp:153-172 [Conf]
  4. Richard T. Snodgrass, Michael H. Böhlen, Christian S. Jensen, Andreas Steiner
    Transitioning Temporal Support in TSQL2 to SQL3. [Citation Graph (2, 0)][DBLP]
    Temporal Databases, Dagstuhl, 1997, pp:150-194 [Conf]
  5. Michael H. Böhlen, Jan Chomicki, Richard T. Snodgrass, David Toman
    Querying TSQL2 Databases with Temporal Logic. [Citation Graph (2, 19)][DBLP]
    EDBT, 1996, pp:325-341 [Conf]
  6. Michael H. Böhlen, Renato Busatto, Christian S. Jensen
    Point-Versus Interval-Based Temporal Data Models. [Citation Graph (2, 8)][DBLP]
    ICDE, 1998, pp:192-200 [Conf]
  7. Michael H. Böhlen, Robert W. Marti
    Handling Temporal Knowledge in a Deductive Database System. [Citation Graph (1, 0)][DBLP]
    BTW, 1993, pp:334-345 [Conf]
  8. Kristian Torp, Christian S. Jensen, Michael H. Böhlen
    Layered Temporal DBMS: Concepts and Techniques. [Citation Graph (1, 9)][DBLP]
    DASFAA, 1997, pp:371-380 [Conf]
  9. Michael O. Akinde, Ole Guttorm Jensen, Michael H. Böhlen
    Minimizing Detail Data in Data Warehouses. [Citation Graph (1, 14)][DBLP]
    EDBT, 1998, pp:293-307 [Conf]
  10. Arturas Mazeika, Janis Petersons, Michael H. Böhlen
    PPPA: Push and Pull Pedigree Analyzer for Large and Complex Pedigree Databases. [Citation Graph (0, 0)][DBLP]
    ADBIS, 2006, pp:339-352 [Conf]
  11. Ole Guttorm Jensen, Michael H. Böhlen
    Current, Legacy, and Invalid Tuples in Conditionally Evolving Databases. [Citation Graph (0, 0)][DBLP]
    ADVIS, 2002, pp:65-82 [Conf]
  12. Linas Bukauskas, Michael H. Böhlen
    Incremental Observer Relative Data Extraction. [Citation Graph (0, 0)][DBLP]
    BNCOD, 2004, pp:165-177 [Conf]
  13. 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. [Citation Graph (0, 0)][DBLP]
    Spatio-Temporal Databases: The CHOROCHRONOS Approach, 2003, pp:263-318 [Conf]
  14. Ralf Hartmut Güting, Michael H. Böhlen, Martin Erwig, Christian S. Jensen, Nikos A. Lorentzos, Enrico Nardelli, Markus Schneider, Jose Ramon Rios Viqueira
    Spatio-temporal Models and Languages: An Approach Based on Data Types. [Citation Graph (0, 0)][DBLP]
    Spatio-Temporal Databases: The CHOROCHRONOS Approach, 2003, pp:117-176 [Conf]
  15. Linas Bukauskas, Leo Mark, Edward Omiecinski, Michael H. Böhlen
    iTopN: incremental extraction of the N most visible objects. [Citation Graph (0, 0)][DBLP]
    CIKM, 2003, pp:461-468 [Conf]
  16. Arturas Mazeika, Michael H. Böhlen
    Cleansing Databases of Misspelled Proper Nouns. [Citation Graph (0, 0)][DBLP]
    CleanDB, 2006, pp:- [Conf]
  17. Romans Kasperovics, Michael H. Böhlen
    Querying Multi-granular Compact Representations. [Citation Graph (0, 0)][DBLP]
    DASFAA, 2006, pp:111-124 [Conf]
  18. Michael O. Akinde, Michael H. Böhlen
    Generalized MD-Joins: Evaluation and Reduction to SQL. [Citation Graph (0, 0)][DBLP]
    Databases in Telecommunications, 2001, pp:52-67 [Conf]
  19. Curtis E. Dyreson, Michael H. Böhlen, Christian S. Jensen
    MetaXPath. [Citation Graph (0, 0)][DBLP]
    Dublin Core Conference, 2001, pp:17-23 [Conf]
  20. Michael O. Akinde, Michael H. Böhlen
    Constructing GPSJ View Graphs. [Citation Graph (0, 0)][DBLP]
    DMDW, 1999, pp:8- [Conf]
  21. Michael H. Böhlen, Johann Gamper, Christian S. Jensen
    Multi-dimensional Aggregation for Temporal Data. [Citation Graph (0, 0)][DBLP]
    EDBT, 2006, pp:257-275 [Conf]
  22. Michael O. Akinde, Michael H. Böhlen, Theodore Johnson, Laks V. S. Lakshmanan, Divesh Srivastava
    Efficient OLAP Query Processing in Distributed Data Warehouses. [Citation Graph (0, 0)][DBLP]
    EDBT, 2002, pp:336-353 [Conf]
  23. Stefania Leone, Thomas B. Hodel-Widmer, Michael H. Böhlen, Klaus R. Dittrich
    TeNDaX, a Collaborative Database-Based Real-Time Editor System. [Citation Graph (0, 0)][DBLP]
    EDBT, 2006, pp:1135-1138 [Conf]
  24. Nikolaus Augsten, Michael H. Böhlen, Johann Gamper
    Reducing the Integration of Public Administration Databases to Approximate Tree Matching. [Citation Graph (0, 0)][DBLP]
    EGOV, 2004, pp:102-107 [Conf]
  25. Ole Guttorm Jensen, Michael H. Böhlen
    Multitemporal Conditional Schema Evolution. [Citation Graph (0, 0)][DBLP]
    ER (Workshops), 2004, pp:441-456 [Conf]
  26. Ole Guttorm Jensen, Michael H. Böhlen
    Lossless Conditional Schema Evolution. [Citation Graph (0, 0)][DBLP]
    ER, 2004, pp:610-623 [Conf]
  27. Ole Guttorm Jensen, Michael H. Böhlen
    Evolving Relations. [Citation Graph (0, 0)][DBLP]
    FMLDO, 2000, pp:115-132 [Conf]
  28. Mikkel Agesen, Michael H. Böhlen, Lasse Poulsen, Kristian Torp
    A Split Operator for Now-Relative Bitemporal Databases. [Citation Graph (0, 0)][DBLP]
    ICDE, 2001, pp:41-50 [Conf]
  29. Michael O. Akinde, Theodore Johnson, Laks V. S. Lakshmanan, Divesh Srivastava
    Efficient OLAP Query Processing in Distributed Data Warehouse. [Citation Graph (0, 0)][DBLP]
    ICDE, 2002, pp:262- [Conf]
  30. Michael O. Akinde, Michael H. Böhlen
    Efficient Computation of Subqueries in Complex OLAP. [Citation Graph (0, 0)][DBLP]
    ICDE, 2003, pp:163-0 [Conf]
  31. Michael H. Böhlen, Robert W. Marti
    On the Completeness of Temporal Database Query Languages. [Citation Graph (0, 0)][DBLP]
    ICTL, 1994, pp:283-300 [Conf]
  32. Linas Bukauskas, Michael H. Böhlen
    Query Load Balancing for Incremental Visible Object Extraction. [Citation Graph (0, 0)][DBLP]
    IDEAS, 2004, pp:344-353 [Conf]
  33. Albrecht Schmidt 0002, Michael H. Böhlen
    Parameter Estimation Using B-Trees. [Citation Graph (0, 0)][DBLP]
    IDEAS, 2004, pp:325-333 [Conf]
  34. Linas Baltrunas, Arturas Mazeika, Michael H. Böhlen
    Multi-dimensional Histograms with Tight Bounds for the Error. [Citation Graph (0, 0)][DBLP]
    IDEAS, 2006, pp:105-112 [Conf]
  35. Michael H. Böhlen, Christian S. Jensen, Bjørn Skjellaug
    Spatio-temporal database support for legacy applications. [Citation Graph (0, 0)][DBLP]
    SAC, 1998, pp:226-234 [Conf]
  36. Michael H. Böhlen, Linas Bukauskas, Curtis E. Dyreson
    The Jungle Database Search Engine. [Citation Graph (0, 2)][DBLP]
    SIGMOD Conference, 1999, pp:584-586 [Conf]
  37. 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 [Citation Graph (0, 0)][DBLP]
    Temporal Databases, 1995, pp:356-357 [Conf]
  38. Michael H. Böhlen
    Toward a Unifying View of Point and Interval Temporal Data Model. [Citation Graph (0, 0)][DBLP]
    TIME, 2004, pp:3-4 [Conf]
  39. Michael H. Böhlen, Johann Gamper, Christian S. Jensen
    How Would You Like to Aggregate Your Temporal Data? [Citation Graph (0, 0)][DBLP]
    TIME, 2006, pp:121-136 [Conf]
  40. Nikolaus Augsten, Michael H. Böhlen, Johann Gamper
    Approximate Matching of Hierarchical Data Using pq-Grams. [Citation Graph (0, 0)][DBLP]
    VLDB, 2005, pp:301-312 [Conf]
  41. Nikolaus Augsten, Michael H. Böhlen, Johann Gamper
    An Incrementally Maintainable Index for Approximate Lookups in Hierarchical Data. [Citation Graph (0, 0)][DBLP]
    VLDB, 2006, pp:247-258 [Conf]
  42. Curtis E. Dyreson, Michael H. Böhlen, Christian S. Jensen
    Capturing and Querying Multiple Aspects of Semistructured Data. [Citation Graph (0, 17)][DBLP]
    VLDB, 1999, pp:290-301 [Conf]
  43. Arturas Mazeika, Michael H. Böhlen, Andrej Taliun
    Adaptive Density Estimation. [Citation Graph (0, 0)][DBLP]
    VLDB, 2006, pp:1191-1194 [Conf]
  44. Michael H. Böhlen, Johann Gamper, Christian S. Jensen
    An algebraic framework for temporal attribute characteristics. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2006, v:46, n:3, pp:349-374 [Journal]
  45. Michael O. Akinde, Michael H. Böhlen, Theodore Johnson, Laks V. S. Lakshmanan, Divesh Srivastava
    Efficient OLAP query processing in distributed data warehouses. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 2003, v:28, n:1-2, pp:111-135 [Journal]
  46. Curtis E. Dyreson, Michael H. Böhlen, Christian S. Jensen
    MetaXPath. [Citation Graph (0, 0)][DBLP]
    J. Digit. Inf., 2001, v:2, n:2, pp:- [Journal]
  47. Michael H. Böhlen
    Temporal Database System Implementations. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 1995, v:24, n:4, pp:53-60 [Journal]
  48. Michael H. Böhlen, Christian S. Jensen, Richard T. Snodgrass
    Temporal statement modifiers. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2000, v:25, n:4, pp:407-456 [Journal]
  49. Jan Chomicki, David Toman, Michael H. Böhlen
    Querying ATSQL databases with temporal logic. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2001, v:26, n:2, pp:145-178 [Journal]
  50. 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 quering moving objects. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2000, v:25, n:1, pp:1-42 [Journal]
  51. John Bair, Michael H. Böhlen, Christian S. Jensen, Richard T. Snodgrass
    Notions of Upward Compatibility of Temporal Query Languages. [Citation Graph (0, 0)][DBLP]
    Wirtschaftsinformatik, 1997, v:39, n:1, pp:25-34 [Journal]
  52. 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. [Citation Graph (0, 0)][DBLP]
    Computational Statistics & Data Analysis, 2003, v:43, n:4, pp:445-469 [Journal]
  53. Stefania Leone, Ela Hunt, Thomas B. Hodel, Michael Boehlen, Klaus R. Dittrich
    Design and Implementation of a Document Database Extension. [Citation Graph (0, 0)][DBLP]
    ADBIS Research Communications, 2006, pp:- [Conf]
  54. Peter Sune Jørgensen, Michael H. Böhlen
    Versioned Relations: Support for Conditional Schema Changes and Schema Versioning. [Citation Graph (0, 0)][DBLP]
    DASFAA, 2007, pp:1058-1061 [Conf]
  55. Carme Martín, Michael H. Böhlen, Carlos López
    Extending ATSQL to Support Temporally Dependent Information. [Citation Graph (0, 0)][DBLP]
    JISBD, 2006, pp:161-170 [Conf]
  56. Arturas Mazeika, Michael H. Böhlen, Nick Koudas, Divesh Srivastava
    Estimating the selectivity of approximate string queries. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2007, v:32, n:2, pp:12- [Journal]

  57. Analysis and Interpretation of Visual Hierarchical Heavy Hitters of Binary Relations. [Citation Graph (, )][DBLP]


  58. Towards General Temporal Aggregation. [Citation Graph (, )][DBLP]


  59. Sequenced spatio-temporal aggregation in road networks. [Citation Graph (, )][DBLP]


  60. Parsimonious temporal aggregation. [Citation Graph (, )][DBLP]


  61. Evaluating Exceptions on Time Slices. [Citation Graph (, )][DBLP]


  62. A web-enabled extension of a spatio-temporal DBMS. [Citation Graph (, )][DBLP]


  63. Approximate Joins for Data-Centric XML. [Citation Graph (, )][DBLP]


  64. TASM: Top-k Approximate Subtree Matching. [Citation Graph (, )][DBLP]


  65. CORE: Nonparametric Clustering of Large Numeric Databases. [Citation Graph (, )][DBLP]


  66. On the Efficient Construction of Multislices from Recurrences. [Citation Graph (, )][DBLP]


  67. Representing Public Transport Schedules as Repeating Trips. [Citation Graph (, )][DBLP]


  68. A Greedy Approach Towards Parsimonious Temporal Aggregation. [Citation Graph (, )][DBLP]


Search in 0.282secs, Finished in 0.284secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002