{"title":"Incremental inheritance mechanism and its message evaluation method","authors":"M. Benattou, L. Lakhal","doi":"10.1109/BIWIT.1997.614063","DOIUrl":"https://doi.org/10.1109/BIWIT.1997.614063","url":null,"abstract":"The semantics of inheritance is based on subtyping. Several authors have shown that the subtype relation is insufficient to explain the inheritance mechanism in object oriented approach. Inheritance is an incremental mechanism for software development, based on modification. This approach was introduced by W.R. Cook. The aim of this paper is to present, an incremental formal model of single and multiple inheritance, based on the wrapping concept. The model is based upon an intuitive explanation of the proper use and purpose of inheritance, and is essentially dedicated to dynamic (i.e. run-time) inheritance of properties, for OODBMS. The denotational semantics method proposed using the incremental model of inheritance, allows dynamic message evaluation.","PeriodicalId":166034,"journal":{"name":"Proceedings of the Third Basque International Workshop on Information Technology - BIWIT'97 - Data Management Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123647315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A parallel extension for existing relational database management systems","authors":"M. Exbrayat, H. Kosch","doi":"10.1109/BIWIT.1997.614053","DOIUrl":"https://doi.org/10.1109/BIWIT.1997.614053","url":null,"abstract":"The considerable growth of online document searching and consulting brings many data providers to reconsider their database management system (DBMS) capacities. Parallel DBMSs then appear as a good solution, but the involved changes in administration and costs limit their breakthrough. To overcome these drawbacks, we propose a hybrid structure which adapts a parallel extension to an existing DBMS. This extension cuts down the amount of work of a sequential DBMS by parallelizing the incoming queries over a network of workstations. To allow this parallel execution, data are replicated over the stations according to a specific strategy. We describe this strategy and then examine the parallel query optimization.","PeriodicalId":166034,"journal":{"name":"Proceedings of the Third Basque International Workshop on Information Technology - BIWIT'97 - Data Management Systems","volume":"226 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130697513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Platform independent tool for designing quality graphical user interfaces","authors":"T.N. Nigam, T. Prabhakar","doi":"10.1109/BIWIT.1997.614051","DOIUrl":"https://doi.org/10.1109/BIWIT.1997.614051","url":null,"abstract":"Discusses some early work on the development of GUI design tools at IIT-Kanpur. The work is focused on the layout of the components that gives the interface a clear and consistent look, conforming to specifiable interface guidelines, in an application and across applications. This interface builder provides an environment for specifying component and layout specifications for the interface of Java applets and applications. The tool enables anyone who knows the semantics of the Java Abstract Windowing Toolkit (java.awt) to build quality interfaces. This is achieved by integrating general design principles with an easy-to-use design specification environment.","PeriodicalId":166034,"journal":{"name":"Proceedings of the Third Basque International Workshop on Information Technology - BIWIT'97 - Data Management Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115849322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A query algebra for object-oriented databases integrating versions","authors":"E. Andonoff, G. Hubert, A. Le Parc, G. Zurfluh","doi":"10.1109/BIWIT.1997.614052","DOIUrl":"https://doi.org/10.1109/BIWIT.1997.614052","url":null,"abstract":"Presents an algebra to query object-oriented databases that integrate versions. This algebra rests on an object-oriented data model which permits, by means of versions, the description of both value and schema evolutions for entities. The specificities of versions are taken into account. So, versions describing an entity may be queried either by considering the derivation hierarchy they belong to (all the entity states are considered) or independently, one from another (only some entity states are considered).","PeriodicalId":166034,"journal":{"name":"Proceedings of the Third Basque International Workshop on Information Technology - BIWIT'97 - Data Management Systems","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127466105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Object relational data models of the future","authors":"S. Miranda","doi":"10.1109/BIWIT.1997.614046","DOIUrl":"https://doi.org/10.1109/BIWIT.1997.614046","url":null,"abstract":"Object-relational data models (OR-data models) represent an emerging industry consensus on how objects should be integrated into the database world. Although these models have been studied in some derived syntactic forms (like NF2), their semantics aspects have not received much attention from the research community. The objective of this article is two-fold: clarifying the underlying concepts and pointing out promising areas of further research.","PeriodicalId":166034,"journal":{"name":"Proceedings of the Third Basque International Workshop on Information Technology - BIWIT'97 - Data Management Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122398337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimal interval partitioning for temporal databases","authors":"T. Zurek","doi":"10.1109/BIWIT.1997.614061","DOIUrl":"https://doi.org/10.1109/BIWIT.1997.614061","url":null,"abstract":"We analyse the problem of partitioning a collection of intervals into two or more subcollections, each of them holding intervals that intersect with a certain range of the intervals' domain. Intervals that intersect with more than one range impose a considerable overhead on processing and indexing interval data. The goal of interval partitioning (IP) is to find partitions that minimise the number of overlapping intervals. We describe an algorithm for finding optimal partitions and prove its correctness. An example scenario that is used throughout the paper gives an idea of the benefits of optimal interval partitioning.","PeriodicalId":166034,"journal":{"name":"Proceedings of the Third Basque International Workshop on Information Technology - BIWIT'97 - Data Management Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124139521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the functional approach to RDBMS","authors":"J. L. Freire, V. M. Gulías, X.M. Lopez","doi":"10.1109/BIWIT.1997.614064","DOIUrl":"https://doi.org/10.1109/BIWIT.1997.614064","url":null,"abstract":"In this work, an integration of a relational database manager (Postgres95) and a functional language (Objective Caml) is shown. The main goal consists of providing a mechanism to save values in non volatile storage following the client-server approach. The existing relationships between the structures offered by databases and those of functional languages, such as lists or tuples, are identified. Besides, we show how the use of functional abstractions may simplify the development of queries to interact with the database manager.","PeriodicalId":166034,"journal":{"name":"Proceedings of the Third Basque International Workshop on Information Technology - BIWIT'97 - Data Management Systems","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115613161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
E. Marcos, A. D. Miguel, Mario G. Piattini, Paloma Martínez
{"title":"SQL3/ODMG-93 integration through MIMO","authors":"E. Marcos, A. D. Miguel, Mario G. Piattini, Paloma Martínez","doi":"10.1109/BIWIT.1997.614065","DOIUrl":"https://doi.org/10.1109/BIWIT.1997.614065","url":null,"abstract":"MIMO is a model that tries to integrate some of the main current object models (SQL3, ODMG-93, UML), covering all the database development phases. It is defined in the framework of the ENEAS/BD project, that is being developed by the \"Grupo de Bases de Datos Avanzadas\" at \"Universidad Carlos III\". An objective of ENEAS/BD is to allow the generation of ODMG-93 and/or SQL3 schemata from an object analysis in MIMO. Therefore, MIMO must integrate the object models of both standards. This paper summarises an approximation to the correspondence between the database standards SQL3 and ODMG-93 (mainly centred in their type systems) accomplished through the construction level of MIMO. A comparison among the type system of both standards and MIMO is also achieved.","PeriodicalId":166034,"journal":{"name":"Proceedings of the Third Basque International Workshop on Information Technology - BIWIT'97 - Data Management Systems","volume":"314 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123218365","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A CASE tool to design distributed object oriented databases","authors":"C. Ernst, A. Lapujadez, F. Ravat, G. Zurfluh","doi":"10.1109/BIWIT.1997.614054","DOIUrl":"https://doi.org/10.1109/BIWIT.1997.614054","url":null,"abstract":"As part of our work concerning multimedia distributed applications, we have been led to develop a method and a CASE (computer aided software engineering) tool to design distributed object-oriented databases (OODBs). Firstly, we defined a top-down design method that allows us to build local conceptual schemata from a global conceptual schema. The originality of our work consists in dissociating the static aspects and the dynamic aspects that are intrinsically linked in the objects. At the logical level, the fragmentation step we propose deals only with the static schema classes and permits us to define mixed-class fragments. In order to facilitate the designer's task, we propose a CASE tool dedicated to distributed OODB design. This tool presents the advantage of being guided by the design process. It integrates various kinds of rules and constraints that are related to distributed OODB design. These rules and constraints ensure the syntactic and semantic integrity of the designer's work.","PeriodicalId":166034,"journal":{"name":"Proceedings of the Third Basque International Workshop on Information Technology - BIWIT'97 - Data Management Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132169181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Condition as temporal function in information systems","authors":"S. Jungjariyanonn, S.R. Schwer","doi":"10.1109/BIWIT.1997.614062","DOIUrl":"https://doi.org/10.1109/BIWIT.1997.614062","url":null,"abstract":"The majority of events and choices in information systems are driven by conditions. We argue that, as for facts or events, conditions have a time life during which it is pertinent to deal with them. In this paper, we study conditions as temporal boolean functions in the context of boolean algebra. We provide a taxonomy of conditions and an algorithm for computing boolean operators based on a formal language theoretical approach.","PeriodicalId":166034,"journal":{"name":"Proceedings of the Third Basque International Workshop on Information Technology - BIWIT'97 - Data Management Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128324203","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}