Gösta (Gus) Grahne






Selected publications

  1. Universal provenance for regular path queries. (with T. Liu and N. Shiri). 14th Internationsl Workshop on Theory and Practice of Provenance. June 17, 2022, Philadelpia, PA, ACM pdf . talk
  2. Universal (and Existential) Nulls. (with A. Moallemi). Fundamenta Informaticae 167 (2019), pp. 287-321. Preprint
  3. A useful four-valued database logic. (with A. Moallemi). 22nd International Database Engineering & Applications Symposium (IDEAS 2018). Villa San Giovanni, Italy, June 2018, pp. 22-30 Preprint
  4. Universal Nulls (Extended Abstract) (with A. Moallemi). 12th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2018). pdf
  5. Anatomy of the Chase (with A. Onet). Fundamenta Informaticae 157 (2018), pp. 221-270. Preprint
  6. DFA Minimization in Map-Reduce (with S. Harrafi, Iraj Hedayati, and Ali Moallemi). 3rd ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, BeyondMR@SIGMOD 2016 pdf
  7. Intuitionistic Data Exchange (with A. Moallemi and A. Onet). 9th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2015). pdf
  8. Recovering Exchanged Data (with A. Moallemi and A. Onet). 34th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2015) pp. 105-116 pdf
  9. Computing NFA Intersections in Map-Reduce (with S. Harrafi, Ali Moallemi, and A. Onet). EDBT/ICDT Workshops 2015: 42-45. pdf
  10. The data-exchange chase under the microscope (with A. Onet). Revised version of Anatomy of the chase). July 2014. arXiv
  11. Anatomy of the chase (with A. Onet). March 2013. arXiv
  12. PossDB: An Uncertainty Database Management System (with A. Onet and N. Tartal). 7th International Conference on Scalable Uncertainty Management (SUM 2013), Washington, DC. pp. 274--254 pdf
  13. Representation systems for data exchange (with A. Onet). 15th International Conference on Database Theory (ICDT 2012). Berlin, Germany. pp. 208--221 pdf
  14. On Conditional Chase Termination. (with A. Onet). 5th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2011). pdf
  15. Closed World Chasing (with A. Onet). 3rd International Workshop on Logic in Databases (LID 2011), pp. 7-14. pdf
  16. Data Correspondence, Exchange and Repair (with A. Onet). 13th International Conference on Database Theory (ICDT 2010). Lausanne, Switzerland, pp. 219-230. pdf
  17. Bounded Regular Path Queries in View-Based Data Integration. (with A. Thomo). Information Processing Letters 109(13), pp. 739-744 (2009). Preprint
  18. Incomplete Information. Encyclopedia of Databases. Springer Verlag, 2009. Preprint
  19. Conditional Tables. Encyclopedia of Databases. Springer Verlag, 2009. Preprint
  20. Naive Tables. Encyclopedia of Databases. Springer Verlag, 2009. Preprint
  21. Certain (and Possible) answers. Encyclopedia of Databases. Springer Verlag, 2009. Preprint
  22. Preferential Regular Path Queries (with A. Thomo and W. W. Wadge). Fundamenta Informaticae 89(2-3), pp. 259-288 Preprint
  23. Boundedness of Regular Path Queries in Data Integration Systems (with A. Thomo). 11th IEEE Database Engineering & Applications Symposium (IDEAS'07) :85-92 (2007). pdf
  24. Preferentially Annotated Regular Path Queries (with A. Thomo and W. W. Wadge). 11th International Conference on Database Theory (ICDT '07). Barcelona, Spain :314-328. pdf
  25. Regular path queries under approximate semantics (with A. Thomo). Ann. Math. Artif. Intell. 46(1-2), pp. 165-190 (2006)
  26. Fast Algorithms for Frequent Itemset Mining Using FP-Trees (with J. Zhu). IEEE Trans. Knowl. Data Eng. 17(10), pp. 1347-1362 (2005). Preprint
  27. Reducing the main memory consumptions of FPmax* and FPclose (with J. Zhu). 2nd IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI '04). pdf
  28. Mining Frequent Itemsets from Secondary Memory (with J. Zhu). 4th IEEE International Conference on Data Mining (ICDM 2004) Brighton, UK: 91-98. pdf
  29. Towards an Algebraic Theory of Information Integration (with V. Kiricenko). Information and Computation. 194(2) pp. 79-100, (2004). Special Issue dedicated to Paris C. Kanellakis . Preprint
  30. Query Answering and Containment for Regular Path Queries under Distortions (with A. Thomo). 3rd. Intl. Symp. on Foundations of Information and Knowledge Systems (FoIKS '04) : 98-115. pdf
  31. Efficiently Using Prefix-trees in Mining Frequent Itemsets (with J. Zhu). IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI '03) pdf
  32. Query containment and rewriting using views for regular path queries under constraints (with A. Thomo). 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '03) :111-122. pdf
  33. New Rewritings and Optimizations for Regular Path Queries (with A. Thomo) 9th International Conference on Database Theory (ICDT '03). Siena, Italy. full paper
  34. Design and Implementation of a String Database Query Language (with R. Hakli, M. Nykanen, H. Tamm, and E. Ukkonen). Information Systems, 28(4), pp. 311-337 (2003). Preprint
  35. Partial Answers in Information Integration Systems (with V. Kiricenko). 5th ACM CIKM Intl. Workshop on Web Information and Data Management (WIDM 03). New Orleans, Lousiana. pdf
  36. Algebraic rewritings for optimizing regular path queries (with A. Thomo). Theor. Comput. Sci. (TCS) 296(3), pp. 453-471 (2003)
  37. High Performance Mining of Maximal Frequent Itemsets (with J. Zhu). 6th International Workshop on High Performance Data Mining (HPDM '03) pdf
  38. Database Programming Languages, 8th International Workshop (DBPL 2001) (Editor, with G. Ghelli) Frascati, Italy, September 8-10, 2001, Revised Papers. Springer 2002
  39. Discovering approximate keys in XML data (with J. Zhu). ACM CIKM International Conference on Information and Knowledge Management (CIKM '02) :453-460. pdf
  40. Information Integration and Incomplete Information. Bull. of the IEEE Computer Society Technical Committee on Data Engineering. September 2002, pp. 46-52 (2002). ps
  41. Obtaining More Answers from Information Integration Systems (with V. Kiricenko). 5th International Workshop on the Web and Databases (WebDB 2002). pdf
  42. Approximate Reasoning in Semi-structured Databases (with A. Thomo). 8th International Workshop on Knowledge Representation meets Databases (KRDB2001). ps
  43. On Dual Mining: From Patterns to Circumstances, and Back (with V. S. Lakshmanan, X. Wang, and M. H. Xie). 17th International Conference on Data Engineering (ICDE '01). Heidelberg, Germany (2001): 195-204 ps
  44. Algebraic rewritings for optimizing regular path queries (with A. Thomo). 8th International Conference on Database Theory (ICDT '01). London, UK (2001): 301-315. ps
  45. Efficient Mining of Constrained Correlated Sets (with V. S. Lakshmanan and X. Wang). 16th International Conference on Data Engineering (ICDE 2000). ps
  46. An Optimization Technique for Answering Regular Path Queries (with A. Thomo). 3rd International Workshop on the Web and Databases (WebDB 2000). ps
  47. Review - Incomplete Information in Relational Databases. ACM SIGMOD Digital Review 2: 2000.
  48. How to make SQL stand for String Query Language (with E. Waller). 7th International Workshop on Database Programming Languages (DBPL '99). Kinloch Rannoch, Scotland (1999): 61-79. ps
  49. On the Difference between Navigating Semi-structured Data and Querying It (with V. S. Lakshmanan). 7th International Workshop on Database Programming Languages (DBPL '99). Kinloch Rannoch, Scotland (1999): 271-296. ps
  50. Interactive Mining of Correlations - A Constraint Perspective (with V. S. Lakshmanan and X. Wang). ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery 1999. ps
  51. Reasoning about strings in databases (with M. Nykanen and E. Ukkonen). Journal of Computer and System Sciences 59(1), pp. 116-162 (1999). Preprint
  52. Tableau Techniques for Querying Information Sources through Global Schemas (with A. O. Mendelzon). 7th International Conference on Database Theory (ICDT '99). Delphi, Greece (1999): 332-347. ps
  53. Reminiscences on Influential Papers. SIGMOD Record 28(4), pp. 39-41 (1999)
  54. AQL: An alignment based language for querying string databases (with R. Hakli, M. Nykanen and E. Ukkonen). Proceedings of the 9TH International Conference on Management of Data (Comad '98) Hyderabad, India (1998). ps
  55. Updates and counterfactuals. Journal of Logic and Computation. 8(1), pp. 87-117 (1998). Preprint
  56. Safety, translation and evaluation of alignment calculus (with M. Nykanen). Proceedings of the First East-European Symposium on Advances in Databases and Information Systems (ADBIS'97). St. Petersburg, Russia (1997): 295-304. ps
  57. Semantics and containment of queries with internal and external conjunctions (with N. Spyratos and D. Stamate). 6th International Conference on Database Theory (ICDT '97). Delphi, Greece (1997): 71-82. ps
  58. Knowledgebase transformations (with A. O. Mendelzon and P. Z. Revesz). Journal of Computer and System Sciences 54(1), pp. 98-112 (1997). Preprint
  59. Updates and subjunctive queries (with A. O. Mendelzon). Information and Computation 116(2), pp. 241-252 (1995). Preprint
  60. Reasoning about strings in databases (with M. Nykanen and E. Ukkonen). 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '03) Minneapolis, Minnesota (1994) :303-312. ps
  61. On the semantics of belief revision systems (with A. O. Mendelzon and R. Reiter). Proceedings of the 4th Conference on Theoretical Aspects of Reasoning about Knowledge. Asilomar, California (1992): 132-142.
  62. Updates and Counterfactuals 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR '91). Cambridge, Ma. (1991): 269-276.
  63. Efficient Evaluation for a Subset of Recursive Queries (with S. Sippu and E. Soisalon-Soininen). Journal of Logic Programmin (JLP) 10(1/2/3&4), pp. 301-332 (1991)
  64. On the Representation and Querying of Sets of Possible Worlds (with S. Abiteboul and P. C. Kanellakis). Theor. Comput. Sci. (TCS) 78(1), pp. 158-187 (1991). Preprint
  65. The Problem of Incomplete Information in Relational Databases. Lecture Notes in Computer Science, vol. 554. Springer-Verlag, Berlin 1991. Flyer
  66. Horn Tables - An Efficient Tool for Handling Incomplete Information in Databases. 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '89) Philadelphia, Pennsylvania (1989) :75-82. pdf
  67. Efficient Evaluation for a Subset of Recursive Queries (with S. Sippu and E. Soisalon-Soininen). 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '87) San Diego, California (1987) :284-293. pdf
  68. On the Representation and Querying of Sets of Possible Worlds (with S. Abiteboul and P. C. Kanellakis). ACM SIGMOd Annual Conference (SIGMOD '87) San Francisco, California (1987): 34-48. pdf
  69. Characterizations for Acyclic Database Schemes (with K.-J. Raiha). Advances in Computing Research 3, pp. 19-41 (1986).
  70. Update Semantics for Incomplete Databases (with S. Abiteboul). 11th International Conference on Very Large Databases (VLDB '85) Stockholm, Sweden (1985): 1-12. pdf
  71. Dependency Characterizations for Acyclic Database Schemes (with K.-J. Raiha). 3rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '84) Waterloo, Ontario (1984) :9-18. pdf
  72. Dependency Satisfaction in Databases with Incomplete Information. 10th International Conference on Very Large Databases (VLDB '84) Singapore (1984): 37-45. pdf
  73. Database Decomposition into Fourth Normal Form (with K.-J. Raiha). 9th International Conference on Very Large Databases (VLDB '83) Florence, Italy (1983): 186-196. pdf

[Concordia University] . [Faculty of ENCS] . [Department of CS] . [Gösta Grahne's homepage] .
Last modified in June 2022 by <grahne@cs.concordia.ca>