{"title":"A methodology for integration of binary-relationship conceptual schemas","authors":"P. Shoval","doi":"10.1109/PARBSE.1990.77172","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77172","url":null,"abstract":"A description is given of BRIM, a view integration methodology which utilizes the binary-relationship data model to create a global conceptual schema. In the preintegration stage it assists the designer in preparing an integration plan. Then, in the conflict resolution stage it identifies and resolves all possible types of conflicts between schemas, including naming conflicts (i.e. homonyms and synonyms) and structural conflicts (i.e. type, dependency, key, constraint, and hierarchy conflicts). Once conflicts are resolved and the source schemas are confirmed, the conflict-free schemas are merged, and interschema relationships are added to the integrated schema. BRIM is being implemented as part of ADDS, a system for automated database design. The tool leads the designer through all the stages of the integration process, providing an integrated conceptual schema which can then be automatically transformed into a normalized database schema.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126279071","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":"Reverse data engineering of E-R-designed relational schemas","authors":"F. Springsteel, C. Kou","doi":"10.1109/PARBSE.1990.77173","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77173","url":null,"abstract":"A novel solution is presented for the data engineer's inverse mapping problem: to construct from a relational database schema (RDBS) a corresponding entity-relationship diagram (ERD). The inverse mapping is difficult because many ERDs may correspond to one ERDs, or to none if the schema is not well formed, so it is not clear how to define a mapping in this direction. Nonetheless, it would be desirable to choose the most representative ERD whenever possible, so that the benefits of E-R visualization and analysis can be applied to RDBSs, even after their relation schemes have been changed. The authors present a first approach to an experimental solution for this inversion problem, for the case of an RDBS that was originally designed by an ERD-based algorithm, which means that it was once a canonical relational schema (CRS) and subsequently altered. The demonstration system tracks each 'atomic change' in the CRS and determines, by means of its PROLOG-implemented E-R knowledge base, the corresponding changes in the given ERD. The reasonable restrictions that the present system puts on the legal set of possible changes, for example, on deletions, allow it to trace their effects correctly, so that well-formedness of the ERD is preserved.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127839597","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":"Distributed database architectures","authors":"M. Papazoglou","doi":"10.1109/PARBSE.1990.77215","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77215","url":null,"abstract":"The characteristics of distributed database architectures are discussed. It is noted that the advent of powerful modeling facilities, such as object-oriented and knowledge-based data models, has paved the way for a complete reconsideration of several of the long standing assumptions and perspectives that are pervading the field of distributed database architectures. It is now possible to propose novel architectures based on high-level data modeling facilities. The advocated architecture is called the semidecentralized or clustered architecture and combines the positive aspects of both logically centralized and federated databases. This architecture substantiates the substrate which automatically classifies the activities that each preexisting data base management system may undertake and is in the position to describe the entire volume of information that can be supplied by each individual database system in the network.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"2011 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121348819","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 vector dataflow architecture","authors":"H. Ahmed","doi":"10.1109/PARBSE.1990.77195","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77195","url":null,"abstract":"The author presents a vector data-flow (VDF) architecture which is based on the following design philosophy: increasing data granularity, whenever possible, by grouping together ordered sequences of data into logical structures called vectors; increasing node granularity by grouping together nodes, according to a partitioning algorithm, to form logical structures called tasks; and supporting efficient execution of both vector and task structures by designing a dedicated hardware level. The VDF processor based on this scheme is described, and simulation results are presented.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122835188","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":"Embedding shuffle networks in hypercubes","authors":"R. Varadarajan","doi":"10.1016/0743-7315(91)90049-F","DOIUrl":"https://doi.org/10.1016/0743-7315(91)90049-F","url":null,"abstract":"","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120659162","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":"Logic approach of data models: data logic","authors":"T. Miura, H. Arisawa","doi":"10.1109/PARBSE.1990.77212","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77212","url":null,"abstract":"The basic concepts of data models and data logic are defined. Attention is then given to the goals of data logic: (1) semantics modeling capabilities, (2) complex objects for description and operations, (3) data manipulation, and (4) deductive capabilities.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"169 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115916852","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":"Sorting and joining relations with duplicate attribute values","authors":"M. Abdelguerfi, A. Sood","doi":"10.1109/PARBSE.1990.77114","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77114","url":null,"abstract":"The computational complexity of sorting and joining relations with duplicates is investigated. The measure of complexity is the number of three branch comparisons needed to process these operations. A relation is characterized by its cardinality n and the number of distinct elements L in the attribute columns of interest. Under this characterization, the worst time complexity of these two operations is investigated. Upper and lower bounds on the number of three branch comparisons needed to process these two operations are established. It is shown, in particular, that a priori knowledge of the number of distinct elements in the attribute columns of interest leads to a reduction in the computational complexity of these two operations.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114481351","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 free-text search system with indexing","authors":"N. Asokan, S. Ranka, O. Frieder","doi":"10.1109/PARBSE.1990.77193","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77193","url":null,"abstract":"The present status of a parallel free-text search system on the Connection Machine that uses an indexing scheme is described. The system promises to be efficient when the database is a very large. The use of indexing resulted in the reduction of the search space, thereby making the performance of the system comparable to that of the fastest uniprocessor systems.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114875151","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":"Extending and configuring the PRIMA database management system kernel","authors":"H. Schoning, A. Sikeler","doi":"10.1109/PARBSE.1990.77221","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77221","url":null,"abstract":"The authors give an overview of the mechanisms used in a specific DBMS (database management system) kernel, PRIMA, to easily extend and configure the system in advance, as well as on-line. They discuss four kinds of extensions: (1) schema extensions, that is, on-line addition and removal of object types and attributes without nasty data reorganization; (2) data model extensions, which allow for the introduction of new data types and operations for existing databases; (3) algorithmic extensions, which offer the possibility of improving the performance of a running system by the addition of new algorithms for existing operators and components; and (4) storage structure extensions, which can be used to organize already existing data (possibly redundantly) in newly integrated types of storage structures supporting the specific access characteristic of an application more efficiently.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121731273","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}
D.P. Gluch, B. Furht, G. Coville, J. Green, G. Heikkinen, C. Raeuber, G. Spicker, A. Alberto, S. Correll, S. Geffin, M. Guerrero, B. Routt, W. Sitterberg
{"title":"A reconfigurable real-time RISC computer system","authors":"D.P. Gluch, B. Furht, G. Coville, J. Green, G. Heikkinen, C. Raeuber, G. Spicker, A. Alberto, S. Correll, S. Geffin, M. Guerrero, B. Routt, W. Sitterberg","doi":"10.1109/PARBSE.1990.77128","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77128","url":null,"abstract":"The hardware architecture of a modular redundant and reconfigurable RISC- (reduced-instruction-set-computer) based fault-tolerant computer system that meets the high availability requirements of real-time applications is presented. A range of redundancy levels is available, and these levels can be defined by the user during the initial or any subsequent system configuration process. Fail-operational capabilities are provided for processor, memory, internal bus, I/O, and power source subsystem failures, and an optional uninterruptible power supply is available. The system protects both stored and output data from corruption upon failures, and the system's fault tolerance and redundancy are transparent to the user. Overall, the fault-tolerance functions are closely integrated with diagnostic software to facilitate system maintenance and repair.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123300249","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}