{"title":"The manager's assistant. An application of knowledge management","authors":"Dan D. Kogan","doi":"10.1109/ICDE.1984.7271323","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271323","url":null,"abstract":"The Manager's Assistant project at SDC is a decision aid for administrators of large development projects. It supports queries concerning funding and personnel issues. These queries are resolved either via direct database search or with the aid of a deductive mechanism, called DADM [Kell8l], which mediates database access. The Manager's Assistant is an application of SDC's on-going research in knowledge management [Kell82]. The Knowledge Manager system (KM-1) combines the reasoning engine, DADM, and a searching engine, both realized in specialized environments. DADM is implemented on a Xerox 1100 Lisp Machine and the searching engine consists of a Britton-Lee IDM-500 Database Machine. Through this effort we hope not only to further our understanding of some important issues in the design and implementation of knowledge bases, but also to build a practical and useful tool. This paper describes the knowledge base for the Manager's Assistant, its operating environment and its current modes of interaction.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"2017 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116027433","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}
F. Corella, S. Jerrold Kaplan, G. Wiederhold, Lena Yesil
{"title":"Cooperative responses to boolean queries","authors":"F. Corella, S. Jerrold Kaplan, G. Wiederhold, Lena Yesil","doi":"10.1109/ICDE.1984.7271257","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271257","url":null,"abstract":"Since cooperation is an essential aspect of human conversation, it is a necessary feature in a natural language interface. Previous work has shown that it is possible to incorporate principles of cooperative behaviour into a system allowing natural language access to a database. It is shown here that some of these principles can also be applied fruitfully in a formal language environment. Specifically, when a query retrieves an empty result set, it is possible, by analyzing the question and running related queries against the database, to give a useful explanation of the zero result. A precise specification of the information that should be presented to the user is described for queries consisting of boolean combinations of predicates of a single variable. Such cooperative responses to boolean queries have been implemented on the large bibliographic database of the Research Libraries Group. The size of the database has motivated a careful optimization of the algorithm, which is discussed.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126671342","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":"MALPHA: A relatiohal multidatabase manipulation language","authors":"W. Litwin","doi":"10.1109/ICDE.1984.7271258","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271258","url":null,"abstract":"MALPHA is a language for manipulations of data that constitute collections of relational databases. It generalizes to this environment the well known database manipulation language ALPHA of E. Γ. Codd. The principles that MALPHA proposes may also lead to MQUEL, MSQL etc. Since users typically face more than one database, the multidatabase manipulation languages should reveal more useful than the database ones.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124345413","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 semantic approach to usability in relational database systems","authors":"K. Sugihara, J. Miyao, T. Kikuno, N. Yoshida","doi":"10.1109/ICDE.1984.7271273","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271273","url":null,"abstract":"This paper attempts to design a user-friendly interface which enhances usability of relational database systems. Our approach to usability is to design a semantic data model suitable for a user interface and provide an easy-to-use query language DOMCALC (domain calculus language) which is based on the semantic data model. A query in DOMCALC can be described in terms of intuitive notions, namely domains, instead of relations and attributes. That is, DOMCALC requires for users no knowledge of a conceptual database such as relation names and attribute names. Therefore, the usability based on the semantic data model removes the requirement of knowledge of a conceptual database from users and protects user views from changes in the conceptual database. We also describe an outline of a database system PRIM (Prototype of Laboratory information Management System) which has been developed with the above considerations. This is a step toward the enhancement of usability in relational database systems.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126240954","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 query optimization: An engineering approach","authors":"R. Krishnamurthy, S. P. Morgan","doi":"10.1109/ICDE.1984.7271275","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271275","url":null,"abstract":"We present a novel preprocessing technique for distributed query optimization which achieves nearly all of the benefits that full database reduction by semijoin achieves, but for a small fraction of the cost. Most previous researchers have approached the problem of distributed query optimization with the idea of achieving maximum database reduction at any cost. We take an engineering approach — that, past a point of diminishing returns, database reduction is not cost-effective. We introduce a technique called \"partial reduction\", which uses a sequence of \"bucket semijoins\" to eliminate nearly all of the irrelevant tuples eliminated by a fully reducing sequence of semijoins. We provide a performance analysis for a simple binary semijoin compared to a bucket semijoin, and show that a bucket semijoin can achieve, say, 90% of the reduction that a semijoin can, but for, say, 10% of the cost. Although we used some simplifying assumptions in our analysis, we argue that relaxing these assumptions does not diminish our results in any way. We discuss the sensitivity of our technique to its parameters, and we show that our results improve for multiple join and inequality join queries.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131567517","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 pipeline and parallel architecture for supporting database management systems","authors":"Yang-Chang Hong","doi":"10.1109/ICDE.1984.7271267","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271267","url":null,"abstract":"A pipeline and parallel architecture is described and analyzed for efficient support of database management systems. The main feature of the architecture is a RAM consisting of two bit-arrays, one word-array, and one memory bank. Through the use of the RAM, cross referencing involved in the join and project operations can be removed, without the need for sorting. Further performance improvements are achieved by using parallelism in tuple cancatenation and tuple comparison via a set of servers. The architecuture is quite suitable for a wide range of database applications, especially those requiring a high percentage of cross referencing. A hardware simulator was developed for determining the optimal number of servers for different applications.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130853759","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":"Comparison-criteria for semantic data models","authors":"M. Schrefl, A. Tjoa, R. Wagner","doi":"10.1109/ICDE.1984.7271263","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271263","url":null,"abstract":"This paper classifies a collection of semantic data models within a framework consisting of the following comparison-criteria: classification, aggregation, generalization and association (resp. cover aggregation).","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127894876","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":"Performance modeling of distributed database","authors":"M. Tsuchiya, M. P. Mariani","doi":"10.1109/ICDE.1984.7271320","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271320","url":null,"abstract":"This paper describes a simple yet effective distributed database model that simulates database utilization in the distributed data processing environment. The model is table driven such that database access requirements, file location, and other information necessary for defining the database environment are set up internally in several tables. Each database transaction is defined and represented by a transaction flow diagram (TFD) and a sequence of TFDs representing a operational scenario is input to the model. The model \"executes\" input TFDs by looking up tables that specify their data file access requirements. While executing TFDs, the history of database usage is logged and various statistics are gathered. The performance data are used to measure database access overhead, characterize database workload, and fine-tune performance by reallocating files. The model has been implemented in Fortran on the VAX 11/780 and has been used for both measuring the given database performance and analyzing sensitivity to design changes. It has proven to be an effective tool for analyzing design effectiveness of distributed databases.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126386660","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":"Diophantine inferences from statistical aggregates on few-valued attributes","authors":"N. Rowe","doi":"10.1109/ICDE.1984.7271261","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271261","url":null,"abstract":"Research on protection of statistical databases from revelation of private or sensitive information [Denning, 1982, ch. 6] has rarely examined situations where domain-dependent structure exists for a data attribute such that only a very few independent variables can characterize it. Such circumstances can lead to Diophantine (that is, integer-solution) equations whose solution can lead to surprising or compromising inferences on quite large data populations. In many cases the Diophantine equations are linear, allowing efficient algorithmic solution. Probabilistic models can also be used to rank solutions by reasonability, further pruning the search space. Unfortunately, it is difficult to protect against this form of data compromise, and all countermeasures have disadvantages.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126532668","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 theory of data: Implications for information retrieval","authors":"J. L. Dolby","doi":"10.1109/ICDE.1984.7271262","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271262","url":null,"abstract":"The growing mountain of information in the form of numeric data poses a significant problem for those activities that support the data user. Existing database management systems are designed to connect data elements into records and produce reports — frequently in the form of tables. Tables of data, however, acquire a subsequent life of their own. They are analyzed, reworked, and combined with other tables, and then stored and retrieved for further analysis and presentation to others. This paper explores the problem of determining the requirements for a table-based storage and retrieval system based on an abstract data structure for tables as structural entities.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134152823","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}