| 2011 |
| 60 | On Conditional Chase Termination. Gösta Grahne, Adrian Onet. AMW 2011. Web SearchBibTeXDownload |
| 59 | Closed world chasing. Gösta Grahne, Adrian Onet. LID 2011, 7-14. Web SearchBibTeXDownload |
| 2010 |
| 58 | Data correspondence, exchange and repair. Gösta Grahne, Adrian Onet. ICDT 2010, 219-230. Web SearchBibTeXDownload |
| 2009 |
| 57 | Conditional Tables. Gösta Grahne. Encyclopedia of Database Systems 2009, 446-447. Web SearchBibTeXDownload |
| 56 | Possible Answers. Gösta Grahne. Encyclopedia of Database Systems 2009, 2125. Web SearchBibTeXDownload |
| 55 | Naive Tables. Gösta Grahne. Encyclopedia of Database Systems 2009, 1875-1876. Web SearchBibTeXDownload |
| 54 | Certain (and Possible) Answers. Gösta Grahne. Encyclopedia of Database Systems 2009, 315-317. Web SearchBibTeXDownload |
| 53 | Incomplete Information. Gösta Grahne. Encyclopedia of Database Systems 2009, 1405-1410. Web SearchBibTeXDownload |
| 52 | Bounded regular path queries in view-based data integration. Gösta Grahne, Alex Thomo. Inf. Process. Lett. (109): 739-744 (2009). Web SearchBibTeXDownload |
| 2008 |
| 51 | Preferential Regular Path Queries. Gösta Grahne, Alex Thomo, William W. Wadge. Fundam. Inform. (89): 259-288 (2008). Web SearchBibTeXDownload |
| 2007 |
| 50 | Preferentially Annotated Regular Path Queries. Gösta Grahne, Alex Thomo, William W. Wadge. ICDT 2007, 314-328. Web SearchBibTeXDownload |
| 49 | Boundedness of Regular Path Queries in Data Integration Systems. Gösta Grahne, Alex Thomo. IDEAS 2007, 85-92. Web SearchBibTeXDownload |
| 2006 |
| 48 | Regular path queries under approximate semantics. Gösta Grahne, Alex Thomo. Ann. Math. Artif. Intell. (46): 165-190 (2006). Web SearchBibTeXDownload |
| 47 | Parallel Composition of Finite State Activity Automata. Tanbir Ahmed, Gösta Grahne. DCFS 2006, 46-57. Web SearchBibTeX |
| 2005 |
| 46 | Fast Algorithms for Frequent Itemset Mining Using FP-Trees. Gösta Grahne, Jianfei Zhu. IEEE Trans. Knowl. Data Eng. (17): 1347-1362 (2005). Web SearchBibTeXDownload |
| 2004 |
| 45 | Reducing the Main Memory Consumptions of FPmax* and FPclose. Jianfei Zhu, Gösta Grahne. FIMI 2004. Web SearchBibTeXDownload |
| 44 | Query Answering and Containment for Regular Path Queries under Distortions. Gösta Grahne, Alex Thomo. FoIKS 2004, 98-115. Web SearchBibTeXDownload |
| 43 | Mining Frequent Itemsets from Secondary Memory. Gösta Grahne, Jianfei Zhu. ICDM (cs.DB/0405069): 91-98 (2004). Web SearchBibTeXDownload |
| 42 | Towards an algebraic theory of information integration. Gösta Grahne, Victoria Kiricenko. Inf. Comput. (194): 79-100 (2004). Web SearchBibTeXDownload |
| 2003 |
| 41 | Efficiently Using Prefix-trees in Mining Frequent Itemsets. Gösta Grahne, Jianfei Zhu. FIMI 2003. Web SearchBibTeXDownload |
| 40 | New Rewritings and Optimizations for Regular Path Queries. Gösta Grahne, Alex Thomo. ICDT 2003, 242-258. Web SearchBibTeXDownload |
| 39 | Design and implementation of a string database query language. Gösta Grahne, Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen. Inf. Syst. (28): 311-337 (2003). Web SearchBibTeXDownload |
| 38 | Query containment and rewriting using views for regular path queries under constraints. Gösta Grahne, Alex Thomo. PODS 2003, 111-122. Web SearchBibTeXDownload |
| 37 | Algebraic rewritings for optimizing regular path queries. Gösta Grahne, Alex Thomo. Theor. Comput. Sci. (296): 453-471 (2003). Web SearchBibTeXDownload |
| 36 | Partial answers in information integration systems. Gösta Grahne, Victoria Kiricenko. WIDM 2003, 98-101. Web SearchBibTeXDownload |
| 2002 |
| 35 | Discovering approximate keys in XML data. Gösta Grahne, Jianfei Zhu. CIKM 2002, 453-460. Web SearchBibTeXDownload |
| 34 | Information Integration and Incomplete Information. Gösta Grahne. IEEE Data Eng. Bull. (25): 46-52 (2002). Web SearchBibTeXDownload |
| 33 | Obtaining More Answers from Information Integration Systems. Gösta Grahne, Victoria Kiricenko. WebDB 2002, 67-72. Web SearchBibTeXDownload |
| 2001 |
| 32 | On Dual Mining: From Patterns to Circumstances, and Back. Gösta Grahne, Laks V. S. Lakshmanan, Xiaohong Wang, Ming Hao Xie. ICDE 2001, 195-204. Cited by 20Web SearchBibTeXDownload |
| 31 | Algebraic Rewritings for Optimizing Regular Path Queries. Gösta Grahne, Alex Thomo. ICDT 2001, 301-315. Web SearchBibTeXDownload |
| 30 | Approximate Reasoning in Semistructured Data. Gösta Grahne, Alex Thomo. KRDB 2001. Web SearchBibTeXDownload |
| 2000 |
| 29 | Review - Incomplete Information in Relational Databases. Gösta Grahne. ACM SIGMOD Digital Review (2) (2000). Web SearchBibTeX |
| 28 | Efficient Mining of Constrained Correlated Sets. Gösta Grahne, Laks V. S. Lakshmanan, Xiaohong Wang. ICDE 2000, 512-521. Cited by 111Web SearchBibTeXDownload |
| 27 | An Optimization Technique for Answering Regular Path Queries. Gösta Grahne, Alex Thomo. WebDB (Informal Proceedings) 2000, 99-104. Web SearchBibTeXDownload |
| 1999 |
| 26 | Interactive Mining of Correlations - A Constraint Perspective. Gösta Grahne, Laks V. S. Lakshmanan, Xiaohong Wang. 1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery 1999. Cited by 4Web SearchBibTeXDownload |
| 25 | How to Make SQL Stand for String Query Language. Gösta Grahne, Emmanuel Waller. DBPL 1999, 61-79. Web SearchBibTeXDownload |
| 24 | On the Difference between Navigating Semi-structured Data and Querying It. Gösta Grahne, Laks V. S. Lakshmanan. DBPL 1999, 271-296. Cited by 6Web SearchBibTeXDownload |
| 23 | Tableau Techniques for Querying Information Sources through Global Schemas. Gösta Grahne, Alberto O. Mendelzon. ICDT 1999, 332-347. Cited by 141Web SearchBibTeXDownload |
| 22 | Reasoning about Strings in Databases. Gösta Grahne, Matti Nykänen, Esko Ukkonen. J. Comput. Syst. Sci. (59): 116-162 (1999). Web SearchBibTeXDownload |
| 21 | Reminiscences on Influential Papers. Kenneth A. Ross, Amr El Abbadi, Sophie Cluet, Kaladhar Voruganti, Guy M. Lohman, Moshe Y. Vardi, Gultekin Özsoyoglu, Gerhard Weikum, Philip S. Yu, Timos K. Sellis, Patrick Valduriez. SIGMOD Record (28): 110-114 (1999). Web SearchBibTeX |
| 1998 |
| 20 | Updates and Counterfactuals. Gösta Grahne. J. Log. Comput. (8): 87-117 (1998). Web SearchBibTeXDownload |
| 1997 |
| 19 | Safety, Translation and Evaluation of Alignment Calculus. Gösta Grahne, Matti Nykänen. ADBIS 1997, 295-304. Web SearchBibTeX |
| 18 | Semantics and Containment with Internal and External Conjunctions. Gösta Grahne, Nicolas Spyratos, Daniel Stamate. ICDT 1997, 71-82. Web SearchBibTeXDownload |
| 17 | Knowledgebase Transformations. Gösta Grahne, Alberto O. Mendelzon, Peter Z. Revesz. J. Comput. Syst. Sci. (54): 98-112 (1997). Cited by 27Web SearchBibTeXDownload |
| 1995 |
| 16 | Updates and Subjunctive Queries. Gösta Grahne, Alberto O. Mendelzon. Inf. Comput. (116): 241-252 (1995). Cited by 20Web SearchBibTeXDownload |
| 1994 |
| 15 | Reasoning about Strings in Databases. Gösta Grahne, Matti Nykänen, Esko Ukkonen. PODS 1994, 303-312. Web SearchBibTeX |
| 1992 |
| 14 | Knowledgebase Transformations. Gösta Grahne, Alberto O. Mendelzon, Peter Z. Revesz. PODS 1992, 246-260. Cited by 27Web SearchBibTeX |
| 13 | On The Semantics of Belief Revision Systems. Gösta Grahne, Alberto O. Mendelzon, Raymond Reiter. TARK 1992, 132-142. Cited by 14Web SearchBibTeX |
| 1991 |
| 12 | Efficient Evaluation for a Subset of Recursive Queries. Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen. J. Log. Program. (10): 301-332 (1991). Web SearchBibTeXDownload |
| 11 | Updates and Counterfactuals. Gösta Grahne. KR 1991, 269-276. Web SearchBibTeX |
| 10 | On the Representation and Querying of Sets of Possible Worlds. Serge Abiteboul, Paris C. Kanellakis, Gösta Grahne. Theor. Comput. Sci. (78): 158-187 (1991). Cited by 177Web SearchBibTeXDownload |
| 1989 |
| 9 | Horn Tables - An Efficient Tool for Handling Incomplete Information in Databases. Gösta Grahne. PODS 1989, 75-82. Web SearchBibTeX |
| 1987 |
| 8 | Efficient Evaluation for a Subset of Recursive Queries. Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen. PODS 1987, 284-293. Web SearchBibTeX |
| 7 | On the Representation and Querying of Sets of Possible Worlds. Serge Abiteboul, Paris C. Kanellakis, Gösta Grahne. SIGMOD Conference 1987, 34-48. Cited by 177Web SearchBibTeX |
| 1986 |
| 6 | Characterizations for Acyclic Database Schemes. Gösta Grahne, Kari-Jouko Räihä. Advances in Computing Research (3): 19-41 (1986). Web SearchBibTeX |
| 1985 |
| 5 | Mise-à-jour des Bases de Données contenant de l'information incomplète. Serge Abiteboul, Gösta Grahne. BDA 1985. Web SearchBibTeX |
| 4 | Update Semantics for Incomplete Databases. Serge Abiteboul, Gösta Grahne. VLDB 1985, 1-12. Cited by 81Web SearchBibTeX |
| 1984 |
| 3 | Dependency Characterizations for Acyclic Database Schemes. Gösta Grahne, Kari-Jouko Räihä. PODS 1984, 9-18. Web SearchBibTeX |
| 2 | Dependency Satisfaction in Databases with Incomplete Information. Gösta Grahne. VLDB 1984, 37-45. Web SearchBibTeX |
| 1983 |
| 1 | Database Decomposition into Fourth Normal Form. Gösta Grahne, Kari-Jouko Räihä. VLDB 1983, 186-196. Web SearchBibTeX |