This section gives an overview of the results published in the domain of my research since my results were obtained and published. As I pursued in several interdisci-plinary areas, many new results are somehow related to mine. However, in this overview I consider only those which have direct impact on or connection to my results.
There are two possible approaches to OO data modelling with constraints:
deductive OO databases and constraint databases. In the former eld a new system called UNIDOOR[47] was introduced lately. Little is known about its deductive features but it is very likely that constraints are not universally applied in UNIDOOR as the main goal was to develop a deductive database with OO features on state-of-the-art technologies to foster the penetration of deductive (querying) features in mainstream environments [47]. Concerning the constraint databases, the focus has not changed over the last few years: managing constraints as data items for applications with massive amount of constraints like geographical systems or bioinformatics. Because of this the current research undertaken in the eld of constraint databases does not deal with general-purpose, state-of-the-art (i.e. OO) data modelling augmented with constraints.
Since I veried that my axiomatic data model is really OO, new versions of UML have been released. Version 2.2[92, 93] is the latest. But this does not aect my results because the denitions I used as reference remained unchanged in this version.
There is still much research interest in formally verifying certain properties of algorithms. No newer result has been published which applies to partial correctness of generic OO algorithms augmented with constraints. However, several other properties are investigated in the literature which indicates that a combination of techniques and tools is needed in practical applications. The recent work [76]
CHAPTER 5. OUTLOOK 71 provides a method to ease the development of new (e.g. merged) constructs to be applied in formal verication.
Plenty of publications has reported various results in the eld of OBIR. A part of these dealt with the ontology-based search itself. Performance problems were, too, reported in that context (e.g. [39]). That was exactly the starting point of my work in this eld, my results could therefore resolve these issues as well. The work [60] also uses heuristics to reduce the search space in advance. Such an approach appears to be rather infrequent, however. I assume that normally the performance of the core search method is improved until it becomes sucient.1
In the eld of physical databases, no development has been published recently w.r.t. representation of generic partial orders. I expect that this is going to change in the future because nowadays partial orders play an important role in data min-ing [88].
1This was not an option for us as it is usually the case with prototypes.
Bibliography
[1] Serge Abiteboul. Querying semi-structured data. In Foto N. Afrati and Phokion G. Kolaitis, editors, ICDT, volume 1186 of Lecture Notes in Com-puter Science, pages 118. Springer, 1997.
[2] Hassan Aït-Kaci. Warren's Abstract Machine: A Tutorial Reconstruction.
MIT Press, February 18 1999.
[3] Hassan Aït-Kaci, Robert Boyer, Patrick Lincoln, and Roger Nasr. Ecient implementation of lattice operations. ACM Transactions on Programming Languages and Systems, 11(1):115146, January 1989.
[4] Stuart Aitken and Sandy Reid. Evaluation of an ontology-based information retrieval tool. In R. Benjamins, A. Gomez-Perez, N. Guarino, and M. Uschold, editors, Workshop on Applications of Ontologies and Problem-solving Meth-ods, 14th European Conference on Articial Intelligence, Berlin, Germany, August 2025 2000.
[5] Ken Arnold, James Gosling, and David Holmes. The JavaTMProgramming Language. The Java Series. Prentice Hall PTR, 4th edition, August 17 2005.
[6] Malcolm P. Atkinson, François Bancilhon, David J. DeWitt, Klaus R. Dittrich, David Maier, and Stanley B. Zdonik. The object-oriented database system manifesto. In Won Kim, Jean-Marie Nicolas, and Shojiro Nishio, editors, Proceedings of the First International Conference on Deductive and Object-Oriented Databases, pages 223240, Kyoto Research Park, Kyoto, Japan, December 46 1989. Elsevier Science Publishers, North-Holland.
[7] Franz Baader, Diego Calvanese, Deborah L. McGuinness, Daniele Nardi, and Peter F. Patel-Schneider, editors. The Description Logic Handbook: Theory, implementation, and applications. Cambridge University Press, 2003.
[8] Franz Baader, Berndhard Hollunder, Berndhard Nebel, Hans-Jürgen Prof-itlich, and Enrico Franconi. An empirical analysis of optimization techniques
72
BIBLIOGRAPHY 73 for terminological representation systems or: Making KRIS get a move on. Applied Intelligence, 4(2):109132, May 1994.
[9] Ricardo Baeza-Yates and Berthier Ribeiro-Neto. Modern Information Re-trieval. ACM Press, 1999.
[10] Jørgen Bang-Jensen and Gregory Gutin. Digraphs: Theory, Algorithms and Applications. Springer Monographs in Mathematics. Springer-Verlag, Lon-don, 2002.
[11] Tim Berners-Lee. Information management: A proposal. Technical report, CERN, March 1989.
[12] Tim Berners-Lee, James Hendler, and Ora Lassila. The semantic web. Sci-entic American, pages 2837, May 2001.
[13] Garrett Birkho. Lattice Theory, volume XXV of American Mathematical So-ciety Colloquium Publications. American Mathematical SoSo-ciety, Providence, Rhode Island, third (new) edition, 1967.
[14] Béla Bollobás. Modern Graph Theory. Graduate Texts in Mathematics.
Springer, 12 August 2002.
[15] Egon Börger, Erich Grädel, and Yuri Gurevich. The Classical Decision Prob-lem. Springer-Verlag Telos, 1st edition, January 15 1997.
[16] Bartªomiej Bosek and Piotr Micek. On-line adaptive chain covering of up-growing posets. In René David, Danièle Gardy, Pierre Lescanne, and Marek Zaionc, editors, Computational Logic and Applications, CLA '05, volume AF of Discrete Mathematics and Theoretical Computer Science Proceedings, pages 3748, 2006.
[17] E. Bozsak, Marc Ehrig, Siegfried Handschuh, Andreas Hotho, Alexander Mädche, Boris Motik, Daniel Oberle, Christoph Schmitz, Steen Staab, Ljil-jana Stojanovic, Nenad Stojanovic, Rudi Studer, Gerd Stumme, York Sure, Julien Tane, Raphael Volz, and Valentin Zacharias. KAON Towards a large scale semantic web. In Kurt Bauknecht, A. Min Tjoa, and Gerald Quirch-mayr, editors, EC-Web 2002, volume 2455 of Lecture Notes in Computer Science, pages 304313. Springer Verlag Berlin Heidelberg, 2002.
[18] I. N. Bronshtein, K. A. Semendyayev, G. Musiol, and H. Mühlig. Handbook of Mathematics. Springer, 4th edition, June 14 2004.
[19] Peter Buneman. Semistructured data. In PODS, pages 117121. ACM Press, 1997.
[20] Peter Buneman, Susan B. Davidson, Gerd G. Hillebrand, and Dan Suciu. A query language and optimization techniques for unstructured data. In H. V.
Jagadish and Inderpal Singh Mumick, editors, SIGMOD Conference, pages 505516. ACM Press, 1996.
[21] ISO/IEC International Standard 14882: Programming Languages C++.
International Organization for Standardization, 2003.
BIBLIOGRAPHY 74 [22] Luca Cardelli. Type systems. In Allen B. Tucker, Jr., editor, Computer Science Handbook, chapter 97. CRC Press, 2nd edition, February 25 2004.
[23] Luca Cardelli and Peter Wegner. On understanding types, data abstraction, and polymorphism. ACM Computing Surveys, 17(4):471522, 1985.
[24] Svante Carlsson and Jingsen Chen. Searching rigid data structures (extended abstract). In Ding-Zhu Du and Ming Li, editors, COCOON'95, volume 959 of Lecture Notes in Computer Science, pages 446451, London, UK, 1995.
Springer-Verlag.
[25] Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa, and Eduardo Sany Laber. Searching in random partially ordered sets. Theoretical Computer Science, 321(1):4157, June 2004.
[26] Giuseppe Castagna. Object-Oriented Programming: A Unied Foundation.
Progress in Theoretical Computer Science. Birkhäuser, Boston, 1997.
[27] R. G. G. Cattell, Douglas Barry, Mark Berler, Je Eastman, David Jordan, Craig Russell, Olaf Schadow, Torsten Stanienda, and Fernando Valez, editors.
The Object Data Standard, ODMG 3.0. The Morgan Kaufmann Series in Data Management Systems. Morgan Kaufmann, San Francisco, California, USA, 2000.
[28] Peter Pin-Shan Chen. The entity-relationship model toward a unied view of data. ACM Transactions on Database Systems, 1(1):936, 1976.
[29] Edgar Frank Codd. A relational model of data for large shared data banks.
Communications of the ACM, 13(6):377387, June 1970.
[30] Thomas Connolly and Carolyn Begg. Database Systems: A Practical Ap-proach to Design, Implementation and Management. Addison-Wesley, 4th edition, May 2004.
[31] Daniel D. Corkill. Collaborating software: Blackboard and multi-agent sys-tems & the future. In Proceedings of the International Lisp Conference, New York, New York, USA, October 2003.
[32] Iain Craig. Blackboard Systems. Ablex Publishing Corporation, Norwood, New Jersey, 1995.
[33] C. J. Date. An Introduction to Database Systems, Volume I. Addison-Wesley Publishing Company, 5th edition, 1990.
[34] Michel-Marie Deza and Elena Deza. Dictionary of Distances. Elsevier Science, November 16 2006.
[35] Alvaro Adolfo Antunes Fernandes. An Axiomatic Approach to Deductive Object-Oriented Databases. PhD thesis, Heriot-Watt University, Depart-ment of Computing and Electrical Engineering, Edinburgh, Scotland, UK, September 1995.
BIBLIOGRAPHY 75 [36] Alvaro Adolfo Antunes Fernandes, Norman W. Paton, M. Howard Williams, and Andrew Bowles. Approaches to deductive object-oriented databases.
Information and Software Technology, 34(12):787803, December 1992.
[37] Hector Garcia-Molina, Jerey D. Ullman, and Jennifer D. Widom. Database Systems: The Complete Book. Prentice Hall, 2002.
[38] Giorgio Ghelli. Foundations for extensible objects with roles. Information and Computation, 175(1):5075, May 2002.
[39] Fausto Giunchiglia, Uladzimir Kharkevich, and Ilya Zaihrayeu. Concept search. In ESWC 2009, number 5554 in Lecture Notes in Computer Sci-ence, pages 429444. Springer-Verlag, 2009.
[40] James Gosling, Bill Joy, and Guy Steele. The JavaTMLanguage Specication.
The Java Series. Prentice Hall PTR, 3rd edition, June 14 2005.
[41] Georg Gottlob, Michael Schre, and Brigitte Röck. Extending object-oriented systems with roles. ACM Transactions on Information Systems, 14(3):268 296, 1996.
[42] Jim Gray. The next database revolution. In Gerhard Weikum, Arnd Christian König, and Stefan Deÿloch, editors, SIGMOD Conference, pages 14. ACM Press, June 1318 2004.
[43] Thomas R. Gruber. Toward principles for the design of ontologies used for knowledge sharing. International Journal of Human-Computer Studies, 43(5 6):907928, 1995.
[44] Godfrey Harold Hardy, John Edensor, and George Pólya Littlewood. Inequal-ities. Cambridge University Press, 2nd edition, 1988.
[45] Ian Horrocks and Ulrike Sattler. Decidability of SHIQ with complex role inclusion axioms. In Georg Gottlob and Toby Walsh, editors, IJCAI, pages 343348. Morgan Kaufmann, 2003.
[46] Selma kiz and Vijay Kumar Garg. Online algorithms for Dilworth's chain partition. Technical report, The University of Texas at Austin, USA, 2004.
[47] Mohammed K. Jaber and Andrei Voronkov. Implementation of UNIDOOR, a deductive object-oriented database system. In Yannis Manolopoulos and Jaroslav Pokorný an Timos K. Sellis, editors, ADBIS, volume 4152 of Lecture Notes in Computer Science, pages 155170. Springer-Verlag, 2006.
[48] Ragesh Jaiswal and Kapil Narula. Lattice theoretic algorithms. Technical report, Indian Institute of Technology, Kanpur, India, 2002.
[49] Cli Joslyn. Poset ontologies and concept lattices as semantic hierarchies.
In J. G. Carbonell and J. Siekmann, editors, ICCS 2004, volume 3127 of Lecture Notes in Articial Intelligence, pages 287302. Springer-Verlag Berlin Heidelberg, 2004.
BIBLIOGRAPHY 76 [50] Zsolt Tivadar Kardkovács. Heterogén adatbázisok lekérdezése strukturált nyelvi szerkezetek komplex szemantikai feldolgozásával (in Hungarian, Query-ing Heterogeneous Databases via ProcessQuery-ing Complex Semantics of Struc-tured Grammatical Phrases). PhD thesis, Budapest University of Technology and Economics, 2009.
[51] Zsolt Tivadar Kardkovács and Gábor Mihály Surányi. Ubiquitous access to deep content via web services. In Juan Manuel Cueva Lovelle, Bernardo Martín González Rodríguez, Luis Joyanes Aguilar, José Emilio Labra Gayo, and María del Puerto Paule Ruiz, editors, ICWE 2003, volume 2722 of Lec-ture Notes in Computer Science, pages 208211. Springer-Verlag, 2003.
[52] Zsolt Tivadar Kardkovács and Gábor Mihály Surányi. An axiomatic model for deductive object-oriented databases. In Proceedings of the 5th International Symposium of Hungarian Researchers on Computational Intelligence, pages 325336. Budapest Tech Hungarian Fuzzy Association, 2004.
[53] Zsolt Tivadar Kardkovács, Gábor Mihály Surányi, and Sándor Gajdos. Ap-plication of catalogues to integrate heterogeneous data banks. In Robert Meersman and Zahir Tari, editors, OTM Workshops, volume 2889 of Lec-ture Notes in Computer Science, pages 10451056. Springer-Verlag, 2003.
[54] Zsolt Tivadar Kardkovács, Gábor Mihály Surányi, and Sándor Gajdos. To-wards building knowledge centres on the world wide web. In Tatyana M.
Yakhno, editor, ADVIS, volume 3261 of Lecture Notes in Computer Science, pages 139149. Springer-Verlag, 2004.
[55] Zsolt Tivadar Kardkovács, Gábor Mihály Surányi, and Sándor Gajdos, dr.
On the integration of large data banks by a powerful cataloguing method.
In Proceedings of the John von Neumann PhD Conference, pages 4750, Budapest University of Technology and Economics, Building I, Ground Floor 017, October 2 2003. Budapest University of Technology and Economics, Faculty of Electrical Engingeering and Informatics.
[56] Zsolt Tivadar Kardkovács, Gábor Mihály Surányi, and Sándor Gajdos, dr.
On the integration of large data banks by a powerful cataloguing method.
Periodica Polytechnica, Series Electrical Engineering, 48(12):6170, 2004.
[57] Michael Kifer, Georg Lausen, and James Wu. Logical foundations of object-oriented and frame-based languages. Journal of the ACM, 42(4):741843, July 1995.
[58] Donald E. Knuth. Structured programming with go to statements. ACM Computing Surveys, 6(4):261301, 1974.
[59] Donald E. Knuth. The art of computer programming, volume 3: sorting and searching. Addison Wesley Longman Publishing Co., Inc., Redwood City, California, USA, 2nd edition, 1998.
[60] Hashiguchi Kohei and Yukawa Takashi. Speed-up of the information retrieval system using the concept-base. IEIC Technical Report (Institute of Electron-ics, Information and Communication Engineers), 103(603):711, 2004.
BIBLIOGRAPHY 77 [61] Robert Kowalski. Algorithm = logic + control. Communications of the ACM,
22(7):424436, 1979.
[62] Barry M. Leiner, Vinton G. Cerf, David D. Clark, Robert E. Kahn, Leonard Kleinrock, Daniel C. Lynch, Jon Postel, Larry G. Roberts, and Stephen Wol.
A brief history of the Internet, 10 December 2003.
[63] Liwu Li. Extending the Java language with dynamic classication. Journal of Object Technology, 3(7):101120, July-August 2004.
[64] Yanhong A. Liu and Scott David Stoller. From recursion to iteration: what are the optimizations? ACM SIGPLAN Notices, 34(11):7382, 1999.
[65] Robin Milner. A proposal for standard ML. In Proceedings of Symposium on Lisp and Functional Programming, pages 184197, New York, New York, USA, August 68 1984. ACM Press.
[66] Hans-Michael Müller, Eimear E. Kenny, and Paul W. Sternberg. Textpresso:
An ontology-based information retrieval and extraction system for biological literature. PLoS Biology, 2(11):19841998, November 2004.
[67] J. Ian Munro and Hendra Suwanda. Implicit data structures for fast search and update. Journal of Computer and System Sciences, 21(2):236250, 1980.
[68] Gábor Nagypál. Private communication.
[69] Hartmut Noltemeier. On a generalization of heaps. In Hartmut Noltemeier, editor, Graphtheoretic Concepts in Computer Science, volume 100 of Lecture Notes in Computer Science, pages 127136. Springer-Verlag, 1981.
[70] OCL 2.0 Specication. Object Management Group, Inc., May 1 2006.
[71] M. P. Papazoglou and B. J. Krämer. A database model for object dynamics.
The VLDB Journal, 6(2):7396, 1997.
[72] Jan Paralic and Ivan Kostial. Ontology-based information retrieval. In 14th International Conference on Information and Intelligent Systems, pages 23 28, Varazdin, Chroatia, September 2003.
[73] Christian Paz-Trillo, Renata Wassermann, and Paula P. Braga. Using on-tologies to retrieve video information: A system proposal. In Workshop on Ontologies and their Applications, pages 2328, São Luís, Maranhão, Brazil, September 28 2004.
[74] Darrell R. Raymond. Partial Order Databases. PhD thesis, University of Waterloo, Waterloo, Ontario, Canada, 1996.
[75] Raymond Reiter. Towards a logical reconstruction of relational database theory. In M. L. Brodie, J. Mylopoulos, and J. W. Schmidt, editors, On Conceptual Modelling: Perspectives from Articial Intelligence, Databases, and Programming Languages, pages 191233. Springer, New York, 1984.
BIBLIOGRAPHY 78 [76] Michael Roberson, Melanie Harries, Paul T. Darga, and Chandrasekhar Boy-apati. Ecient software model checking of soundness of type systems. In OOPSLA'08, pages 493504, New York, NY, USA, 2008. ACM.
[77] Elke A. Rundensteiner. MultiV iew: A methodology for supporting multiple views in object-oriented databases. In Li-Yan Yuan, editor, Proceedings of the 18th International Conference on Very Large Data Bases, pages 187198.
Morgan Kaufmann, August 2327 1992.
[78] Sándor Gajdos and Zsolt Tivadar Kardkovács and Gábor Mihály Surányi.
Deduktív objektumorientált adatbázis-kezel®k tervezése és megvalósítása (in Hungarian, Designing and implenenting deductive object-oriented database management systems). Híradástechnika (Journal on C5), L(11):1824, November 1999.
[79] Klaus Simon. An improved algorithm for transitive closure on acyclic digraphs.
In Laurent Kott, editor, Automata, Languages and Programming 13th International Colloquium, number 226 in Lecture Notes in Computer Science, pages 376386, Rennes, France, July 1986. Springer-Verlag.
[80] Lawrence Snyder. On uniquely represented data structures (extended ab-stract). In 18th Annual Symposium on Foundations of Computer Science, pages 142146, Los Alamitos, California, USA, 31 October2 November 1977. IEEE Computer Society.
[81] Henrik Bulskov Styltsvig. Ontology-based Information Retrieval. PhD thesis, Roskilde University, Denmark, May 2006.
[82] Gábor Mihály Surányi. Deduktív objektumorientált adatbázis-kezel® meg-valósítása (in Hungarian, Realising a deductive object-oriented database).
Master's thesis, Budapest University of Technology and Economics, Faculty of Electrical Engineering and Informatics, Department of Telecommunica-tions and Telematics, Budapest, Hungary, May 19 2000.
[83] Gábor Mihály Surányi. The &{-calculus and its basic properties. Techni-cal report, Budapest University of Technology and Economics, June 2004.
Available on-line: http://db.bme.hu/suranyi/calculus.pdf.
[84] Gábor Mihály Surányi. Neue Semantikrepräsentationen im Daten-bankbereich (in German, New representations of semantics in databases).
In Wissenschaftliche Mitteilungen der 17. Frühlingsakademie, pages 122128, Balatonfüred, Ungarn, May 48 2005. Technische und Wirtschaftwissenschaftliche Universität Budapest, Institut für Ingenieurweit-erbildung.
[85] Gábor Mihály Surányi. An object-oriented calculus with term constraints.
Journal of Functional Programming, 17(3):353386, May 2007.
[86] Gábor Mihály Surányi, Zsolt Tivadar Kardkovács, and Sándor Gajdos. Cat-alogues from a new perspective: a data structure for physical organisation.
In Georg Gottlob, András A. Benczúr, and János Demetrovics, editors, AD-BIS, volume 3255 of Lecture Notes in Computer Science, pages 204214.
Springer-Verlag, 2004.