Gösta Grahne

Gösta Grahne, Adrian Onet: Anatomy of the chase. CoRR abs/1303.6682 (2013)

Gösta Grahne, Adrian Onet, Nihat Tartal: Conditional Tables in practice. CoRR abs/1304.0959 (2013)

Gösta Grahne, Adrian Onet: Representation systems for data exchange. ICDT 2012: 208-221

Gösta Grahne, Adrian Onet: On Conditional Chase Termination. AMW 2011

Gösta Grahne, Adrian Onet: Closed world chasing. LID 2011: 7-14

Gösta Grahne, Adrian Onet: Data correspondence, exchange and repair. ICDT 2010: 219-230

Gösta Grahne, Alex Thomo: Bounded regular path queries in view-based data integration. Inf. Process. Lett. 109(13): 739-744 (2009)

Gösta Grahne: Certain (and Possible) Answers. Encyclopedia of Database Systems 2009: 315-317

Gösta Grahne: Conditional Tables. Encyclopedia of Database Systems 2009: 446-447

Gösta Grahne: Incomplete Information. Encyclopedia of Database Systems 2009: 1405-1410

Gösta Grahne: Naive Tables. Encyclopedia of Database Systems 2009: 1875-1876

Gösta Grahne: Possible Answers. Encyclopedia of Database Systems 2009: 2125

Gösta Grahne, Alex Thomo, William W. Wadge: Preferential Regular Path Queries. Fundam. Inform. 89(2-3): 259-288 (2008)

Gösta Grahne, Alex Thomo, William W. Wadge: Preferentially Annotated Regular Path Queries. ICDT 2007: 314-328

Gösta Grahne, Alex Thomo: Boundedness of Regular Path Queries in Data Integration Systems. IDEAS 2007: 85-92

Gösta Grahne, Alex Thomo: Regular path queries under approximate semantics. Ann. Math. Artif. Intell. 46(1-2): 165-190 (2006)

Tanbir Ahmed, Gösta Grahne: Parallel Composition of Finite State Activity Automata. DCFS 2006: 46-57

Gösta Grahne, Jianfei Zhu: Fast Algorithms for Frequent Itemset Mining Using FP-Trees. IEEE Trans. Knowl. Data Eng. 17(10): 1347-1362 (2005)

Gösta Grahne, Victoria Kiricenko: Towards an algebraic theory of information integration. Inf. Comput. 194(2): 79-100 (2004)

Jianfei Zhu, Gösta Grahne: Reducing the Main Memory Consumptions of FPmax* and FPclose. FIMI 2004

Gösta Grahne, Alex Thomo: Query Answering and Containment for Regular Path Queries under Distortions. FoIKS 2004: 98-115

Gösta Grahne, Jianfei Zhu: Mining Frequent Itemsets from Secondary Memory. ICDM 2004: 91-98

Gösta Grahne, Jianfei Zhu: Mining Frequent Itemsets from Secondary Memory. CoRR cs.DB/0405069 (2004)

Gösta Grahne, Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen: Design and implementation of a string database query language. Inf. Syst. 28(4): 311-337 (2003)

Gösta Grahne, Alex Thomo: Algebraic rewritings for optimizing regular path queries. Theor. Comput. Sci. 296(3): 453-471 (2003)

Gösta Grahne, Jianfei Zhu: Efficiently Using Prefix-trees in Mining Frequent Itemsets. FIMI 2003

Gösta Grahne, Alex Thomo: New Rewritings and Optimizations for Regular Path Queries. ICDT 2003: 242-258

Gösta Grahne, Alex Thomo: Query containment and rewriting using views for regular path queries under constraints. PODS 2003: 111-122

Gösta Grahne, Victoria Kiricenko: Partial answers in information integration systems. WIDM 2003: 98-101

Gösta Grahne: Information Integration and Incomplete Information. IEEE Data Eng. Bull. 25(3): 46-52 (2002)

Gösta Grahne, Jianfei Zhu: Discovering approximate keys in XML data. CIKM 2002: 453-460

Gösta Grahne, Victoria Kiricenko: Obtaining More Answers from Information Integration Systems. WebDB 2002: 67-72

Giorgio Ghelli, Gösta Grahne (Eds.): Database Programming Languages, 8th International Workshop, DBPL 2001, Frascati, Italy, September 8-10, 2001, Revised Papers. Lecture Notes in Computer Science 2397, Springer 2002, isbn 3-540-44080-1

Gösta Grahne, Laks V. S. Lakshmanan, Xiaohong Wang, Ming Hao Xie: On Dual Mining: From Patterns to Circumstances, and Back. ICDE 2001: 195-204

Gösta Grahne, Alex Thomo: Algebraic Rewritings for Optimizing Regular Path Queries. ICDT 2001: 301-315

