| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Georg Lausen Georg Lausen, Dan Suciu : Database Programming Languages, 9th International Workshop, DBPL 2003, Potsdam, Germany, September 6-8, 2003, Revised Papers Springer 2004 Cai-Nicolas Ziegler , Georg Lausen: Analyzing Correlation between Trust and User Similarity in Online Communities. iTrust 2004 : 251-265 Jürgen Angele , Georg Lausen: Ontologies in F-logic. Handbook on Ontologies 2004 : 29-50 Wolfgang May , Georg Lausen: A uniform framework for integration of information from the web. Inf. Syst. 29 (1): 59-91 (2004) Pedro José Marrón , Georg Lausen, Martin Weber : Catalog Integration Made Easy. BTW 2003 : 98-107 Matthias Ihle , Pedro José Marrón , Georg Lausen: Processing XML on Top of Conventional Filesystems. Berliner XML Tage 2003 : 183-197 Georg Lausen, Fang Wei : On the Containment of Conjunctive Queries. Computer Science in Perspective 2003 : 231-244 Pedro José Marrón , Georg Lausen, Martin Weber : Catalog Integration Made Easy. ICDE 2003 : 677-679 Fang Wei , Georg Lausen: Containment of Conjunctive Queries with Safe Negation. ICDT 2003 : 346-360 Georg Lausen, Wolfgang May : Anfragen, Ändern und Transformieren von XML. Web & Datenbanken 2003 : 65-97 Pedro José Marrón , Georg Lausen: Efficient Cache Answerability for XPath Queries. DIWeb 2002 : 35-45 Fang Wei , Georg Lausen: Conjunctive Query Containment in the Presence of Disjunctive Integrity Constraints. Description Logics 2002 Pedro José Marrón , Georg Lausen: Efficient Cache Answerability for XPath Queries. EEXTT 2002 : 183-199 Fang Wei , Georg Lausen: Conjunctive Query Containment in the Presence of Disjunctive Integrity Constraints. KRDB 2002 Georg Lausen, Pedro José Marrón : Adaptive Evaluation Techniques for Querying XML-based E-Catalogs. RIDE 2002 Lule Ahmedi , Georg Lausen: Ontology-Based Querying of Linked XML Documents. Semantic Web Workshop 2002 Lule Ahmedi , Pedro José Marrón , Georg Lausen: LDAP-based Ontology for Information Integration. BTW 2001 : 207-214 Fang Wei , Georg Lausen: A Formal Analysis of the Lightweight Directory Access Protocol. ER (Workshops) 2001 : 306-319 Lule Ahmedi , Pedro José Marrón , Georg Lausen: Ontology-based Access to heterogeneous XML Data. GI Jahrestagung (1) 2001 : 337-344 Pedro José Marrón , Georg Lausen: On Processing XML in LDAP. VLDB 2001 : 601-610 Iztok Savnik , Georg Lausen, Hans-Peter Kahle , Heinrich Spiecker , Sebastian Hein : Algorithm for Matching Sets of Time Series. PKDD 2000 : 277-288 Georg Lausen, Iztok Savnik , Aldar Dougarjapov : MSTS: A System for Mining Sets of Time Series. PKDD 2000 : 289-298 Wolfgang May , Rainer Himmeröder , Georg Lausen, Bertram Ludäscher : A Unified Framework for Wrapping, Mediating and Restructuring Information from the Web. ER (Workshops) 1999 : 307-320 Rainer Himmeröder , Paul-Thomas Kandzia , Bertram Ludäscher , Wolfgang May , Georg Lausen: Search, Analysis, and Integration of Web Documents: A Case Study with FLORID. DDLP 1998 : 47-58 Georg Lausen, Bertram Ludäscher , Wolfgang May : On Logical Foundations of Active Databases. Logics for Databases and Information Systems 1998 : 389-422 Georg Lausen, Bertram Ludäscher , Wolfgang May : On Active Deductive Databases: The Statelog Approach. Transactions and Change in Logic Databases 1998 : 69-106 Bertram Ludäscher , Rainer Himmeröder , Georg Lausen, Wolfgang May , Christian Schlepphorst : Managing Semistructured Data with FLORID: A Deductive Object-Oriented Perspective. Inf. Syst. 23 (8): 589-613 (1998) Bertram Ludäscher , Georg Lausen: Handling Termination in a Logical Language for Active Rules. Informatica (Lithuanian Academy of Sciences) 9 (1): 65-84 (1998) Jürgen Frohn , Rainer Himmeröder , Paul-Thomas Kandzia , Georg Lausen, Christian Schlepphorst : FLORID - Ein Prototyp fuer F-Logik. BTW 1997 : 100-117 Wolfgang May , Bertram Ludäscher , Georg Lausen: Well-Founded Semantics for Deductive Object-Oriented Database Languages. DOOD 1997 : 320-336 Rainer Himmeröder , Georg Lausen, Bertram Ludäscher , Christian Schlepphorst : On a Declarative Semantics for Web Queries. DOOD 1997 : 386-398 Jürgen Frohn , Rainer Himmeröder , Paul-Thomas Kandzia , Georg Lausen, Christian Schlepphorst : FLORID: A Prototype for F-Logic. ICDE 1997 : 583 Bertram Ludäscher , Wolfgang May , Georg Lausen: Referential Actions as Logic Rules. PODS 1997 : 217-227 Wolfgang May , Christian Schlepphorst , Georg Lausen: Integrating Dynamic Aspects into Deductive Object-Oriented Databases. Rules in Database Systems 1997 : 20-34 Bertram Ludäscher , Wolfgang May , Georg Lausen: Nested Transactions in a Logical Language for Active Rules. Logic in Databases 1996 : 197-222 Georg Lausen: Datenbanksysteme in Büro, Technik und Wissenschaft (BTW), GI-Fachtagung, Dresden, 22.-24. März 1995, Proceedings Springer 1995 Bertram Ludäscher , Ulrich Hamann , Georg Lausen: A Logical Framework for Active Rules. COMAD 1995 : 0- Georg Lausen, Eljas Soisalon-Soininen : Safety by Uninterpreted Locks Inf. Comput. 117 (1): 37-49 (1995) Michael Kifer , Georg Lausen, James Wu : Logical Foundations of Object-Oriented and Frame-Based Languages. J. ACM 42 (4): 741-843 (1995) Georg Lausen, Bertram Ludäscher : Updates by Reasoning about States. East/West Database Workshop 1994 : 17-30 Jürgen Frohn , Georg Lausen, Heinz Uphoff : Access to Objects by Path Expressions and Rules. VLDB 1994 : 273-284 Jürgen Frohn , Georg Lausen: Integration heterogener relationaler Datenbankschemata mittels eines objektorientierten Datenmodells. BTW 1993 : 285-295 Georg Lausen, Kai von Luck : Verwaltung und Verarbeitung von strukturierten Objekten. KI 1993 : 183-185 Serge Abiteboul , Georg Lausen, Heinz Uphoff , Emmanuel Waller : Methods and Rules. SIGMOD Conference 1993 : 32-41 Georg Lausen, Gunter Saake : A Possible World Semantics for Updates by Versioning. FMLDO 1992 : 36-47 Georg Lausen, Heinz Uphoff : Nicht-Monotone Vererbung in F-Logik. Grundlagen von Datenbanken 1992 : 105-109 Michael Kramer , Georg Lausen, Gunter Saake : Updates in a Rule-Based Language for Objects. VLDB 1992 : 251-262 Georg Lausen: Locking Based on a Pairwise Decomposition of the Transaction System. Discrete Applied Mathematics 40 (2): 217-236 (1992) Jürgen Seib , Georg Lausen: Parallele Evaluierung von Datalog-Programmen. BTW 1991 : 344-361 Jürgen Seib , Georg Lausen: Parallelizing Datalog Programs by Generalized Pivoting. PODS 1991 : 241-251 Georg Lausen, Beate Marx : Eine Einführung in Frame-Logik. Entwicklungstendenzen bei Datenbanksystemen 1991 : 173-202 Georg Lausen, Beate Marx : Evaluation Aspects of an Object-oriented Deductive Database Language. Query Processing for Advanced Database Systems, Dagstuhl 1991 : 177-200 Andreas Oberweis , Jürgen Seib , Georg Lausen: PASIPP: Ein Hilfsmittel zur Analyse und Simulation von Prädikate/Transitionen-Netzen. Wirtschaftsinformatik 33 (3): 219-230 (1991) Georg Lausen, Eljas Soisalon-Soininen , Peter Widmayer : On the Power of Safe Locking. J. Comput. Syst. Sci. 40 (2): 269-288 (1990) Georg Lausen, Eljas Soisalon-Soininen : Locling Policies and Predeclared Transactions. MFDBS 1989 : 317-336 Michael Kifer , Georg Lausen: F-Logic: A Higher-Order language for Reasoning about Objects, Inheritance, and Scheme. SIGMOD Conference 1989 : 134-146 Georg Lausen: Modeling and Analysis of the Behavior of Information Systems. IEEE Trans. Software Eng. 14 (11): 1610-1620 (1988) Georg Lausen, Helmut Müller , Tibor Németh , Andreas Oberweis , Frank Schönthaler , Wolffried Stucky : Integritätssicherung für die datenbankgestützte Software-Produktionsumgebung INCOME. BTW 1987 : 152-156 Frank Schönthaler , Andreas Oberweis , Georg Lausen, Wolffried Stucky : Prototyping zur Unterstützung des konzeptuellen Entwurfs interaktiver Informationssysteme. EMISA 1987 : 155-180 Andreas Oberweis , Georg Lausen: On the Representation of Temporal Knowledge in Office Systems. Temporal Aspects in Information Systems 1987 : 125-139 Georg Lausen, Eljas Soisalon-Soininen , Peter Widmayer : Towards Online Schedulers Based on Pre-Analysis Locking. ICDT 1986 : 242-259 Georg Lausen, Eljas Soisalon-Soininen , Peter Widmayer : Pre-analysis Locking Information and Control 70 (2/3): 193-215 (1986) Georg Lausen: Conceptual Modelling Based on Net Refinements. DS-1 1985 : 41-57 Georg Lausen, Andreas Oberweis , Frank Schönthaler : Formale Beschreibung von Anforderungen: Eine netzorientierte Vorgehensweise zur konzeptuellen Modellierung von Informationssystemen. GI Jahrestagung 1985 : 156-167 Georg Lausen, Eljas Soisalon-Soininen , Peter Widmayer : Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy. VLDB 1985 : 270-281 Georg Lausen, Eljas Soisalon-Soininen , Peter Widmayer : Maximal Concurrency by Locking. PODS 1984 : 38-44 Georg Lausen: Integrated Concurrency Control in Shared B-Trees. Computing 33 (1): 13-26 (1984) Georg Lausen: Formal aspects of optimistic concurrency control in a multiple version database system. Inf. Syst. 8 (4): 291-301 (1983) Georg Lausen: Concurrency Control in Versionen-Datenbanksystemen. GI Jahrestagung 1982 : 669-683 R. Krieger , Georg Lausen, Wolffried Stucky : Methodischer Datenentwurf beim Aufbau betrieblicher Informationssysteme. Angewandte Informatik 24 (3): 191-203 (1982) Georg Lausen: Serializability Problems of Interleaved Database Transactions. ECI 1981 : 252-265 Jakob Karszt , R. Krieger , Georg Lausen, Wolffried Stucky : Designing the Conceptual Database Schema - A Framework for an Interactive Approach. GI Jahrestagung 1981 : 216-226 1 [ 29 ] 2 [ 54 ] [ 56 ] [ 57 ] 3 [ 70 ] 4 [ 51 ] 5 [ 31 ] [ 32 ] [ 41 ] [ 44 ] 6 [ 36 ] 7 [ 52 ] 8 [ 41 ] [ 42 ] [ 44 ] [ 46 ] [ 49 ] [ 50 ] 9 [ 67 ] 10 [ 52 ] 11 [ 41 ] [ 44 ] [ 49 ] 12 [ 1 ] 13 [ 17 ] [ 34 ] 14 [ 26 ] 15 [ 1 ] [ 3 ] 16 [ 30 ] 17 [ 33 ] [ 36 ] [ 38 ] [ 40 ] [ 42 ] [ 43 ] [ 45 ] [ 46 ] [ 47 ] [ 48 ] [ 49 ] [ 50 ] 18 [ 53 ] [ 54 ] [ 56 ] [ 58 ] [ 60 ] [ 62 ] [ 65 ] [ 67 ] [ 68 ] 19 [ 21 ] [ 22 ] 20 [ 38 ] [ 39 ] [ 40 ] [ 43 ] [ 46 ] [ 47 ] [ 48 ] [ 49 ] [ 50 ] [ 63 ] [ 69 ] 21 [ 15 ] 22 [ 15 ] 23 [ 9 ] [ 13 ] [ 14 ] [ 15 ] [ 20 ] 24 [ 26 ] [ 28 ] 25 [ 51 ] [ 52 ] 26 [ 39 ] [ 41 ] [ 42 ] [ 44 ] [ 46 ] 27 [ 9 ] [ 14 ] [ 15 ] 28 [ 20 ] [ 23 ] [ 24 ] 29 [ 7 ] [ 8 ] [ 11 ] [ 12 ] [ 18 ] [ 19 ] [ 35 ] 30 [ 52 ] 31 [ 1 ] [ 3 ] [ 14 ] [ 15 ] 32 [ 72 ] 33 [ 27 ] [ 29 ] [ 32 ] 34 [ 29 ] 35 [ 65 ] [ 68 ] 36 [ 55 ] [ 59 ] [ 61 ] [ 64 ] [ 66 ] 37 [ 7 ] [ 8 ] [ 11 ] [ 12 ] [ 19 ] 38 [ 34 ] 39 [ 71 ]  ©2004 Association for Computing Machinery |
