{"title":"Tbt expert: A case study in integrating expert system technology with Computer Assisted instruction","authors":"Phillip Crews","doi":"10.1109/ICDE.1987.7272423","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272423","url":null,"abstract":"The objective of an Intelligent Computer Assisted instruction (ICAI) system is the development and delivery of instructional materials that analyze a student's performance in order to formulate individualized tutoring strategies. Successful experimental ICAI systems that employ expert system reasoning have generated interest in providing this technology to a broader user base. This paper presents the architecture of such an ICAI system which was developed by integrating an existing authoring system with an expert system shell. Design issues such as procedural versus non-procedural control, data sharing, and course organization are described as are the conceptual architecture and student/teacher paradigm which were used as a blueprint for the system.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114383121","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":"The performance of locking protocols in distributed databases","authors":"O. Wolfson","doi":"10.1109/ICDE.1987.7272381","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272381","url":null,"abstract":"The main purpose of a locking protocol is to ensure correct interleaving of actions executed by concurrent transactions. The locking protocol consists of a set of rules dictating how accessed entities should be locked and unlocked. As a result of obeying the rules, transactions incur an overhead, particularly in a distributed database. We propose three measures for evaluating this overhead, each most suitable to a different type of underlying communication network. Then, using a graph theoretic model, we analyze and compare three protocols according to each measure: two-phase-locking ([EGLT]), two-phase-locking with a fixed order imposed on the database-entities (ensuring deadlock freedom), and the tree protocol ([SK]). The combined overhead of the locking protocol and the two phase commit protocol ([G]) is also determined.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124426868","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 evaluation of recursion in (deductive) database systems by efficient differential fixpoint iteration","authors":"Ulrich Güntzer, Werner Kießling, R. Bayer","doi":"10.1109/ICDE.1987.7272365","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272365","url":null,"abstract":"Based on matured database technology the paper provides new insights into efficient ways to evaluate recursive deduction rules. We show how the forward-chaining approach to deduction can flexibly be married with goal-directed aspects of best/easiest-first strategies. From the natural fixpoint semantics of recursion we develop generally applicable differential iteration schemes that efficiently compute the fixpoint. Surprisingly the well-known Warshall-algorithm gets disclosed as a descendant of this class of algorithms. Performance measurements suggest the former as well as systolic Δ-algorithms with linear fixpoint equation as candidates for incorporating a transitive closure operator in databases. As a next important step towards integration of database technology and logic programming we suggest to profit from the standard features of concurrency control and transaction management by effectively using them for the synchronization of parallel deductions.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115203213","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}
S. Khoshafian, G. Copeland, Thomas Jagodis, H. Boral, P. Valduriez
{"title":"A query processing strategy for the decomposed storage model","authors":"S. Khoshafian, G. Copeland, Thomas Jagodis, H. Boral, P. Valduriez","doi":"10.1109/ICDE.1987.7272433","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272433","url":null,"abstract":"Handling parallelism in database systems involves the specification of a storage model, a placement strategy, and a query processing strategy. An important goal is to determine the appropriate combination of these three strategies in order to obtain the best performance advantages. In this paper we present a novel and promising query processing strategy for a decomposed storage model. We discuss some of the qualitative advantages of the scheme. We also compare the performance of the proposed “pivot” strategy with conventional query processing for the n-ary storage model. The comparison is performed using the Wisconsin Benchmarks.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120959112","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":"The multi-lingual database system","authors":"S. Demurjian, D. K. Hsiao","doi":"10.1109/ICDE.1987.7272355","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272355","url":null,"abstract":"This paper introduces a new and unconventional approach to the design and implementation of a database system, the multi-lingual database system (MLDS). The multi-lingual database system is a single database system that can execute many transactions written respectively in different data languages and support many databases structured correspondingly in various data models, i.e., DL/I transactions on hierarchical databases, CODASYL-DML transactions on network databases, SQL transactions on relational databases and Duplex transactions on functional databases. Thus, a multi-lingual database system allows the old transactions and existing databases to be migrated to the new environment, the experienced user to continue to utilize certain favorite features of existing data languages and data models, the new user to explore the strong features of the various data languages and data models, the hardware upgrade to be focused on a single system instead of a heterogeneous collection of database systems, and the database application to cover wider types of transactions and different modes of interactions.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115796599","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 classification and comparison of main memory database recovery techniques","authors":"M. Eich","doi":"10.1109/ICDE.1987.7272398","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272398","url":null,"abstract":"The declining cost of main memory and need for high performance database systems have recently inspired research into systems with massive amounts of memory and the ability to store complete databases in main memory It is recognized that in this framework the issues concerned with efficient database recovery are more complex than in traditional DBMS systems. In this paper we define a classification method for main memory database (MMDB) recovery techniques and discuss the results of a performance analysis conducted examining the different classes.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122366699","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":"Physical organization of temporal data","authors":"D. Rotem, A. Segev","doi":"10.1109/ICDE.1987.7272422","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272422","url":null,"abstract":"In this paper, we propose a partitioning scheme of files in a temporal database system, and develop algorithms to minimize the overflow associated with that scheme. The proposed partitioning is suitable for range queries and aggregation operations along the time dimension. Simulation results show that the partitioning algorithms proposed in this paper result in better performance than in the case of a grid-type partitioning.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132655120","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":"The qualitative character of intelligence","authors":"D. Kibler","doi":"10.1109/ICDE.1987.7272390","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272390","url":null,"abstract":"An examination of the character of naturally intelligent systems and artificially intelligent systems yields many qualitative differences. This short essay explores the possibility that these qualitative differences may be the reason for the limitations of current AI systems.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131098617","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":"Data engineering in Software Development Environments","authors":"G. Roman","doi":"10.1109/ICDE.1987.7272360","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272360","url":null,"abstract":"The design of a Software Development Environment (SDE) represents a very interesting point of contact between data engineering and software engineering. In this context data engineering becomes the cornerstone for successful software engineering practice. This paper attempts to bring about a better understanding of the difficulties associated with this task by considering sources of complexity in SDE design.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116611631","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":"An approach to schema integration and query formulation in federated database systems","authors":"B. Czejdo, M. Rusinkiewicz, D. Embley","doi":"10.1109/ICDE.1987.7272414","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272414","url":null,"abstract":"A language is introduced in which both schema integration and query formulation for federated database systems can be performed. The relational model is augmented with connectors that impose predicate conditions over attributes of relations either at the same or different sites. The relational model with connectors has a natural diagrammatic representation, and thus, the language has a graphical user interface. The theoretical foundation for the graphical language is algebraic. Bach algebraic operator maps a diagram (of relations with connectors) into another diagram, and every diagram represents a possible user query. Operators specifically designed to operate on incompatible schemas are introduced and formally defined. Possible domain incompatibilities are resolved by using extended abstract data types.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124807636","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}