Gösta Grahne, Alex Thomo: Approximate Reasoning in Semistructured Data. KRDB 2001

Gösta Grahne: Review - Incomplete Information in Relational Databases. ACM SIGMOD Digital Review 2 (2000)

Gösta Grahne, Laks V. S. Lakshmanan, Xiaohong Wang: Efficient Mining of Constrained Correlated Sets. ICDE 2000: 512-521

Gösta Grahne, Alex Thomo: An Optimization Technique for Answering Regular Path Queries. WebDB (Informal Proceedings) 2000: 99-104

Gösta Grahne, Alex Thomo: An Optimization Technique for Answering Regular Path Queries. WebDB (Selected Papers) 2000: 215-225

Gösta Grahne, Matti Nykänen, Esko Ukkonen: Reasoning about Strings in Databases. J. Comput. Syst. Sci. 59(1): 116-162 (1999)

Kenneth A. Ross, Surajit Chaudhuri, Gösta Grahne, H. V. Jagadish, Jan Van den Bussche, Moshe Y. Vardi: Reminiscences on Influential Papers. SIGMOD Record 28(4): 39-41 (1999)

Gösta Grahne, Emmanuel Waller: How to Make SQL Stand for String Query Language. DBPL 1999: 61-79

Gösta Grahne, Laks V. S. Lakshmanan: On the Difference between Navigating Semi-structured Data and Querying It. DBPL 1999: 271-296

Gösta Grahne, Laks V. S. Lakshmanan, Xiaohong Wang: Interactive Mining of Correlations - A Constraint Perspective. 1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery 1999

Gösta Grahne, Alberto O. Mendelzon: Tableau Techniques for Querying Information Sources through Global Schemas. ICDT 1999: 332-347

Gösta Grahne: Updates and Counterfactuals. J. Log. Comput. 8(1): 87-117 (1998)

Gösta Grahne, Alberto O. Mendelzon, Peter Z. Revesz: Knowledgebase Transformations. J. Comput. Syst. Sci. 54(1): 98-112 (1997)

Gösta Grahne, Matti Nykänen: Safety, Translation and Evaluation of Alignment Calculus. ADBIS 1997: 295-304

Gösta Grahne, Nicolas Spyratos, Daniel Stamate: Semantics and Containment with Internal and External Conjunctions. ICDT 1997: 71-82

Gösta Grahne, Alberto O. Mendelzon: Updates and Subjunctive Queries. Inf. Comput. 116(2): 241-252 (1995)

Gösta Grahne, Matti Nykänen, Esko Ukkonen: Reasoning about Strings in Databases. PODS 1994: 303-312

Gösta Grahne, Alberto O. Mendelzon, Peter Z. Revesz: Knowledgebase Transformations. PODS 1992: 246-260

Gösta Grahne, Alberto O. Mendelzon, Raymond Reiter: On The Semantics of Belief Revision Systems. TARK 1992: 132-142

Gösta Grahne: The Problem of Incomplete Information in Relational Databases. Lecture Notes in Computer Science 554, Springer 1991, isbn 3-540-54919-6

Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen: Efficient Evaluation for a Subset of Recursive Queries. J. Log. Program. 10(3&4): 301-332 (1991)

Serge Abiteboul, Paris C. Kanellakis, Gösta Grahne: On the Representation and Querying of Sets of Possible Worlds. Theor. Comput. Sci. 78(1): 158-187 (1991)

Gösta Grahne: Updates and Counterfactuals. KR 1991: 269-276

Gösta Grahne: Horn Tables - An Efficient Tool for Handling Incomplete Information in Databases. PODS 1989: 75-82

Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen: Efficient Evaluation for a Subset of Recursive Queries. PODS 1987: 284-293

Serge Abiteboul, Paris C. Kanellakis, Gösta Grahne: On the Representation and Querying of Sets of Possible Worlds. SIGMOD Conference 1987: 34-48

Gösta Grahne, Kari-Jouko Räihä: Characterizations for Acyclic Database Schemes. Advances in Computing Research 3: 19-41 (1986)

Serge Abiteboul, Gösta Grahne: Mise-à-jour des Bases de Données contenant de l'information incomplète. BDA 1985

Serge Abiteboul, Gösta Grahne: Update Semantics for Incomplete Databases. VLDB 1985: 1-12

Gösta Grahne, Kari-Jouko Räihä: Dependency Characterizations for Acyclic Database Schemes. PODS 1984: 9-18

Gösta Grahne: Dependency Satisfaction in Databases with Incomplete Information. VLDB 1984: 37-45

Gösta Grahne, Kari-Jouko Räihä: Database Decomposition into Fourth Normal Form. VLDB 1983: 186-196